./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS --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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- 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-4e7fbc6 [2022-11-23 02:36:26,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:36:26,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:36:26,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:36:26,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:36:26,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:36:26,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:36:26,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:36:26,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:36:26,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:36:26,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:36:26,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:36:26,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:36:26,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:36:26,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:36:26,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:36:26,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:36:26,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:36:26,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:36:26,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:36:26,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:36:26,297 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:36:26,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:36:26,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:36:26,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:36:26,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:36:26,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:36:26,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:36:26,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:36:26,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:36:26,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:36:26,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:36:26,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:36:26,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:36:26,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:36:26,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:36:26,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:36:26,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:36:26,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:36:26,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:36:26,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:36:26,336 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-23 02:36:26,385 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:36:26,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:36:26,389 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:36:26,389 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:36:26,390 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:36:26,390 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:36:26,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:36:26,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:36:26,392 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:36:26,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:36:26,393 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:36:26,394 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 02:36:26,394 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:36:26,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:36:26,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:36:26,395 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 02:36:26,395 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 02:36:26,395 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 02:36:26,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:36:26,396 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 02:36:26,396 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:36:26,396 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:36:26,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:36:26,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:36:26,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:36:26,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:36:26,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:36:26,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:36:26,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:36:26,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 02:36:26,399 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:36:26,399 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:36:26,400 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:36:26,400 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/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_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2022-11-23 02:36:26,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:36:26,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:36:26,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:36:26,758 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:36:26,759 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:36:26,760 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-23 02:36:30,034 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:36:30,302 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:36:30,303 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-23 02:36:30,317 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/data/fcc43e795/cf859da5a4f44552bcdae34ecac9b49d/FLAGdd049e5f2 [2022-11-23 02:36:30,333 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/data/fcc43e795/cf859da5a4f44552bcdae34ecac9b49d [2022-11-23 02:36:30,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:36:30,338 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:36:30,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:36:30,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:36:30,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:36:30,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:36:30" (1/1) ... [2022-11-23 02:36:30,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@242df697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:30, skipping insertion in model container [2022-11-23 02:36:30,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:36:30" (1/1) ... [2022-11-23 02:36:30,354 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:36:30,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:36:30,801 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-23 02:36:30,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:36:30,829 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:36:30,906 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-23 02:36:30,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:36:30,946 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:36:30,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:30 WrapperNode [2022-11-23 02:36:30,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:36:30,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:36:30,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:36:30,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:36:30,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:30" (1/1) ... [2022-11-23 02:36:30,999 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:30" (1/1) ... [2022-11-23 02:36:31,045 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2022-11-23 02:36:31,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:36:31,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:36:31,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:36:31,047 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:36:31,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:30" (1/1) ... [2022-11-23 02:36:31,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:30" (1/1) ... [2022-11-23 02:36:31,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:30" (1/1) ... [2022-11-23 02:36:31,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:30" (1/1) ... [2022-11-23 02:36:31,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:30" (1/1) ... [2022-11-23 02:36:31,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:30" (1/1) ... [2022-11-23 02:36:31,078 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:30" (1/1) ... [2022-11-23 02:36:31,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:30" (1/1) ... [2022-11-23 02:36:31,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:36:31,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:36:31,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:36:31,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:36:31,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:30" (1/1) ... [2022-11-23 02:36:31,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:36:31,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:36:31,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:36:31,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:36:31,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 02:36:31,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 02:36:31,177 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-23 02:36:31,177 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-23 02:36:31,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 02:36:31,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:36:31,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 02:36:31,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 02:36:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 02:36:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 02:36:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-23 02:36:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 02:36:31,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:36:31,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:36:31,322 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:36:31,341 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:36:31,859 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:36:31,867 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:36:31,867 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-23 02:36:31,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:31 BoogieIcfgContainer [2022-11-23 02:36:31,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:36:31,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:36:31,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:36:31,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:36:31,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:36:30" (1/3) ... [2022-11-23 02:36:31,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5252dd32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:36:31, skipping insertion in model container [2022-11-23 02:36:31,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:30" (2/3) ... [2022-11-23 02:36:31,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5252dd32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:36:31, skipping insertion in model container [2022-11-23 02:36:31,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:31" (3/3) ... [2022-11-23 02:36:31,884 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2022-11-23 02:36:31,906 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:36:31,906 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2022-11-23 02:36:31,970 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:36:31,977 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@575ab93c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:36:31,977 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-11-23 02:36:31,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:36:31,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 02:36:31,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:36:31,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 02:36:31,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:36:31,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:36:31,997 INFO L85 PathProgramCache]: Analyzing trace with hash 895059861, now seen corresponding path program 1 times [2022-11-23 02:36:32,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:36:32,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572819514] [2022-11-23 02:36:32,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:32,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:36:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:32,365 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-23 02:36:32,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:36:32,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572819514] [2022-11-23 02:36:32,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572819514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:36:32,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:36:32,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:36:32,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399711951] [2022-11-23 02:36:32,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:36:32,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:36:32,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:36:32,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:36:32,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:36:32,440 INFO L87 Difference]: Start difference. First operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:36:32,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:36:32,622 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-11-23 02:36:32,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:36:32,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-23 02:36:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:36:32,637 INFO L225 Difference]: With dead ends: 114 [2022-11-23 02:36:32,637 INFO L226 Difference]: Without dead ends: 111 [2022-11-23 02:36:32,638 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-23 02:36:32,642 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:36:32,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 179 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:36:32,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-23 02:36:32,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-11-23 02:36:32,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 106 states have internal predecessors, (113), 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-23 02:36:32,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2022-11-23 02:36:32,686 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 6 [2022-11-23 02:36:32,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:36:32,687 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2022-11-23 02:36:32,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:36:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2022-11-23 02:36:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 02:36:32,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:36:32,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 02:36:32,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 02:36:32,689 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:36:32,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:36:32,690 INFO L85 PathProgramCache]: Analyzing trace with hash 895059862, now seen corresponding path program 1 times [2022-11-23 02:36:32,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:36:32,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118675695] [2022-11-23 02:36:32,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:32,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:36:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:32,811 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-23 02:36:32,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:36:32,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118675695] [2022-11-23 02:36:32,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118675695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:36:32,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:36:32,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:36:32,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78834189] [2022-11-23 02:36:32,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:36:32,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:36:32,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:36:32,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:36:32,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:36:32,815 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:36:32,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:36:32,917 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2022-11-23 02:36:32,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:36:32,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-23 02:36:32,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:36:32,919 INFO L225 Difference]: With dead ends: 109 [2022-11-23 02:36:32,920 INFO L226 Difference]: Without dead ends: 109 [2022-11-23 02:36:32,920 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-23 02:36:32,921 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:36:32,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 181 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:36:32,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-23 02:36:32,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-11-23 02:36:32,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 59 states have (on average 1.88135593220339) internal successors, (111), 104 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:36:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2022-11-23 02:36:32,933 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 6 [2022-11-23 02:36:32,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:36:32,933 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2022-11-23 02:36:32,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:36:32,934 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-11-23 02:36:32,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 02:36:32,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:36:32,934 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:36:32,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 02:36:32,935 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:36:32,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:36:32,936 INFO L85 PathProgramCache]: Analyzing trace with hash 100467671, now seen corresponding path program 1 times [2022-11-23 02:36:32,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:36:32,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804774364] [2022-11-23 02:36:32,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:32,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:36:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:33,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:36:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:33,071 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-23 02:36:33,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:36:33,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804774364] [2022-11-23 02:36:33,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804774364] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:36:33,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:36:33,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:36:33,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39376414] [2022-11-23 02:36:33,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:36:33,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:36:33,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:36:33,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:36:33,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:36:33,074 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:36:33,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:36:33,225 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-11-23 02:36:33,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:36:33,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-23 02:36:33,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:36:33,229 INFO L225 Difference]: With dead ends: 116 [2022-11-23 02:36:33,231 INFO L226 Difference]: Without dead ends: 116 [2022-11-23 02:36:33,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:36:33,241 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 5 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:36:33,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 269 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:36:33,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-23 02:36:33,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2022-11-23 02:36:33,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 105 states have internal predecessors, (112), 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-23 02:36:33,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2022-11-23 02:36:33,263 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 13 [2022-11-23 02:36:33,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:36:33,264 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2022-11-23 02:36:33,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:36:33,264 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2022-11-23 02:36:33,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 02:36:33,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:36:33,265 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:36:33,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 02:36:33,266 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:36:33,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:36:33,267 INFO L85 PathProgramCache]: Analyzing trace with hash -900354020, now seen corresponding path program 1 times [2022-11-23 02:36:33,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:36:33,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145814088] [2022-11-23 02:36:33,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:33,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:36:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:33,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:36:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:33,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:36:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:36:33,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:36:33,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145814088] [2022-11-23 02:36:33,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145814088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:36:33,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:36:33,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:36:33,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652570834] [2022-11-23 02:36:33,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:36:33,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 02:36:33,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:36:33,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 02:36:33,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 02:36:33,680 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:36:34,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:36:34,010 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-11-23 02:36:34,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:36:34,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-23 02:36:34,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:36:34,017 INFO L225 Difference]: With dead ends: 110 [2022-11-23 02:36:34,018 INFO L226 Difference]: Without dead ends: 110 [2022-11-23 02:36:34,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:36:34,028 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 13 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:36:34,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 380 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 02:36:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-23 02:36:34,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-11-23 02:36:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 60 states have (on average 1.85) internal successors, (111), 104 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:36:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2022-11-23 02:36:34,048 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 22 [2022-11-23 02:36:34,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:36:34,049 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2022-11-23 02:36:34,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:36:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-11-23 02:36:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 02:36:34,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:36:34,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:36:34,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 02:36:34,052 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:36:34,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:36:34,053 INFO L85 PathProgramCache]: Analyzing trace with hash -900354019, now seen corresponding path program 1 times [2022-11-23 02:36:34,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:36:34,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673416315] [2022-11-23 02:36:34,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:34,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:36:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:34,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:36:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:34,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:36:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:34,484 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:36:34,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:36:34,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673416315] [2022-11-23 02:36:34,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673416315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:36:34,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:36:34,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:36:34,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679860034] [2022-11-23 02:36:34,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:36:34,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 02:36:34,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:36:34,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 02:36:34,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 02:36:34,489 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:36:34,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:36:34,811 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2022-11-23 02:36:34,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:36:34,811 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-23 02:36:34,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:36:34,813 INFO L225 Difference]: With dead ends: 109 [2022-11-23 02:36:34,813 INFO L226 Difference]: Without dead ends: 109 [2022-11-23 02:36:34,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:36:34,814 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 11 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:36:34,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 404 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 02:36:34,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-23 02:36:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2022-11-23 02:36:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 103 states have internal predecessors, (110), 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-23 02:36:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2022-11-23 02:36:34,843 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 22 [2022-11-23 02:36:34,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:36:34,843 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2022-11-23 02:36:34,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:36:34,844 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2022-11-23 02:36:34,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 02:36:34,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:36:34,844 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:36:34,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 02:36:34,845 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:36:34,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:36:34,846 INFO L85 PathProgramCache]: Analyzing trace with hash -375857467, now seen corresponding path program 1 times [2022-11-23 02:36:34,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:36:34,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272106392] [2022-11-23 02:36:34,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:34,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:36:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:35,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:36:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:35,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:36:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 02:36:35,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:36:35,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272106392] [2022-11-23 02:36:35,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272106392] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:36:35,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120573670] [2022-11-23 02:36:35,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:35,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:36:35,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:36:35,163 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:36:35,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 02:36:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:35,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-23 02:36:35,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:36:35,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:36:35,429 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_256))) is different from true [2022-11-23 02:36:35,450 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_256))) is different from true [2022-11-23 02:36:35,496 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 02:36:35,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-23 02:36:35,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-23 02:36:35,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:36:36,029 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:36:36,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120573670] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:36:36,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:36:36,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2022-11-23 02:36:36,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566321123] [2022-11-23 02:36:36,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:36:36,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-23 02:36:36,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:36:36,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-23 02:36:36,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2022-11-23 02:36:36,063 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 02:36:36,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:36:36,530 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2022-11-23 02:36:36,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:36:36,531 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-11-23 02:36:36,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:36:36,533 INFO L225 Difference]: With dead ends: 125 [2022-11-23 02:36:36,533 INFO L226 Difference]: Without dead ends: 125 [2022-11-23 02:36:36,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2022-11-23 02:36:36,534 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 115 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 02:36:36,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 406 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 394 Invalid, 0 Unknown, 260 Unchecked, 0.4s Time] [2022-11-23 02:36:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-23 02:36:36,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2022-11-23 02:36:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 60 states have (on average 1.8166666666666667) internal successors, (109), 102 states have internal predecessors, (109), 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-23 02:36:36,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2022-11-23 02:36:36,553 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 25 [2022-11-23 02:36:36,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:36:36,553 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2022-11-23 02:36:36,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 02:36:36,554 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2022-11-23 02:36:36,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 02:36:36,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:36:36,555 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:36:36,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 02:36:36,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:36:36,770 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:36:36,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:36:36,770 INFO L85 PathProgramCache]: Analyzing trace with hash -375857466, now seen corresponding path program 1 times [2022-11-23 02:36:36,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:36:36,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161826054] [2022-11-23 02:36:36,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:36,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:36:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:37,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:36:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:37,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:36:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:36:37,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:36:37,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161826054] [2022-11-23 02:36:37,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161826054] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:36:37,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676735887] [2022-11-23 02:36:37,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:37,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:36:37,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:36:37,504 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:36:37,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 02:36:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:37,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-23 02:36:37,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:36:37,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:36:37,971 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:36:37,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 02:36:37,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-23 02:36:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:36:38,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:36:38,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676735887] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:36:38,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:36:38,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2022-11-23 02:36:38,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909726821] [2022-11-23 02:36:38,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:36:38,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 02:36:38,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:36:38,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 02:36:38,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-11-23 02:36:38,265 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-23 02:36:38,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:36:38,900 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-11-23 02:36:38,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 02:36:38,901 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-11-23 02:36:38,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:36:38,902 INFO L225 Difference]: With dead ends: 108 [2022-11-23 02:36:38,902 INFO L226 Difference]: Without dead ends: 108 [2022-11-23 02:36:38,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2022-11-23 02:36:38,903 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 206 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 02:36:38,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 453 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 02:36:38,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-23 02:36:38,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2022-11-23 02:36:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 60 states have (on average 1.8) internal successors, (108), 101 states have internal predecessors, (108), 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-23 02:36:38,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2022-11-23 02:36:38,909 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 25 [2022-11-23 02:36:38,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:36:38,910 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2022-11-23 02:36:38,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-23 02:36:38,910 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2022-11-23 02:36:38,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-23 02:36:38,911 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:36:38,911 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:36:38,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 02:36:39,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:36:39,112 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:36:39,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:36:39,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867041, now seen corresponding path program 1 times [2022-11-23 02:36:39,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:36:39,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182476321] [2022-11-23 02:36:39,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:39,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:36:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:39,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:36:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:39,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:36:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:39,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:36:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 02:36:39,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:36:39,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182476321] [2022-11-23 02:36:39,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182476321] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:36:39,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163250733] [2022-11-23 02:36:39,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:39,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:36:39,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:36:39,714 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:36:39,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 02:36:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:39,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-23 02:36:39,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:36:39,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:36:39,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:36:39,940 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_521 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_521))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-23 02:36:40,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:40,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:36:40,050 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_522))) is different from true [2022-11-23 02:36:40,068 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_522))) is different from true [2022-11-23 02:36:40,090 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 02:36:40,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-23 02:36:40,155 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-23 02:36:40,177 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:36:40,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:36:40,188 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2022-11-23 02:36:40,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:36:40,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163250733] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:36:40,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:36:40,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2022-11-23 02:36:40,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84677678] [2022-11-23 02:36:40,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:36:40,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 02:36:40,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:36:40,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 02:36:40,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=272, Unknown=4, NotChecked=148, Total=506 [2022-11-23 02:36:40,660 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-23 02:36:41,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:36:41,073 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-11-23 02:36:41,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:36:41,074 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-11-23 02:36:41,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:36:41,075 INFO L225 Difference]: With dead ends: 116 [2022-11-23 02:36:41,075 INFO L226 Difference]: Without dead ends: 116 [2022-11-23 02:36:41,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=363, Unknown=4, NotChecked=172, Total=650 [2022-11-23 02:36:41,076 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 345 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 402 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:36:41,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 229 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 277 Invalid, 0 Unknown, 402 Unchecked, 0.3s Time] [2022-11-23 02:36:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-23 02:36:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2022-11-23 02:36:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 93 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:36:41,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2022-11-23 02:36:41,080 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 37 [2022-11-23 02:36:41,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:36:41,081 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2022-11-23 02:36:41,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-23 02:36:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2022-11-23 02:36:41,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-23 02:36:41,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:36:41,082 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:36:41,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 02:36:41,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:36:41,289 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:36:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:36:41,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867040, now seen corresponding path program 1 times [2022-11-23 02:36:41,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:36:41,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401872681] [2022-11-23 02:36:41,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:41,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:36:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:41,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:36:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:41,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:36:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:42,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:36:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 02:36:42,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:36:42,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401872681] [2022-11-23 02:36:42,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401872681] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:36:42,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690956154] [2022-11-23 02:36:42,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:42,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:36:42,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:36:42,091 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:36:42,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 02:36:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:42,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-23 02:36:42,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:36:42,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:36:42,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:36:42,343 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_686 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_686) |c_#length|)))) is different from true [2022-11-23 02:36:42,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:42,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:36:42,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:36:42,438 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_687 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_687))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-23 02:36:42,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:42,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:36:42,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:36:42,568 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-23 02:36:42,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:42,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:36:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2022-11-23 02:36:42,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:36:42,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690956154] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:36:42,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:36:42,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2022-11-23 02:36:42,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660183306] [2022-11-23 02:36:42,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:36:42,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-23 02:36:42,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:36:42,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 02:36:42,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2022-11-23 02:36:42,733 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-23 02:36:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:36:43,179 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-11-23 02:36:43,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 02:36:43,180 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-11-23 02:36:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:36:43,181 INFO L225 Difference]: With dead ends: 108 [2022-11-23 02:36:43,181 INFO L226 Difference]: Without dead ends: 108 [2022-11-23 02:36:43,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=215, Unknown=3, NotChecked=96, Total=380 [2022-11-23 02:36:43,182 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 285 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:36:43,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 203 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 274 Invalid, 0 Unknown, 273 Unchecked, 0.3s Time] [2022-11-23 02:36:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-23 02:36:43,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2022-11-23 02:36:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:36:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2022-11-23 02:36:43,185 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 37 [2022-11-23 02:36:43,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:36:43,186 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2022-11-23 02:36:43,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-23 02:36:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2022-11-23 02:36:43,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-23 02:36:43,187 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:36:43,187 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:36:43,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 02:36:43,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:36:43,388 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:36:43,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:36:43,388 INFO L85 PathProgramCache]: Analyzing trace with hash -94242400, now seen corresponding path program 1 times [2022-11-23 02:36:43,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:36:43,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791193006] [2022-11-23 02:36:43,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:43,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:36:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:43,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:36:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:43,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:36:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:43,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:36:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-23 02:36:43,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:36:43,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791193006] [2022-11-23 02:36:43,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791193006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:36:43,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:36:43,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:36:43,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470571039] [2022-11-23 02:36:43,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:36:43,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 02:36:43,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:36:43,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 02:36:43,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 02:36:43,552 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:36:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:36:43,765 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2022-11-23 02:36:43,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:36:43,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-11-23 02:36:43,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:36:43,767 INFO L225 Difference]: With dead ends: 106 [2022-11-23 02:36:43,767 INFO L226 Difference]: Without dead ends: 106 [2022-11-23 02:36:43,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:36:43,768 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:36:43,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 266 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 02:36:43,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-23 02:36:43,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2022-11-23 02:36:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.5) internal successors, (90), 83 states have internal predecessors, (90), 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-23 02:36:43,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-11-23 02:36:43,772 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 39 [2022-11-23 02:36:43,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:36:43,773 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-11-23 02:36:43,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:36:43,773 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-11-23 02:36:43,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-23 02:36:43,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:36:43,774 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:36:43,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 02:36:43,775 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:36:43,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:36:43,776 INFO L85 PathProgramCache]: Analyzing trace with hash -94242399, now seen corresponding path program 1 times [2022-11-23 02:36:43,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:36:43,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808266553] [2022-11-23 02:36:43,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:43,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:36:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:43,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:36:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:43,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:36:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:43,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:36:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 02:36:44,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:36:44,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808266553] [2022-11-23 02:36:44,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808266553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:36:44,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:36:44,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 02:36:44,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29462559] [2022-11-23 02:36:44,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:36:44,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 02:36:44,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:36:44,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 02:36:44,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:36:44,088 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:36:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:36:44,287 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-11-23 02:36:44,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:36:44,288 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-11-23 02:36:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:36:44,289 INFO L225 Difference]: With dead ends: 86 [2022-11-23 02:36:44,289 INFO L226 Difference]: Without dead ends: 86 [2022-11-23 02:36:44,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-23 02:36:44,290 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 74 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:36:44,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 284 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 02:36:44,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-23 02:36:44,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-23 02:36:44,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 81 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:36:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2022-11-23 02:36:44,293 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 39 [2022-11-23 02:36:44,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:36:44,293 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2022-11-23 02:36:44,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:36:44,294 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-11-23 02:36:44,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-23 02:36:44,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:36:44,295 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:36:44,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 02:36:44,295 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:36:44,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:36:44,296 INFO L85 PathProgramCache]: Analyzing trace with hash -372386587, now seen corresponding path program 1 times [2022-11-23 02:36:44,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:36:44,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673375891] [2022-11-23 02:36:44,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:44,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:36:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:44,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:36:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:44,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:36:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:44,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:36:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 02:36:45,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:36:45,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673375891] [2022-11-23 02:36:45,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673375891] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:36:45,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972273566] [2022-11-23 02:36:45,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:45,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:36:45,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:36:45,127 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:36:45,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 02:36:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:45,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-23 02:36:45,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:36:45,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-23 02:36:45,754 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1044 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1044))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-11-23 02:36:45,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:45,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 02:36:45,801 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-23 02:36:45,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 02:36:45,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-23 02:36:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 02:36:45,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:36:45,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972273566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:36:45,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 02:36:45,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2022-11-23 02:36:45,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125700164] [2022-11-23 02:36:45,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:36:45,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 02:36:45,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:36:45,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 02:36:45,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2022-11-23 02:36:45,928 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 02:36:46,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:36:46,612 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2022-11-23 02:36:46,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 02:36:46,613 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-11-23 02:36:46,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:36:46,614 INFO L225 Difference]: With dead ends: 128 [2022-11-23 02:36:46,614 INFO L226 Difference]: Without dead ends: 128 [2022-11-23 02:36:46,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=811, Unknown=2, NotChecked=58, Total=992 [2022-11-23 02:36:46,615 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 84 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 02:36:46,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 665 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 580 Invalid, 3 Unknown, 156 Unchecked, 0.5s Time] [2022-11-23 02:36:46,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-23 02:36:46,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 85. [2022-11-23 02:36:46,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 80 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:36:46,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2022-11-23 02:36:46,619 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 41 [2022-11-23 02:36:46,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:36:46,619 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2022-11-23 02:36:46,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 02:36:46,619 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2022-11-23 02:36:46,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-23 02:36:46,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:36:46,620 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:36:46,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 02:36:46,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 02:36:46,830 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:36:46,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:36:46,830 INFO L85 PathProgramCache]: Analyzing trace with hash -372386586, now seen corresponding path program 1 times [2022-11-23 02:36:46,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:36:46,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627839088] [2022-11-23 02:36:46,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:46,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:36:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:47,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:36:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:47,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:36:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:47,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:36:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:36:48,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:36:48,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627839088] [2022-11-23 02:36:48,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627839088] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:36:48,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996301830] [2022-11-23 02:36:48,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:48,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:36:48,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:36:48,092 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:36:48,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 02:36:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:48,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-23 02:36:48,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:36:48,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 02:36:48,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 02:36:49,135 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1203 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1203))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1199 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1199) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1202 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1202))))) is different from true [2022-11-23 02:36:49,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:49,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-23 02:36:49,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:49,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 02:36:49,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:49,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 02:36:49,251 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 02:36:49,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 02:36:49,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-23 02:36:49,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:36:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-23 02:36:49,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:36:50,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996301830] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:36:50,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:36:50,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2022-11-23 02:36:50,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733856266] [2022-11-23 02:36:50,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:36:50,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-23 02:36:50,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:36:50,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-23 02:36:50,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1222, Unknown=2, NotChecked=70, Total=1406 [2022-11-23 02:36:50,552 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:36:53,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:36:53,368 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2022-11-23 02:36:53,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 02:36:53,369 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-11-23 02:36:53,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:36:53,370 INFO L225 Difference]: With dead ends: 140 [2022-11-23 02:36:53,370 INFO L226 Difference]: Without dead ends: 140 [2022-11-23 02:36:53,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=331, Invalid=2638, Unknown=5, NotChecked=106, Total=3080 [2022-11-23 02:36:53,372 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 444 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-23 02:36:53,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1257 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1304 Invalid, 3 Unknown, 150 Unchecked, 1.4s Time] [2022-11-23 02:36:53,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-23 02:36:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 89. [2022-11-23 02:36:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:36:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2022-11-23 02:36:53,376 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 41 [2022-11-23 02:36:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:36:53,377 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2022-11-23 02:36:53,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:36:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-11-23 02:36:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-23 02:36:53,378 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:36:53,379 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:36:53,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 02:36:53,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:36:53,586 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:36:53,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:36:53,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112687, now seen corresponding path program 1 times [2022-11-23 02:36:53,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:36:53,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126663719] [2022-11-23 02:36:53,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:53,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:36:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:53,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:36:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:53,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:36:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:53,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:36:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-23 02:36:53,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:36:53,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126663719] [2022-11-23 02:36:53,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126663719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:36:53,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:36:53,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-23 02:36:53,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752156058] [2022-11-23 02:36:53,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:36:53,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 02:36:53,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:36:53,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 02:36:53,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-23 02:36:53,991 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 02:36:54,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:36:54,337 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2022-11-23 02:36:54,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 02:36:54,338 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2022-11-23 02:36:54,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:36:54,339 INFO L225 Difference]: With dead ends: 152 [2022-11-23 02:36:54,339 INFO L226 Difference]: Without dead ends: 152 [2022-11-23 02:36:54,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-23 02:36:54,340 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 274 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:36:54,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 398 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 02:36:54,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-23 02:36:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 92. [2022-11-23 02:36:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.391304347826087) internal successors, (96), 87 states have internal predecessors, (96), 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-23 02:36:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2022-11-23 02:36:54,343 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 44 [2022-11-23 02:36:54,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:36:54,343 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2022-11-23 02:36:54,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 02:36:54,343 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2022-11-23 02:36:54,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-23 02:36:54,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:36:54,344 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:36:54,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 02:36:54,345 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:36:54,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:36:54,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112688, now seen corresponding path program 1 times [2022-11-23 02:36:54,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:36:54,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362200518] [2022-11-23 02:36:54,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:54,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:36:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:54,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:36:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:54,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:36:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:54,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:36:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 02:36:54,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:36:54,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362200518] [2022-11-23 02:36:54,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362200518] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:36:54,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:36:54,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-23 02:36:54,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553784820] [2022-11-23 02:36:54,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:36:54,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 02:36:54,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:36:54,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 02:36:54,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-23 02:36:54,971 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 02:36:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:36:55,372 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2022-11-23 02:36:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 02:36:55,372 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2022-11-23 02:36:55,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:36:55,373 INFO L225 Difference]: With dead ends: 134 [2022-11-23 02:36:55,373 INFO L226 Difference]: Without dead ends: 134 [2022-11-23 02:36:55,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-23 02:36:55,374 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 279 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:36:55,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 411 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 02:36:55,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-23 02:36:55,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2022-11-23 02:36:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.380281690140845) internal successors, (98), 89 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:36:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-11-23 02:36:55,378 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 44 [2022-11-23 02:36:55,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:36:55,378 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-11-23 02:36:55,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 02:36:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-11-23 02:36:55,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-23 02:36:55,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:36:55,383 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:36:55,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 02:36:55,385 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:36:55,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:36:55,386 INFO L85 PathProgramCache]: Analyzing trace with hash 614432594, now seen corresponding path program 1 times [2022-11-23 02:36:55,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:36:55,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645124667] [2022-11-23 02:36:55,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:55,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:36:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:55,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:36:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:55,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:36:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:55,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:36:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:56,027 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:36:56,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:36:56,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645124667] [2022-11-23 02:36:56,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645124667] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:36:56,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679359630] [2022-11-23 02:36:56,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:56,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:36:56,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:36:56,030 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:36:56,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 02:36:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:56,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-23 02:36:56,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:36:56,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-23 02:36:56,789 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1614 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1614)))) is different from true [2022-11-23 02:36:56,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:56,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-23 02:36:56,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-23 02:36:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-23 02:36:56,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:36:57,014 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1618 (Array Int Int)) (|v_node_create_~temp~0#1.base_41| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_41| v_ArrVal_1618) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (<= 1 .cse0) (<= (+ .cse0 1) 0) (not (< |v_node_create_~temp~0#1.base_41| |c_#StackHeapBarrier|))))) is different from false [2022-11-23 02:36:57,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679359630] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:36:57,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:36:57,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-11-23 02:36:57,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832687552] [2022-11-23 02:36:57,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:36:57,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 02:36:57,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:36:57,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 02:36:57,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=571, Unknown=2, NotChecked=98, Total=756 [2022-11-23 02:36:57,018 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:36:57,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:36:57,727 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-11-23 02:36:57,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 02:36:57,727 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-11-23 02:36:57,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:36:57,728 INFO L225 Difference]: With dead ends: 90 [2022-11-23 02:36:57,729 INFO L226 Difference]: Without dead ends: 90 [2022-11-23 02:36:57,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=956, Unknown=2, NotChecked=130, Total=1260 [2022-11-23 02:36:57,730 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 392 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:36:57,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 591 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 418 Invalid, 0 Unknown, 90 Unchecked, 0.3s Time] [2022-11-23 02:36:57,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-23 02:36:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2022-11-23 02:36:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 81 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:36:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2022-11-23 02:36:57,734 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 46 [2022-11-23 02:36:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:36:57,735 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2022-11-23 02:36:57,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:36:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-11-23 02:36:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-23 02:36:57,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:36:57,736 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:36:57,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 02:36:57,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 02:36:57,943 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:36:57,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:36:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450120, now seen corresponding path program 1 times [2022-11-23 02:36:57,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:36:57,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315293350] [2022-11-23 02:36:57,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:57,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:36:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:58,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:36:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:58,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:36:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:59,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:36:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:36:59,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:36:59,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315293350] [2022-11-23 02:36:59,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315293350] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:36:59,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533720202] [2022-11-23 02:36:59,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:59,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:36:59,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:36:59,651 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:36:59,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 02:36:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:59,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-23 02:36:59,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:36:59,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:37:00,275 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 02:37:00,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 02:37:00,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:37:00,620 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:37:00,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-23 02:37:00,848 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:37:00,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2022-11-23 02:37:00,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 02:37:01,044 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1782 (Array Int Int)) (v_ArrVal_1781 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1782)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1781)))) is different from true [2022-11-23 02:37:01,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:01,110 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 02:37:01,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 43 [2022-11-23 02:37:01,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:01,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 02:37:01,154 INFO L321 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-11-23 02:37:01,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2022-11-23 02:37:01,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:37:01,466 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:37:01,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2022-11-23 02:37:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-23 02:37:01,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:37:01,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533720202] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:37:01,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:37:01,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2022-11-23 02:37:01,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265951664] [2022-11-23 02:37:01,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:37:01,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-23 02:37:01,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:37:01,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-23 02:37:01,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1918, Unknown=1, NotChecked=88, Total=2162 [2022-11-23 02:37:01,794 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:37:04,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:37:04,613 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2022-11-23 02:37:04,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 02:37:04,614 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-11-23 02:37:04,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:37:04,615 INFO L225 Difference]: With dead ends: 183 [2022-11-23 02:37:04,615 INFO L226 Difference]: Without dead ends: 183 [2022-11-23 02:37:04,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=383, Invalid=3402, Unknown=1, NotChecked=120, Total=3906 [2022-11-23 02:37:04,618 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 572 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-23 02:37:04,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1079 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1613 Invalid, 0 Unknown, 184 Unchecked, 1.5s Time] [2022-11-23 02:37:04,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-23 02:37:04,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 106. [2022-11-23 02:37:04,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.345679012345679) internal successors, (109), 99 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 02:37:04,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2022-11-23 02:37:04,623 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 46 [2022-11-23 02:37:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:37:04,623 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2022-11-23 02:37:04,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:37:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-11-23 02:37:04,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-23 02:37:04,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:37:04,625 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:37:04,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 02:37:04,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 02:37:04,832 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:37:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:37:04,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450121, now seen corresponding path program 1 times [2022-11-23 02:37:04,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:37:04,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791764195] [2022-11-23 02:37:04,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:37:04,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:37:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:06,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:37:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:06,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:37:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:06,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:37:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:07,479 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:37:07,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:37:07,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791764195] [2022-11-23 02:37:07,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791764195] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:37:07,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853903759] [2022-11-23 02:37:07,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:37:07,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:37:07,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:37:07,482 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:37:07,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 02:37:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:07,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-23 02:37:07,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:37:07,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:37:08,326 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 02:37:08,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 02:37:08,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:37:08,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:37:08,815 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:37:08,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-11-23 02:37:08,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 02:37:09,215 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:37:09,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 34 [2022-11-23 02:37:09,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:37:09,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:37:09,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:37:09,499 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1959)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1960) |c_#memory_$Pointer$.offset|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-23 02:37:09,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:09,572 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 02:37:09,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2022-11-23 02:37:09,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:09,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:09,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:09,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-23 02:37:09,618 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-23 02:37:09,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-23 02:37:09,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-23 02:37:10,064 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-23 02:37:10,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 41 [2022-11-23 02:37:10,080 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 02:37:10,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-23 02:37:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-23 02:37:10,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:37:10,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853903759] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:37:10,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:37:10,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25] total 51 [2022-11-23 02:37:10,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278992035] [2022-11-23 02:37:10,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:37:10,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-23 02:37:10,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:37:10,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-23 02:37:10,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3016, Unknown=1, NotChecked=110, Total=3306 [2022-11-23 02:37:10,985 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 52 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 45 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:37:18,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:37:18,384 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2022-11-23 02:37:18,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-23 02:37:18,384 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 45 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-11-23 02:37:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:37:18,385 INFO L225 Difference]: With dead ends: 215 [2022-11-23 02:37:18,386 INFO L226 Difference]: Without dead ends: 215 [2022-11-23 02:37:18,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=534, Invalid=5475, Unknown=1, NotChecked=152, Total=6162 [2022-11-23 02:37:18,388 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 618 mSDsluCounter, 2279 mSDsCounter, 0 mSdLazyCounter, 3163 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 3359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-23 02:37:18,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 2355 Invalid, 3359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3163 Invalid, 0 Unknown, 149 Unchecked, 2.9s Time] [2022-11-23 02:37:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-23 02:37:18,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 105. [2022-11-23 02:37:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.3375) internal successors, (107), 98 states have internal predecessors, (107), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 02:37:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-11-23 02:37:18,393 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 46 [2022-11-23 02:37:18,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:37:18,393 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-11-23 02:37:18,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 45 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:37:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-11-23 02:37:18,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-23 02:37:18,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:37:18,394 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:37:18,410 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-23 02:37:18,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-23 02:37:18,610 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:37:18,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:37:18,611 INFO L85 PathProgramCache]: Analyzing trace with hash 865523061, now seen corresponding path program 1 times [2022-11-23 02:37:18,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:37:18,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176271875] [2022-11-23 02:37:18,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:37:18,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:37:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:19,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:37:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:19,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:37:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:19,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:37:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:20,021 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:37:20,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:37:20,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176271875] [2022-11-23 02:37:20,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176271875] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:37:20,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755877080] [2022-11-23 02:37:20,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:37:20,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:37:20,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:37:20,022 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:37:20,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 02:37:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:20,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-23 02:37:20,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:37:20,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:37:20,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:37:20,360 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-23 02:37:20,391 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:37:20,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:37:20,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:37:20,544 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:37:20,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 02:37:20,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-23 02:37:21,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:21,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-23 02:37:21,315 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-23 02:37:21,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-23 02:37:21,731 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:37:21,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-23 02:37:21,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:21,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-23 02:37:21,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-23 02:37:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-23 02:37:21,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:37:26,086 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2156 (Array Int Int)) (v_ArrVal_2155 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_2155) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-23 02:37:32,307 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2156 (Array Int Int)) (v_ArrVal_2155 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_2155) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-23 02:37:32,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755877080] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:37:32,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:37:32,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2022-11-23 02:37:32,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95336903] [2022-11-23 02:37:32,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:37:32,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-23 02:37:32,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:37:32,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-23 02:37:32,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2235, Unknown=65, NotChecked=294, Total=2756 [2022-11-23 02:37:32,719 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 40 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:37:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:37:36,955 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2022-11-23 02:37:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-23 02:37:36,956 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 40 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-11-23 02:37:36,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:37:36,957 INFO L225 Difference]: With dead ends: 216 [2022-11-23 02:37:36,958 INFO L226 Difference]: Without dead ends: 216 [2022-11-23 02:37:36,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=631, Invalid=4716, Unknown=67, NotChecked=438, Total=5852 [2022-11-23 02:37:36,960 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 1847 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 55 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1847 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:37:36,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1847 Valid, 854 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1404 Invalid, 2 Unknown, 109 Unchecked, 1.3s Time] [2022-11-23 02:37:36,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-23 02:37:36,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 106. [2022-11-23 02:37:36,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.345679012345679) internal successors, (109), 99 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 02:37:36,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2022-11-23 02:37:36,966 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 51 [2022-11-23 02:37:36,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:37:36,967 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2022-11-23 02:37:36,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 40 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:37:36,968 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-11-23 02:37:36,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-23 02:37:36,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:37:36,968 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:37:36,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 02:37:37,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:37:37,179 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:37:37,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:37:37,180 INFO L85 PathProgramCache]: Analyzing trace with hash 865523062, now seen corresponding path program 1 times [2022-11-23 02:37:37,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:37:37,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119873140] [2022-11-23 02:37:37,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:37:37,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:37:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:38,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:37:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:38,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:37:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:38,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:37:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:37:39,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:37:39,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119873140] [2022-11-23 02:37:39,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119873140] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:37:39,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171642018] [2022-11-23 02:37:39,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:37:39,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:37:39,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:37:39,137 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:37:39,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 02:37:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:39,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-23 02:37:39,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:37:39,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:37:39,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:37:39,507 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-23 02:37:39,535 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:37:39,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:37:39,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:37:39,800 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:37:39,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 02:37:40,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-11-23 02:37:40,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 02:37:40,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:40,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2022-11-23 02:37:40,768 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 02:37:40,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 02:37:40,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-11-23 02:37:40,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:40,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2022-11-23 02:37:41,441 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:37:41,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2022-11-23 02:37:41,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-11-23 02:37:41,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:41,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-11-23 02:37:41,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:41,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-23 02:37:41,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-11-23 02:37:41,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-23 02:37:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-23 02:37:41,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:37:43,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171642018] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:37:43,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:37:43,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 45 [2022-11-23 02:37:43,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346129058] [2022-11-23 02:37:43,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:37:43,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-23 02:37:43,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:37:43,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-23 02:37:43,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2608, Unknown=62, NotChecked=104, Total=2970 [2022-11-23 02:37:43,832 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:37:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:37:48,256 INFO L93 Difference]: Finished difference Result 197 states and 217 transitions. [2022-11-23 02:37:48,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 02:37:48,257 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-11-23 02:37:48,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:37:48,258 INFO L225 Difference]: With dead ends: 197 [2022-11-23 02:37:48,258 INFO L226 Difference]: Without dead ends: 197 [2022-11-23 02:37:48,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=502, Invalid=4270, Unknown=62, NotChecked=136, Total=4970 [2022-11-23 02:37:48,260 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1476 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 02:37:48,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 844 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1557 Invalid, 0 Unknown, 153 Unchecked, 1.6s Time] [2022-11-23 02:37:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-23 02:37:48,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 119. [2022-11-23 02:37:48,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 112 states have internal predecessors, (124), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 02:37:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2022-11-23 02:37:48,266 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 51 [2022-11-23 02:37:48,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:37:48,266 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2022-11-23 02:37:48,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:37:48,267 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2022-11-23 02:37:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-23 02:37:48,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:37:48,268 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:37:48,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 02:37:48,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:37:48,475 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:37:48,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:37:48,475 INFO L85 PathProgramCache]: Analyzing trace with hash -396596539, now seen corresponding path program 2 times [2022-11-23 02:37:48,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:37:48,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121121570] [2022-11-23 02:37:48,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:37:48,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:37:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:49,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:37:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:49,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:37:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:50,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:37:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:50,619 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:37:50,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:37:50,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121121570] [2022-11-23 02:37:50,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121121570] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:37:50,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038239045] [2022-11-23 02:37:50,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:37:50,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:37:50,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:37:50,621 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:37:50,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 02:37:50,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:37:50,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:37:50,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 145 conjunts are in the unsatisfiable core [2022-11-23 02:37:50,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:37:50,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:37:51,327 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:37:51,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 02:37:51,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:37:51,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:37:51,699 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 02:37:51,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-11-23 02:37:51,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-11-23 02:37:52,664 INFO L321 Elim1Store]: treesize reduction 68, result has 27.7 percent of original size [2022-11-23 02:37:52,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 77 [2022-11-23 02:37:52,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:52,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:52,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:52,689 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-23 02:37:52,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 49 [2022-11-23 02:37:52,727 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-23 02:37:52,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-23 02:37:54,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:54,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:54,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:54,858 INFO L321 Elim1Store]: treesize reduction 78, result has 8.2 percent of original size [2022-11-23 02:37:54,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 42 [2022-11-23 02:37:55,051 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:37:55,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:37:59,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038239045] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:37:59,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:37:59,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 56 [2022-11-23 02:37:59,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736599090] [2022-11-23 02:37:59,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:37:59,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-23 02:37:59,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:37:59,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-23 02:37:59,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=3918, Unknown=4, NotChecked=0, Total=4160 [2022-11-23 02:37:59,166 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand has 56 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 49 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:38:04,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:38:04,923 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2022-11-23 02:38:04,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-23 02:38:04,924 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 49 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2022-11-23 02:38:04,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:38:04,925 INFO L225 Difference]: With dead ends: 121 [2022-11-23 02:38:04,925 INFO L226 Difference]: Without dead ends: 121 [2022-11-23 02:38:04,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1929 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=532, Invalid=7120, Unknown=4, NotChecked=0, Total=7656 [2022-11-23 02:38:04,926 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 250 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-23 02:38:04,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1685 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1892 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-23 02:38:04,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-23 02:38:04,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-11-23 02:38:04,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 112 states have internal predecessors, (123), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 02:38:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2022-11-23 02:38:04,932 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 51 [2022-11-23 02:38:04,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:38:04,932 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2022-11-23 02:38:04,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 49 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:38:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2022-11-23 02:38:04,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-23 02:38:04,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:38:04,934 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:38:04,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 02:38:05,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-23 02:38:05,142 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:38:05,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:38:05,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1455991656, now seen corresponding path program 1 times [2022-11-23 02:38:05,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:38:05,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967309073] [2022-11-23 02:38:05,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:38:05,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:38:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:06,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:38:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:06,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:38:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:06,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:38:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:38:06,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:38:06,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967309073] [2022-11-23 02:38:06,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967309073] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:38:06,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901124286] [2022-11-23 02:38:06,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:38:06,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:38:06,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:38:06,897 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:38:06,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 02:38:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:07,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 99 conjunts are in the unsatisfiable core [2022-11-23 02:38:07,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:38:07,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:38:07,563 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:38:07,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 02:38:07,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:38:07,974 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:38:07,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-23 02:38:08,268 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:38:08,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2022-11-23 02:38:08,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:38:08,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 02:38:08,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:08,605 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-23 02:38:08,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2022-11-23 02:38:08,622 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 02:38:08,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 02:38:08,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:08,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-23 02:38:09,170 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-11-23 02:38:09,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 29 [2022-11-23 02:38:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:38:09,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:38:09,629 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2742 (Array Int Int)) (v_ArrVal_2741 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| Int)) (or (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| v_ArrVal_2742))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| v_ArrVal_2741) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| |c_#StackHeapBarrier|)))) is different from false [2022-11-23 02:38:09,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901124286] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:38:09,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:38:09,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 47 [2022-11-23 02:38:09,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257606244] [2022-11-23 02:38:09,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:38:09,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-23 02:38:09,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:38:09,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-23 02:38:09,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2482, Unknown=1, NotChecked=100, Total=2756 [2022-11-23 02:38:09,633 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:38:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:38:12,809 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2022-11-23 02:38:12,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 02:38:12,809 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2022-11-23 02:38:12,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:38:12,810 INFO L225 Difference]: With dead ends: 120 [2022-11-23 02:38:12,811 INFO L226 Difference]: Without dead ends: 120 [2022-11-23 02:38:12,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=336, Invalid=4089, Unknown=1, NotChecked=130, Total=4556 [2022-11-23 02:38:12,813 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 153 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-23 02:38:12,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1593 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-23 02:38:12,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-23 02:38:12,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-11-23 02:38:12,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.297872340425532) internal successors, (122), 112 states have internal predecessors, (122), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 02:38:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2022-11-23 02:38:12,818 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 53 [2022-11-23 02:38:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:38:12,819 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2022-11-23 02:38:12,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:38:12,819 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2022-11-23 02:38:12,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-23 02:38:12,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:38:12,820 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:38:12,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 02:38:13,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:38:13,027 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:38:13,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:38:13,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1874385561, now seen corresponding path program 1 times [2022-11-23 02:38:13,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:38:13,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533350035] [2022-11-23 02:38:13,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:38:13,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:38:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:14,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:38:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:14,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:38:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:14,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:38:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:38:15,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:38:15,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533350035] [2022-11-23 02:38:15,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533350035] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:38:15,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519108057] [2022-11-23 02:38:15,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:38:15,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:38:15,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:38:15,480 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:38:15,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 02:38:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:15,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-23 02:38:15,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:38:15,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:38:15,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:38:15,946 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2922 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2922))))) is different from true [2022-11-23 02:38:15,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:15,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:38:16,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:38:16,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:16,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:38:16,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-23 02:38:16,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:38:16,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:16,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:38:16,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 02:38:17,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:17,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 02:38:17,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:17,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-23 02:38:17,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:17,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:17,625 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-23 02:38:17,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2022-11-23 02:38:17,656 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 02:38:17,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 02:38:18,985 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2022-11-23 02:38:18,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 57 [2022-11-23 02:38:19,028 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-23 02:38:19,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2022-11-23 02:38:19,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:19,720 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 02:38:19,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 101 [2022-11-23 02:38:19,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:19,756 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 02:38:19,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 110 [2022-11-23 02:38:19,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:38:19,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:38:19,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:38:20,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:38:20,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-23 02:38:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-23 02:38:20,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:38:21,005 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2933 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2934 (Array Int Int)) (v_ArrVal_2933 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2934) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-23 02:38:21,029 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))) (and (forall ((v_ArrVal_2934 (Array Int Int)) (v_ArrVal_2933 (Array Int Int))) (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2934) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2933 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-23 02:38:32,532 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2945 Int)) (or (not (<= 8 v_ArrVal_2945)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| Int)) (or (forall ((v_ArrVal_2944 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2944))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_subst_2 Int)) (or (forall ((v_ArrVal_2933 (Array Int Int))) (<= 0 (+ (select (select (store (store .cse1 v_subst_2 (store (select .cse1 v_subst_2) .cse0 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (<= (+ .cse0 4) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2945) v_subst_2))))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|) 0)))))) (forall ((v_ArrVal_2945 Int)) (or (not (<= 8 v_ArrVal_2945)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2944 (Array Int Int)) (v_ArrVal_2943 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2944))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (not (<= 0 .cse2)) (forall ((v_subst_1 Int)) (let ((.cse4 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2945))) (or (forall ((v_ArrVal_2934 (Array Int Int)) (v_ArrVal_2933 (Array Int Int))) (<= (+ 8 (select (select (store (store .cse3 v_subst_1 (store (select .cse3 v_subst_1) .cse2 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select .cse4 (select (select (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2943))) (store .cse5 v_subst_1 (store (select .cse5 v_subst_1) .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2934) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (<= (+ .cse2 4) (select .cse4 v_subst_1)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|) 0))))))) is different from false [2022-11-23 02:38:32,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519108057] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:38:32,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:38:32,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 51 [2022-11-23 02:38:32,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943243547] [2022-11-23 02:38:32,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:38:32,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-23 02:38:32,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:38:32,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-23 02:38:32,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=3173, Unknown=9, NotChecked=468, Total=3906 [2022-11-23 02:38:32,543 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 52 states, 49 states have (on average 2.020408163265306) internal successors, (99), 45 states have internal predecessors, (99), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:38:40,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:38:40,933 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2022-11-23 02:38:40,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-23 02:38:40,934 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 2.020408163265306) internal successors, (99), 45 states have internal predecessors, (99), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2022-11-23 02:38:40,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:38:40,935 INFO L225 Difference]: With dead ends: 181 [2022-11-23 02:38:40,935 INFO L226 Difference]: Without dead ends: 181 [2022-11-23 02:38:40,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1816 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=701, Invalid=6278, Unknown=9, NotChecked=668, Total=7656 [2022-11-23 02:38:40,936 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 695 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 2658 mSolverCounterSat, 38 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 2847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2658 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-23 02:38:40,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 1841 Invalid, 2847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2658 Invalid, 2 Unknown, 149 Unchecked, 3.5s Time] [2022-11-23 02:38:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-23 02:38:40,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 105. [2022-11-23 02:38:40,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 98 states have internal predecessors, (106), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 02:38:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2022-11-23 02:38:40,943 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 56 [2022-11-23 02:38:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:38:40,943 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2022-11-23 02:38:40,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 2.020408163265306) internal successors, (99), 45 states have internal predecessors, (99), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:38:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2022-11-23 02:38:40,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 02:38:40,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:38:40,944 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:38:40,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-23 02:38:41,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:38:41,145 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:38:41,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:38:41,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1773529958, now seen corresponding path program 3 times [2022-11-23 02:38:41,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:38:41,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225328932] [2022-11-23 02:38:41,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:38:41,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:38:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:41,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:38:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:41,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:38:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:41,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-23 02:38:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:41,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-23 02:38:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:41,273 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-23 02:38:41,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:38:41,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225328932] [2022-11-23 02:38:41,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225328932] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:38:41,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205770387] [2022-11-23 02:38:41,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 02:38:41,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:38:41,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:38:41,275 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:38:41,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 02:38:41,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 02:38:41,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:38:41,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:38:41,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:38:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-23 02:38:41,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:38:41,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205770387] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:38:41,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 02:38:41,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-23 02:38:41,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37286600] [2022-11-23 02:38:41,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:38:41,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:38:41,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:38:41,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:38:41,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:38:41,815 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 02:38:41,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:38:41,834 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2022-11-23 02:38:41,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:38:41,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-11-23 02:38:41,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:38:41,836 INFO L225 Difference]: With dead ends: 83 [2022-11-23 02:38:41,836 INFO L226 Difference]: Without dead ends: 83 [2022-11-23 02:38:41,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:38:41,839 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 128 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:38:41,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 93 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 02:38:41,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-23 02:38:41,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-23 02:38:41,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.296875) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:38:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-11-23 02:38:41,844 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 58 [2022-11-23 02:38:41,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:38:41,844 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-11-23 02:38:41,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 02:38:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-11-23 02:38:41,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 02:38:41,845 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:38:41,845 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:38:41,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-23 02:38:42,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-23 02:38:42,053 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:38:42,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:38:42,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1693228283, now seen corresponding path program 1 times [2022-11-23 02:38:42,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:38:42,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645087396] [2022-11-23 02:38:42,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:38:42,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:38:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:44,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:38:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:44,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:38:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:45,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:38:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:38:46,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:38:46,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645087396] [2022-11-23 02:38:46,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645087396] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:38:46,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872752649] [2022-11-23 02:38:46,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:38:46,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:38:46,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:38:46,232 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:38:46,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-23 02:38:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:46,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 166 conjunts are in the unsatisfiable core [2022-11-23 02:38:46,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:38:46,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:38:46,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:38:46,954 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 02:38:46,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 02:38:47,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:38:47,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:38:47,530 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-23 02:38:47,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 02:38:47,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:38:47,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:47,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-23 02:38:47,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:38:48,392 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:38:48,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-11-23 02:38:48,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-23 02:38:48,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 02:38:48,973 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:38:48,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 35 [2022-11-23 02:38:48,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 02:38:48,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:38:49,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:49,665 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-23 02:38:49,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 55 [2022-11-23 02:38:49,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:49,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:49,690 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2022-11-23 02:38:49,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2022-11-23 02:38:49,713 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 02:38:49,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 02:38:49,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2022-11-23 02:38:51,676 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-23 02:38:51,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 92 [2022-11-23 02:38:51,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:51,713 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-23 02:38:51,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 59 [2022-11-23 02:38:51,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:51,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-23 02:38:51,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:51,948 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 02:38:51,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 59 [2022-11-23 02:38:51,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 02:38:51,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:51,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:51,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-23 02:38:52,150 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:38:52,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 33 [2022-11-23 02:38:52,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 02:38:52,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:38:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:38:52,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:38:52,771 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3354 (Array Int Int)) (v_ArrVal_3355 (Array Int Int)) (v_ArrVal_3356 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3354) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3355) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3356) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-23 02:38:52,788 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3351 (Array Int Int)) (v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3353 (Array Int Int)) (v_ArrVal_3354 (Array Int Int)) (v_ArrVal_3355 (Array Int Int)) (v_ArrVal_3356 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3352) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3354) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3351) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3355) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3353) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3356) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-23 02:38:54,244 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3351 (Array Int Int)) (v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3353 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| Int) (v_ArrVal_3354 (Array Int Int)) (v_ArrVal_3366 (Array Int Int)) (v_ArrVal_3355 (Array Int Int)) (v_ArrVal_3367 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3368 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3367)) (.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3368))) (let ((.cse3 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select .cse1 .cse3) .cse4))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3366) .cse0 v_ArrVal_3352) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3354) (select (select (store (store .cse1 .cse0 v_ArrVal_3351) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3355) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse2 .cse0 v_ArrVal_3353) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3356) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not (<= 0 (select (select .cse2 .cse3) .cse4))))))) is different from false [2022-11-23 02:38:54,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872752649] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:38:54,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:38:54,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 65 [2022-11-23 02:38:54,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938448327] [2022-11-23 02:38:54,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:38:54,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-23 02:38:54,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:38:54,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-23 02:38:54,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=5121, Unknown=3, NotChecked=438, Total=5852 [2022-11-23 02:38:54,250 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 65 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 56 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:39:00,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:39:00,961 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-11-23 02:39:00,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-23 02:39:00,962 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 56 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2022-11-23 02:39:00,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:39:00,963 INFO L225 Difference]: With dead ends: 102 [2022-11-23 02:39:00,963 INFO L226 Difference]: Without dead ends: 102 [2022-11-23 02:39:00,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=717, Invalid=8412, Unknown=3, NotChecked=570, Total=9702 [2022-11-23 02:39:00,965 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 615 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:39:00,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1026 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-23 02:39:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-23 02:39:00,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2022-11-23 02:39:00,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.28125) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:39:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2022-11-23 02:39:00,970 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 58 [2022-11-23 02:39:00,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:39:00,970 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2022-11-23 02:39:00,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 56 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:39:00,971 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-11-23 02:39:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-23 02:39:00,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:39:00,972 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:39:00,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-23 02:39:01,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-23 02:39:01,180 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:39:01,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:39:01,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1290478905, now seen corresponding path program 1 times [2022-11-23 02:39:01,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:39:01,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947700148] [2022-11-23 02:39:01,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:39:01,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:39:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:39:03,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:39:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:39:03,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:39:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:39:03,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:39:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:39:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:39:03,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:39:03,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947700148] [2022-11-23 02:39:03,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947700148] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:39:03,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007913434] [2022-11-23 02:39:03,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:39:03,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:39:03,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:39:03,915 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:39:03,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-23 02:39:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:39:04,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-23 02:39:04,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:39:04,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:39:04,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:39:04,574 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 02:39:04,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 02:39:04,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:39:04,920 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-23 02:39:04,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 02:39:05,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:39:05,376 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:39:05,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-23 02:39:05,768 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:39:05,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 21 [2022-11-23 02:39:05,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:39:05,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 02:39:06,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:39:06,264 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-23 02:39:06,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 37 [2022-11-23 02:39:06,277 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 02:39:06,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 02:39:06,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:39:06,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-23 02:39:07,433 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-23 02:39:07,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 73 [2022-11-23 02:39:07,455 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:39:07,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2022-11-23 02:39:07,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:39:07,651 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 02:39:07,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 52 [2022-11-23 02:39:07,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:39:07,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-11-23 02:39:07,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-11-23 02:39:08,106 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:39:08,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2022-11-23 02:39:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:39:08,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:39:08,421 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-23 02:39:08,442 INFO L321 Elim1Store]: treesize reduction 5, result has 86.8 percent of original size [2022-11-23 02:39:08,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-11-23 02:39:08,448 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) is different from false [2022-11-23 02:39:08,456 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-23 02:39:08,767 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))) is different from false [2022-11-23 02:39:08,778 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= .cse0 (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-23 02:39:08,801 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))) is different from false [2022-11-23 02:39:08,909 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| Int) (v_ArrVal_3566 (Array Int Int)) (v_ArrVal_3567 (Array Int Int)) (v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_3567)) (.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_3566))) (let ((.cse2 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= (select (let ((.cse0 (store (store .cse1 .cse2 v_ArrVal_3557) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse3 .cse2 v_ArrVal_3556) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| |c_#StackHeapBarrier|)))) is different from false [2022-11-23 02:39:08,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007913434] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:39:08,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:39:08,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 63 [2022-11-23 02:39:08,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651263787] [2022-11-23 02:39:08,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:39:08,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-23 02:39:08,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:39:08,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-23 02:39:08,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4009, Unknown=104, NotChecked=938, Total=5256 [2022-11-23 02:39:08,914 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 64 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 55 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:39:14,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:39:14,924 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2022-11-23 02:39:14,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-23 02:39:14,925 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 55 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2022-11-23 02:39:14,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:39:14,925 INFO L225 Difference]: With dead ends: 134 [2022-11-23 02:39:14,925 INFO L226 Difference]: Without dead ends: 134 [2022-11-23 02:39:14,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1663 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=614, Invalid=7130, Unknown=116, NotChecked=1260, Total=9120 [2022-11-23 02:39:14,927 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 909 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 2383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:39:14,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 1124 Invalid, 2383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2343 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-23 02:39:14,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-23 02:39:14,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 87. [2022-11-23 02:39:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 82 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:39:14,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2022-11-23 02:39:14,931 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 62 [2022-11-23 02:39:14,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:39:14,932 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2022-11-23 02:39:14,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 55 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:39:14,932 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2022-11-23 02:39:14,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-23 02:39:14,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:39:14,933 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:39:14,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-23 02:39:15,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-23 02:39:15,141 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:39:15,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:39:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1290478904, now seen corresponding path program 1 times [2022-11-23 02:39:15,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:39:15,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957182983] [2022-11-23 02:39:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:39:15,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:39:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:39:18,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:39:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:39:19,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:39:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:39:19,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:39:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:39:20,250 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:39:20,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:39:20,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957182983] [2022-11-23 02:39:20,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957182983] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:39:20,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429614048] [2022-11-23 02:39:20,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:39:20,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:39:20,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:39:20,252 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:39:20,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-23 02:39:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:39:20,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 151 conjunts are in the unsatisfiable core [2022-11-23 02:39:20,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:39:20,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:39:20,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:39:21,114 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 02:39:21,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 02:39:21,862 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-23 02:39:21,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-23 02:39:21,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:39:22,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:39:22,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:39:22,638 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:39:22,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 50 [2022-11-23 02:39:22,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 02:39:24,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:39:24,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-23 02:39:24,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:39:24,065 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 02:39:24,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 65 [2022-11-23 02:39:24,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:39:24,110 INFO L321 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-11-23 02:39:24,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 42 [2022-11-23 02:39:24,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:39:24,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:39:24,171 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-23 02:39:24,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-11-23 02:39:25,993 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-23 02:39:25,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 84 [2022-11-23 02:39:26,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:39:26,035 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-23 02:39:26,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2022-11-23 02:39:26,311 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 02:39:26,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 63 [2022-11-23 02:39:26,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:39:26,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-23 02:39:26,966 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-23 02:39:26,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 45 [2022-11-23 02:39:27,424 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 02:39:27,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-23 02:39:27,557 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:39:27,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:39:28,435 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3765 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3765))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3764 (Array Int Int))) (<= 0 (+ (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3764) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1) 4))) (not (<= 0 .cse1)))))) (forall ((v_ArrVal_3765 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3765))) (let ((.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3764 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3764))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse2 .cse3) .cse4) 8) (select |c_#length| (select (select .cse5 .cse3) .cse4)))))) (not (<= 0 .cse4))))))) is different from false [2022-11-23 02:39:33,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429614048] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:39:33,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:39:33,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 35] total 76 [2022-11-23 02:39:33,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993742943] [2022-11-23 02:39:33,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:39:33,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-23 02:39:33,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:39:33,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-23 02:39:33,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=7443, Unknown=119, NotChecked=174, Total=8010 [2022-11-23 02:39:33,107 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 77 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 67 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:39:47,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:39:47,413 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2022-11-23 02:39:47,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-23 02:39:47,414 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 67 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2022-11-23 02:39:47,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:39:47,415 INFO L225 Difference]: With dead ends: 156 [2022-11-23 02:39:47,415 INFO L226 Difference]: Without dead ends: 156 [2022-11-23 02:39:47,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1958 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=924, Invalid=12533, Unknown=119, NotChecked=230, Total=13806 [2022-11-23 02:39:47,417 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2071 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 3106 mSolverCounterSat, 68 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2071 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3106 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-23 02:39:47,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2071 Valid, 1321 Invalid, 3175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3106 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-11-23 02:39:47,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-23 02:39:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 89. [2022-11-23 02:39:47,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 84 states have internal predecessors, (90), 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-23 02:39:47,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2022-11-23 02:39:47,421 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 62 [2022-11-23 02:39:47,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:39:47,421 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2022-11-23 02:39:47,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 67 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:39:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2022-11-23 02:39:47,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-23 02:39:47,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:39:47,422 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:39:47,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-23 02:39:47,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-23 02:39:47,629 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:39:47,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:39:47,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1350141375, now seen corresponding path program 1 times [2022-11-23 02:39:47,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:39:47,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403237722] [2022-11-23 02:39:47,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:39:47,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:39:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:39:49,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:39:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:39:49,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:39:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:39:50,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:39:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:39:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:39:50,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:39:50,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403237722] [2022-11-23 02:39:50,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403237722] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:39:50,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089409731] [2022-11-23 02:39:50,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:39:50,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:39:50,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:39:50,714 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:39:50,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-23 02:39:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:39:51,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 124 conjunts are in the unsatisfiable core [2022-11-23 02:39:51,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:39:51,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:39:51,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:39:51,478 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 02:39:51,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 02:39:51,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:39:51,898 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-23 02:39:51,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 02:39:52,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:39:52,408 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:39:52,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-23 02:39:52,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:39:52,866 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:39:52,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 21 [2022-11-23 02:39:52,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:39:53,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:39:53,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2022-11-23 02:39:53,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:39:53,516 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 02:39:53,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 50 [2022-11-23 02:39:53,531 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 02:39:53,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 02:39:54,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:39:54,728 INFO L321 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-11-23 02:39:54,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 50 [2022-11-23 02:39:54,762 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:39:54,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 83 [2022-11-23 02:39:55,022 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-23 02:39:55,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 89 [2022-11-23 02:39:55,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:39:55,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 86 [2022-11-23 02:39:55,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-11-23 02:39:55,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 90 [2022-11-23 02:39:56,352 INFO L321 Elim1Store]: treesize reduction 20, result has 71.0 percent of original size [2022-11-23 02:39:56,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 105 [2022-11-23 02:39:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:39:56,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:39:56,989 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-23 02:39:57,001 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_3964 (Array Int Int)) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-23 02:39:57,026 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_3964 (Array Int Int)) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-23 02:39:57,036 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-23 02:39:57,063 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-23 02:39:57,097 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-23 02:39:57,121 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-23 02:39:57,216 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| Int) (v_ArrVal_3975 (Array Int Int)) (v_ArrVal_3964 (Array Int Int)) (v_ArrVal_3976 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| |c_#StackHeapBarrier|)) (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3975)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3976))) (let ((.cse3 (select (select .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store .cse2 .cse3 v_ArrVal_3964) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2022-11-23 02:39:57,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089409731] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:39:57,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:39:57,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34] total 66 [2022-11-23 02:39:57,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269510259] [2022-11-23 02:39:57,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:39:57,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-23 02:39:57,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:39:57,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-23 02:39:57,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=4095, Unknown=9, NotChecked=1080, Total=5402 [2022-11-23 02:39:57,221 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 66 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 57 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:40:01,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:40:10,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:40:10,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:40:10,252 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2022-11-23 02:40:10,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-23 02:40:10,278 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 57 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2022-11-23 02:40:10,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:40:10,279 INFO L225 Difference]: With dead ends: 164 [2022-11-23 02:40:10,279 INFO L226 Difference]: Without dead ends: 164 [2022-11-23 02:40:10,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 99 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1651 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=684, Invalid=7895, Unknown=9, NotChecked=1512, Total=10100 [2022-11-23 02:40:10,281 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1188 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 2146 mSolverCounterSat, 38 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2146 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-23 02:40:10,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 1334 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2146 Invalid, 9 Unknown, 0 Unchecked, 6.5s Time] [2022-11-23 02:40:10,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-23 02:40:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 89. [2022-11-23 02:40:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 84 states have internal predecessors, (89), 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-23 02:40:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2022-11-23 02:40:10,285 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 63 [2022-11-23 02:40:10,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:40:10,286 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2022-11-23 02:40:10,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 57 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:40:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2022-11-23 02:40:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-23 02:40:10,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:40:10,287 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:40:10,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-23 02:40:10,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-23 02:40:10,487 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:40:10,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:40:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1095322986, now seen corresponding path program 1 times [2022-11-23 02:40:10,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:40:10,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123093313] [2022-11-23 02:40:10,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:40:10,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:40:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:40:14,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:40:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:40:14,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:40:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:40:15,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:40:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:40:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:40:16,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:40:16,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123093313] [2022-11-23 02:40:16,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123093313] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:40:16,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167564864] [2022-11-23 02:40:16,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:40:16,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:40:16,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:40:16,412 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:40:16,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-23 02:40:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:40:16,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 203 conjunts are in the unsatisfiable core [2022-11-23 02:40:16,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:40:16,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:40:16,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:40:16,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:40:16,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:40:17,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:40:17,568 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 02:40:17,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 02:40:17,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:40:17,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:40:17,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 02:40:17,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:40:18,683 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 02:40:18,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-23 02:40:18,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:40:18,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:18,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:40:18,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:18,755 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:40:18,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-11-23 02:40:19,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 02:40:19,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:40:19,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:40:19,678 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:40:19,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 67 [2022-11-23 02:40:19,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 02:40:19,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-23 02:40:20,424 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:40:20,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 39 [2022-11-23 02:40:20,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:20,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:40:20,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 02:40:20,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:40:20,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:40:21,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:21,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:40:21,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:21,389 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 02:40:21,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 74 [2022-11-23 02:40:21,423 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-23 02:40:21,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2022-11-23 02:40:21,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:40:21,464 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-23 02:40:21,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-23 02:40:21,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:21,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:21,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-23 02:40:23,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:23,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:40:24,648 INFO L321 Elim1Store]: treesize reduction 151, result has 10.7 percent of original size [2022-11-23 02:40:24,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 231 treesize of output 105 [2022-11-23 02:40:24,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:24,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2022-11-23 02:40:24,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:24,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2022-11-23 02:40:25,059 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-23 02:40:25,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 160 [2022-11-23 02:40:25,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:25,091 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-23 02:40:25,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 144 [2022-11-23 02:40:25,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2022-11-23 02:40:26,109 INFO L321 Elim1Store]: treesize reduction 48, result has 20.0 percent of original size [2022-11-23 02:40:26,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 75 [2022-11-23 02:40:26,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:26,126 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 02:40:26,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-23 02:40:26,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:40:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:40:26,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:40:27,314 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4185 (Array Int Int)) (v_ArrVal_4186 (Array Int Int)) (v_ArrVal_4187 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4185)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4187))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4186) (select (select .cse0 .cse1) .cse2)) (+ 4 (select (select .cse3 .cse1) .cse2))))))) is different from false [2022-11-23 02:40:27,333 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4185 (Array Int Int)) (v_ArrVal_4183 Int) (v_ArrVal_4186 (Array Int Int)) (v_ArrVal_4187 (Array Int Int)) (v_ArrVal_4182 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_4182) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4185)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4187))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_4183)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4186) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) is different from false [2022-11-23 02:40:30,706 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4185 (Array Int Int)) (v_ArrVal_4183 Int) (v_ArrVal_4186 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| Int) (v_ArrVal_4187 (Array Int Int)) (v_ArrVal_4199 (Array Int Int)) (v_ArrVal_4201 (Array Int Int)) (v_ArrVal_4202 (Array Int Int)) (v_ArrVal_4200 Int) (v_ArrVal_4182 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4201)) (.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4202))) (let ((.cse11 (select (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse10 (select (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (select (select .cse7 .cse11) .cse10))) (let ((.cse8 (select .cse7 .cse1)) (.cse2 (select (select .cse9 .cse11) .cse10))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (store (store .cse9 .cse1 v_ArrVal_4182) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4185)) (.cse3 (store (store .cse7 .cse1 (store .cse8 .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4187))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4199))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_4183))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4186) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 4))))) (not (<= (+ .cse2 4) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4200) .cse1))) (not (<= 0 .cse10)) (not (<= 0 .cse2)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| |c_#StackHeapBarrier|)) (not (= (select .cse8 .cse2) .cse11)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47|) 0)))))))) is different from false [2022-11-23 02:40:30,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167564864] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:40:30,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:40:30,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 40] total 79 [2022-11-23 02:40:30,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202814670] [2022-11-23 02:40:30,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:40:30,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-23 02:40:30,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:40:30,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-23 02:40:30,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=8209, Unknown=12, NotChecked=552, Total=9120 [2022-11-23 02:40:30,714 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 79 states, 75 states have (on average 1.52) internal successors, (114), 70 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:40:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:40:46,166 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2022-11-23 02:40:46,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-23 02:40:46,167 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 75 states have (on average 1.52) internal successors, (114), 70 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 64 [2022-11-23 02:40:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:40:46,168 INFO L225 Difference]: With dead ends: 108 [2022-11-23 02:40:46,168 INFO L226 Difference]: Without dead ends: 108 [2022-11-23 02:40:46,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3037 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=1015, Invalid=13988, Unknown=15, NotChecked=732, Total=15750 [2022-11-23 02:40:46,170 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 636 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 3223 mSolverCounterSat, 45 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 3272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3223 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:40:46,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1156 Invalid, 3272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3223 Invalid, 4 Unknown, 0 Unchecked, 4.2s Time] [2022-11-23 02:40:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-23 02:40:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2022-11-23 02:40:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:40:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2022-11-23 02:40:46,175 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 64 [2022-11-23 02:40:46,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:40:46,175 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2022-11-23 02:40:46,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 75 states have (on average 1.52) internal successors, (114), 70 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:40:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-11-23 02:40:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-23 02:40:46,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:40:46,177 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:40:46,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-23 02:40:46,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-23 02:40:46,385 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:40:46,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:40:46,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1212826698, now seen corresponding path program 2 times [2022-11-23 02:40:46,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:40:46,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924338332] [2022-11-23 02:40:46,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:40:46,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:40:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:40:48,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:40:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:40:48,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:40:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:40:49,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:40:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:40:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:40:50,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:40:50,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924338332] [2022-11-23 02:40:50,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924338332] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:40:50,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182690313] [2022-11-23 02:40:50,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:40:50,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:40:50,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:40:50,145 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:40:50,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-23 02:40:50,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:40:50,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:40:50,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 188 conjunts are in the unsatisfiable core [2022-11-23 02:40:50,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:40:50,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:40:50,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:40:50,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:40:50,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:50,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:40:51,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:40:51,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:51,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:40:51,618 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:40:51,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 02:40:51,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:51,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:51,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-23 02:40:51,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:40:52,320 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:40:52,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2022-11-23 02:40:52,851 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:40:52,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 24 [2022-11-23 02:40:52,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 02:40:52,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:52,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:40:52,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:40:53,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:53,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 02:40:53,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:53,698 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 02:40:53,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 57 [2022-11-23 02:40:53,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:53,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:53,742 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-23 02:40:53,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 42 [2022-11-23 02:40:53,782 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 02:40:53,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 02:40:56,928 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:40:56,979 INFO L321 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2022-11-23 02:40:56,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 209 treesize of output 122 [2022-11-23 02:40:56,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:57,029 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-23 02:40:57,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 121 [2022-11-23 02:40:57,728 INFO L321 Elim1Store]: treesize reduction 88, result has 27.9 percent of original size [2022-11-23 02:40:57,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 427 treesize of output 160 [2022-11-23 02:40:57,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:57,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:40:57,758 INFO L321 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2022-11-23 02:40:57,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 217 treesize of output 147 [2022-11-23 02:41:01,289 INFO L321 Elim1Store]: treesize reduction 48, result has 72.9 percent of original size [2022-11-23 02:41:01,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 401 treesize of output 467 [2022-11-23 02:41:08,030 INFO L321 Elim1Store]: treesize reduction 172, result has 62.7 percent of original size [2022-11-23 02:41:08,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 362 treesize of output 482 [2022-11-23 02:41:08,431 INFO L321 Elim1Store]: treesize reduction 72, result has 69.6 percent of original size [2022-11-23 02:41:08,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 318 treesize of output 355 [2022-11-23 02:41:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:41:22,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:41:27,010 INFO L321 Elim1Store]: treesize reduction 18, result has 98.3 percent of original size [2022-11-23 02:41:27,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 550 treesize of output 1082 [2022-11-23 02:41:31,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182690313] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:41:31,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:41:31,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 42] total 78 [2022-11-23 02:41:31,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562149700] [2022-11-23 02:41:31,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:41:31,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-23 02:41:31,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:41:31,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-23 02:41:31,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=9299, Unknown=2, NotChecked=0, Total=9702 [2022-11-23 02:41:31,940 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 79 states, 74 states have (on average 1.662162162162162) internal successors, (123), 69 states have internal predecessors, (123), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:41:52,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:41:52,429 INFO L93 Difference]: Finished difference Result 178 states and 190 transitions. [2022-11-23 02:41:52,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-23 02:41:52,430 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 74 states have (on average 1.662162162162162) internal successors, (123), 69 states have internal predecessors, (123), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 68 [2022-11-23 02:41:52,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:41:52,435 INFO L225 Difference]: With dead ends: 178 [2022-11-23 02:41:52,435 INFO L226 Difference]: Without dead ends: 178 [2022-11-23 02:41:52,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3797 ImplicationChecksByTransitivity, 33.4s TimeCoverageRelationStatistics Valid=1308, Invalid=16778, Unknown=4, NotChecked=0, Total=18090 [2022-11-23 02:41:52,437 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1720 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 3491 mSolverCounterSat, 43 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1720 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 3536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3491 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:41:52,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1720 Valid, 1303 Invalid, 3536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3491 Invalid, 2 Unknown, 0 Unchecked, 5.3s Time] [2022-11-23 02:41:52,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-23 02:41:52,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 99. [2022-11-23 02:41:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3) internal successors, (104), 94 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:41:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2022-11-23 02:41:52,441 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 68 [2022-11-23 02:41:52,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:41:52,441 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2022-11-23 02:41:52,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 74 states have (on average 1.662162162162162) internal successors, (123), 69 states have internal predecessors, (123), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:41:52,442 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2022-11-23 02:41:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-23 02:41:52,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:41:52,443 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:41:52,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-23 02:41:52,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:41:52,650 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:41:52,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:41:52,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1212826697, now seen corresponding path program 2 times [2022-11-23 02:41:52,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:41:52,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238973975] [2022-11-23 02:41:52,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:41:52,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:41:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:41:55,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:41:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:41:55,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:41:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:41:56,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:41:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:41:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:41:57,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:41:57,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238973975] [2022-11-23 02:41:57,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238973975] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:41:57,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5208992] [2022-11-23 02:41:57,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:41:57,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:41:57,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:41:57,028 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:41:57,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-23 02:41:57,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:41:57,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:41:57,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 157 conjunts are in the unsatisfiable core [2022-11-23 02:41:57,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:41:58,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-23 02:41:58,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 02:41:58,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:41:58,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:41:58,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-23 02:41:58,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:41:58,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-23 02:41:58,813 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 02:41:58,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 02:42:01,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:42:01,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:42:01,242 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-11-23 02:42:01,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 159 treesize of output 106 [2022-11-23 02:42:01,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:42:01,274 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-23 02:42:01,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 84 [2022-11-23 02:42:01,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:42:01,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:42:01,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:42:02,058 INFO L321 Elim1Store]: treesize reduction 156, result has 29.7 percent of original size [2022-11-23 02:42:02,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 124 treesize of output 143 [2022-11-23 02:42:02,069 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:42:02,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:42:02,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:42:02,215 INFO L321 Elim1Store]: treesize reduction 116, result has 46.5 percent of original size [2022-11-23 02:42:02,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 18 case distinctions, treesize of input 136 treesize of output 184 [2022-11-23 02:42:10,811 INFO L321 Elim1Store]: treesize reduction 303, result has 45.2 percent of original size [2022-11-23 02:42:10,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 21 new quantified variables, introduced 45 case distinctions, treesize of input 456 treesize of output 478 [2022-11-23 02:42:11,393 INFO L321 Elim1Store]: treesize reduction 264, result has 48.9 percent of original size [2022-11-23 02:42:11,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 15 new quantified variables, introduced 45 case distinctions, treesize of input 477 treesize of output 544 [2022-11-23 02:42:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:42:55,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:43:05,369 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:43:05,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14128 treesize of output 14132 [2022-11-23 02:43:16,123 WARN L859 $PredicateComparison]: unable to prove that (or (and (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse0 (select (select .cse14 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse3 (select (select .cse12 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select .cse12 .cse3) .cse0)) (.cse2 (select (select .cse14 .cse3) .cse0))) (let ((.cse9 (let ((.cse13 (store .cse14 .cse4 (store (select .cse14 .cse4) .cse2 0)))) (store .cse13 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse13 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse13 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse10 (let ((.cse11 (store .cse12 .cse4 (store (select .cse12 .cse4) .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse11 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse11 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse11 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select .cse10 .cse7) .cse1)) (.cse6 (select (select .cse9 .cse7) .cse1))) (let ((.cse8 (select (select .cse10 .cse5) .cse6))) (or (not (<= 0 .cse1)) (not (<= 0 .cse2)) (= .cse3 .cse4) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse5) (not (<= 0 .cse6)) (= .cse7 .cse8) (= .cse8 .cse5) (<= (select (select .cse9 .cse5) .cse6) 0)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse15 (select (select .cse29 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse15)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse18 (select (select .cse27 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse19 (select (select .cse27 .cse18) .cse15)) (.cse17 (select (select .cse29 .cse18) .cse15))) (let ((.cse23 (let ((.cse28 (store .cse29 .cse19 (store (select .cse29 .cse19) .cse17 0)))) (store .cse28 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse28 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse28 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse24 (let ((.cse26 (store .cse27 .cse19 (store (select .cse27 .cse19) .cse17 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse26 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse26 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse26 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse21 (select (select .cse24 .cse25) .cse16)) (.cse22 (select (select .cse23 .cse25) .cse16))) (let ((.cse20 (select (select .cse24 .cse21) .cse22))) (or (not (<= 0 .cse16)) (not (<= 0 .cse17)) (= .cse18 .cse19) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse20) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse21) (not (<= 0 .cse22)) (= .cse20 .cse21) (= (select (select .cse23 .cse21) .cse22) .cse16)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse30 (select (select .cse42 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse30)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse39 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse43 (select (select .cse39 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse40 (select (select .cse39 .cse43) .cse30)) (.cse31 (select (select .cse42 .cse43) .cse30))) (let ((.cse33 (let ((.cse41 (store .cse42 .cse40 (store (select .cse42 .cse40) .cse31 0)))) (store .cse41 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse41 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse41 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse36 (let ((.cse38 (store .cse39 .cse40 (store (select .cse39 .cse40) .cse31 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse38 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse38 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse38 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse37 (select (select .cse36 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse32 (select (select .cse33 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse35 (select (select .cse33 .cse37) .cse32)) (.cse34 (select (select .cse36 .cse37) .cse32))) (or (= .cse31 .cse30) (not (<= 0 .cse32)) (not (<= 0 .cse31)) (<= 0 (+ (select (select .cse33 .cse34) .cse35) 4)) (< 0 .cse35) (not (<= 0 .cse35)) (= (select (select .cse36 .cse34) .cse35) .cse34))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse57 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse45 (select (select .cse57 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse54 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse58 (select (select .cse54 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse55 (select (select .cse54 .cse58) .cse45)) (.cse44 (select (select .cse57 .cse58) .cse45))) (let ((.cse52 (let ((.cse56 (store .cse57 .cse55 (store (select .cse57 .cse55) .cse44 0)))) (store .cse56 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse56 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse56 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse51 (let ((.cse53 (store .cse54 .cse55 (store (select .cse54 .cse55) .cse44 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse53 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse53 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse53 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse46 (select (select .cse52 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse48 (select (select .cse51 .cse50) .cse46)) (.cse49 (select (select .cse52 .cse50) .cse46))) (let ((.cse47 (select (select .cse51 .cse48) .cse49))) (or (= .cse44 .cse45) (not (<= 0 .cse46)) (not (<= 0 .cse44)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse47) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse48) (not (<= 0 .cse49)) (= .cse50 .cse47) (= .cse47 .cse48)))))))))) (not (<= 0 .cse45)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse72 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse60 (select (select .cse72 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse69 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse73 (select (select .cse69 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse70 (select (select .cse69 .cse73) .cse60)) (.cse59 (select (select .cse72 .cse73) .cse60))) (let ((.cse66 (let ((.cse71 (store .cse72 .cse70 (store (select .cse72 .cse70) .cse59 0)))) (store .cse71 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse71 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse71 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse67 (let ((.cse68 (store .cse69 .cse70 (store (select .cse69 .cse70) .cse59 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse68 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse68 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse68 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse64 (select (select .cse67 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse61 (select (select .cse66 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse62 (select (select .cse67 .cse64) .cse61)) (.cse63 (select (select .cse66 .cse64) .cse61))) (let ((.cse65 (select (select .cse67 .cse62) .cse63))) (or (= .cse59 .cse60) (not (<= 0 .cse61)) (not (<= 0 .cse59)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse62) (not (<= 0 .cse63)) (= .cse64 .cse65) (= .cse65 .cse62) (<= (select (select .cse66 .cse62) .cse63) 0)))))))))) (not (<= 0 .cse60)))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse87 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse74 (select (select .cse87 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse74)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse85 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse77 (select (select .cse85 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse78 (select (select .cse85 .cse77) .cse74)) (.cse76 (select (select .cse87 .cse77) .cse74))) (let ((.cse79 (let ((.cse86 (store .cse87 .cse78 (store (select .cse87 .cse78) .cse76 0)))) (store .cse86 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse86 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse86 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse82 (let ((.cse84 (store .cse85 .cse78 (store (select .cse85 .cse78) .cse76 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse84 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse84 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse84 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse83 (select (select .cse82 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse75 (select (select .cse79 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse81 (select (select .cse79 .cse83) .cse75)) (.cse80 (select (select .cse82 .cse83) .cse75))) (or (not (<= 0 .cse75)) (not (<= 0 .cse76)) (= .cse77 .cse78) (<= 0 (+ (select (select .cse79 .cse80) .cse81) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse80) (not (<= 0 .cse81)) (= (select (select .cse82 .cse80) .cse81) .cse80))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse101 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse88 (select (select .cse101 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse88)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse99 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse91 (select (select .cse99 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse92 (select (select .cse99 .cse91) .cse88)) (.cse90 (select (select .cse101 .cse91) .cse88))) (let ((.cse97 (let ((.cse100 (store .cse101 .cse92 (store (select .cse101 .cse92) .cse90 0)))) (store .cse100 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse100 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse100 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse95 (let ((.cse98 (store .cse99 .cse92 (store (select .cse99 .cse92) .cse90 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse98 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse98 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse98 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse94 (select (select .cse95 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse89 (select (select .cse97 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse93 (select (select .cse97 .cse94) .cse89)) (.cse96 (select (select .cse95 .cse94) .cse89))) (or (not (<= 0 .cse89)) (not (<= 0 .cse90)) (= .cse91 .cse92) (not (<= 0 .cse93)) (not (<= .cse93 0)) (= .cse94 (select (select .cse95 .cse96) .cse93)) (<= (select (select .cse97 .cse96) .cse93) 0) (not (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse96)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse115 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse102 (select (select .cse115 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse102)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse112 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse116 (select (select .cse112 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse113 (select (select .cse112 .cse116) .cse102)) (.cse103 (select (select .cse115 .cse116) .cse102))) (let ((.cse110 (let ((.cse114 (store .cse115 .cse113 (store (select .cse115 .cse113) .cse103 0)))) (store .cse114 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse114 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse114 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse109 (let ((.cse111 (store .cse112 .cse113 (store (select .cse112 .cse113) .cse103 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse111 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse111 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse111 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse107 (select (select .cse109 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse104 (select (select .cse110 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse108 (select (select .cse109 .cse107) .cse104)) (.cse105 (select (select .cse110 .cse107) .cse104))) (let ((.cse106 (select (select .cse109 .cse108) .cse105))) (or (= .cse103 .cse102) (not (<= 0 .cse104)) (not (<= 0 .cse103)) (< 0 .cse105) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse106) (not (<= 0 .cse105)) (= .cse107 .cse106) (= .cse106 .cse108)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse130 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse117 (select (select .cse130 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse117)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse127 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse131 (select (select .cse127 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse128 (select (select .cse127 .cse131) .cse117)) (.cse118 (select (select .cse130 .cse131) .cse117))) (let ((.cse124 (let ((.cse129 (store .cse130 .cse128 (store (select .cse130 .cse128) .cse118 0)))) (store .cse129 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse129 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse129 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse121 (let ((.cse126 (store .cse127 .cse128 (store (select .cse127 .cse128) .cse118 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse126 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse126 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse126 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse125 (select (select .cse121 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse119 (select (select .cse124 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse122 (select (select .cse121 .cse125) .cse119)) (.cse120 (select (select .cse124 .cse125) .cse119))) (let ((.cse123 (select (select .cse124 .cse122) .cse120))) (or (= .cse118 .cse117) (not (<= 0 .cse119)) (not (<= 0 .cse118)) (< 0 .cse120) (not (<= 0 .cse120)) (= (select (select .cse121 .cse122) .cse120) .cse122) (<= .cse123 0) (= .cse123 .cse119)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse146 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse132 (select (select .cse146 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse132)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse144 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse135 (select (select .cse144 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse136 (select (select .cse144 .cse135) .cse132)) (.cse134 (select (select .cse146 .cse135) .cse132))) (let ((.cse142 (let ((.cse145 (store .cse146 .cse136 (store (select .cse146 .cse136) .cse134 0)))) (store .cse145 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse145 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse145 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse141 (let ((.cse143 (store .cse144 .cse136 (store (select .cse144 .cse136) .cse134 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse143 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse143 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse143 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse140 (select (select .cse141 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse133 (select (select .cse142 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse138 (select (select .cse141 .cse140) .cse133)) (.cse139 (select (select .cse142 .cse140) .cse133))) (let ((.cse137 (select (select .cse141 .cse138) .cse139))) (or (not (<= 0 .cse133)) (not (<= 0 .cse134)) (= .cse135 .cse136) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse137) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse138) (not (<= 0 .cse139)) (= .cse140 .cse137) (= .cse137 .cse138)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse160 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse147 (select (select .cse160 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse147)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse158 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse150 (select (select .cse158 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse151 (select (select .cse158 .cse150) .cse147)) (.cse149 (select (select .cse160 .cse150) .cse147))) (let ((.cse152 (let ((.cse159 (store .cse160 .cse151 (store (select .cse160 .cse151) .cse149 0)))) (store .cse159 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse159 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse159 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse156 (let ((.cse157 (store .cse158 .cse151 (store (select .cse158 .cse151) .cse149 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse157 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse157 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse157 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse155 (select (select .cse156 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse148 (select (select .cse152 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse153 (select (select .cse156 .cse155) .cse148)) (.cse154 (select (select .cse152 .cse155) .cse148))) (or (not (<= 0 .cse148)) (not (<= 0 .cse149)) (= .cse150 .cse151) (<= 0 (+ (select (select .cse152 .cse153) .cse154) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse153) (not (<= 0 .cse154)) (= .cse155 (select (select .cse156 .cse153) .cse154)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse175 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse161 (select (select .cse175 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse161)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse173 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse164 (select (select .cse173 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse165 (select (select .cse173 .cse164) .cse161)) (.cse163 (select (select .cse175 .cse164) .cse161))) (let ((.cse170 (let ((.cse174 (store .cse175 .cse165 (store (select .cse175 .cse165) .cse163 0)))) (store .cse174 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse174 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse174 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse166 (let ((.cse172 (store .cse173 .cse165 (store (select .cse173 .cse165) .cse163 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse172 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse172 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse172 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse171 (select (select .cse166 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse162 (select (select .cse170 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse167 (select (select .cse166 .cse171) .cse162)) (.cse168 (select (select .cse170 .cse171) .cse162))) (let ((.cse169 (select (select .cse170 .cse167) .cse168))) (or (not (<= 0 .cse162)) (not (<= 0 .cse163)) (= .cse164 .cse165) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (select (select .cse166 .cse167) .cse168)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse167) (< .cse169 (+ .cse168 1)) (not (<= 0 .cse168)) (= .cse169 .cse162)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse189 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse176 (select (select .cse189 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse176)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse187 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse179 (select (select .cse187 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse180 (select (select .cse187 .cse179) .cse176)) (.cse178 (select (select .cse189 .cse179) .cse176))) (let ((.cse181 (let ((.cse188 (store .cse189 .cse180 (store (select .cse189 .cse180) .cse178 0)))) (store .cse188 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse188 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse188 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse184 (let ((.cse186 (store .cse187 .cse180 (store (select .cse187 .cse180) .cse178 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse186 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse186 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse186 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse185 (select (select .cse184 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse177 (select (select .cse181 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse183 (select (select .cse181 .cse185) .cse177)) (.cse182 (select (select .cse184 .cse185) .cse177))) (or (not (<= 0 .cse177)) (not (<= 0 .cse178)) (= .cse179 .cse180) (<= 0 (+ (select (select .cse181 .cse182) .cse183) 4)) (< 0 .cse183) (not (<= 0 .cse183)) (= (select (select .cse184 .cse182) .cse183) .cse182))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse204 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse190 (select (select .cse204 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse190)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse202 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse193 (select (select .cse202 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse194 (select (select .cse202 .cse193) .cse190)) (.cse192 (select (select .cse204 .cse193) .cse190))) (let ((.cse199 (let ((.cse203 (store .cse204 .cse194 (store (select .cse204 .cse194) .cse192 0)))) (store .cse203 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse203 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse203 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse200 (let ((.cse201 (store .cse202 .cse194 (store (select .cse202 .cse194) .cse192 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse201 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse201 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse201 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse196 (select (select .cse200 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse191 (select (select .cse199 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse198 (select (select .cse200 .cse196) .cse191)) (.cse195 (select (select .cse199 .cse196) .cse191))) (let ((.cse197 (select (select .cse200 .cse198) .cse195))) (or (not (<= 0 .cse191)) (not (<= 0 .cse192)) (= .cse193 .cse194) (< 0 .cse195) (not (<= 0 .cse195)) (= .cse196 .cse197) (= .cse197 .cse198) (<= (select (select .cse199 .cse198) .cse195) 0)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse217 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse205 (select (select .cse217 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse205)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse214 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse218 (select (select .cse214 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse215 (select (select .cse214 .cse218) .cse205)) (.cse206 (select (select .cse217 .cse218) .cse205))) (let ((.cse208 (let ((.cse216 (store .cse217 .cse215 (store (select .cse217 .cse215) .cse206 0)))) (store .cse216 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse216 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse216 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse211 (let ((.cse213 (store .cse214 .cse215 (store (select .cse214 .cse215) .cse206 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse213 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse213 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse213 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse212 (select (select .cse211 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse207 (select (select .cse208 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse210 (select (select .cse208 .cse212) .cse207)) (.cse209 (select (select .cse211 .cse212) .cse207))) (or (= .cse206 .cse205) (not (<= 0 .cse207)) (not (<= 0 .cse206)) (<= 0 (+ (select (select .cse208 .cse209) .cse210) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse209) (not (<= 0 .cse210)) (= (select (select .cse211 .cse209) .cse210) .cse209))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse231 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse219 (select (select .cse231 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse219)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse228 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse232 (select (select .cse228 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse229 (select (select .cse228 .cse232) .cse219)) (.cse220 (select (select .cse231 .cse232) .cse219))) (let ((.cse222 (let ((.cse230 (store .cse231 .cse229 (store (select .cse231 .cse229) .cse220 0)))) (store .cse230 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse230 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse230 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse226 (let ((.cse227 (store .cse228 .cse229 (store (select .cse228 .cse229) .cse220 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse227 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse227 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse227 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse225 (select (select .cse226 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse221 (select (select .cse222 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse223 (select (select .cse226 .cse225) .cse221)) (.cse224 (select (select .cse222 .cse225) .cse221))) (or (= .cse220 .cse219) (not (<= 0 .cse221)) (not (<= 0 .cse220)) (<= 0 (+ (select (select .cse222 .cse223) .cse224) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse223) (not (<= 0 .cse224)) (= .cse225 (select (select .cse226 .cse223) .cse224)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse246 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse247 (select (select .cse246 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse244 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse235 (select (select .cse244 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse236 (select (select .cse244 .cse235) .cse247)) (.cse234 (select (select .cse246 .cse235) .cse247))) (let ((.cse240 (let ((.cse245 (store .cse246 .cse236 (store (select .cse246 .cse236) .cse234 0)))) (store .cse245 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse245 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse245 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse242 (let ((.cse243 (store .cse244 .cse236 (store (select .cse244 .cse236) .cse234 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse243 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse243 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse243 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse241 (select (select .cse242 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse233 (select (select .cse240 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse239 (select (select .cse242 .cse241) .cse233)) (.cse237 (select (select .cse240 .cse241) .cse233))) (let ((.cse238 (select (select .cse240 .cse239) .cse237))) (or (not (<= 0 .cse233)) (not (<= 0 .cse234)) (= .cse235 .cse236) (not (<= 0 .cse237)) (not (<= .cse237 0)) (<= .cse238 0) (not (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse239)) (= .cse238 .cse233)))))))))) (not (<= 0 .cse247)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse261 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse262 (select (select .cse261 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse259 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse250 (select (select .cse259 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse251 (select (select .cse259 .cse250) .cse262)) (.cse249 (select (select .cse261 .cse250) .cse262))) (let ((.cse252 (let ((.cse260 (store .cse261 .cse251 (store (select .cse261 .cse251) .cse249 0)))) (store .cse260 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse260 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse260 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse257 (let ((.cse258 (store .cse259 .cse251 (store (select .cse259 .cse251) .cse249 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse258 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse258 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse258 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse255 (select (select .cse257 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse248 (select (select .cse252 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse253 (select (select .cse257 .cse255) .cse248)) (.cse254 (select (select .cse252 .cse255) .cse248))) (let ((.cse256 (select (select .cse257 .cse253) .cse254))) (or (not (<= 0 .cse248)) (not (<= 0 .cse249)) (= .cse250 .cse251) (<= 0 (+ (select (select .cse252 .cse253) .cse254) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse253) (not (<= 0 .cse254)) (= .cse255 .cse256) (= .cse256 .cse253)))))))))) (not (<= 0 .cse262)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse275 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse263 (select (select .cse275 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse263)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse272 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse276 (select (select .cse272 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse273 (select (select .cse272 .cse276) .cse263)) (.cse264 (select (select .cse275 .cse276) .cse263))) (let ((.cse270 (let ((.cse274 (store .cse275 .cse273 (store (select .cse275 .cse273) .cse264 0)))) (store .cse274 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse274 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse274 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse268 (let ((.cse271 (store .cse272 .cse273 (store (select .cse272 .cse273) .cse264 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse271 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse271 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse271 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse267 (select (select .cse268 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse265 (select (select .cse270 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse266 (select (select .cse270 .cse267) .cse265)) (.cse269 (select (select .cse268 .cse267) .cse265))) (or (= .cse264 .cse263) (not (<= 0 .cse265)) (not (<= 0 .cse264)) (not (<= 0 .cse266)) (not (<= .cse266 0)) (= .cse267 (select (select .cse268 .cse269) .cse266)) (<= (select (select .cse270 .cse269) .cse266) 0) (not (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse269)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse290 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse277 (select (select .cse290 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse277)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse287 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse291 (select (select .cse287 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse288 (select (select .cse287 .cse291) .cse277)) (.cse278 (select (select .cse290 .cse291) .cse277))) (let ((.cse283 (let ((.cse289 (store .cse290 .cse288 (store (select .cse290 .cse288) .cse278 0)))) (store .cse289 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse289 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse289 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse284 (let ((.cse286 (store .cse287 .cse288 (store (select .cse287 .cse288) .cse278 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse286 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse286 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse286 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse285 (select (select .cse284 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse279 (select (select .cse283 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse281 (select (select .cse284 .cse285) .cse279)) (.cse282 (select (select .cse283 .cse285) .cse279))) (let ((.cse280 (select (select .cse284 .cse281) .cse282))) (or (= .cse278 .cse277) (not (<= 0 .cse279)) (not (<= 0 .cse278)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse280) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse281) (not (<= 0 .cse282)) (= .cse280 .cse281) (= (select (select .cse283 .cse281) .cse282) .cse279)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse305 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse293 (select (select .cse305 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse302 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse306 (select (select .cse302 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse303 (select (select .cse302 .cse306) .cse293)) (.cse292 (select (select .cse305 .cse306) .cse293))) (let ((.cse299 (let ((.cse304 (store .cse305 .cse303 (store (select .cse305 .cse303) .cse292 0)))) (store .cse304 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse304 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse304 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse300 (let ((.cse301 (store .cse302 .cse303 (store (select .cse302 .cse303) .cse292 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse301 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse301 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse301 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse296 (select (select .cse300 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse294 (select (select .cse299 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse298 (select (select .cse300 .cse296) .cse294)) (.cse295 (select (select .cse299 .cse296) .cse294))) (let ((.cse297 (select (select .cse300 .cse298) .cse295))) (or (= .cse292 .cse293) (not (<= 0 .cse294)) (not (<= 0 .cse292)) (< 0 .cse295) (not (<= 0 .cse295)) (= .cse296 .cse297) (= .cse297 .cse298) (<= (select (select .cse299 .cse298) .cse295) 0)))))))))) (not (<= 0 .cse293)))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse320 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse307 (select (select .cse320 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse307)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse317 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse321 (select (select .cse317 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse318 (select (select .cse317 .cse321) .cse307)) (.cse308 (select (select .cse320 .cse321) .cse307))) (let ((.cse314 (let ((.cse319 (store .cse320 .cse318 (store (select .cse320 .cse318) .cse308 0)))) (store .cse319 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse319 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse319 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse310 (let ((.cse316 (store .cse317 .cse318 (store (select .cse317 .cse318) .cse308 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse316 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse316 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse316 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse315 (select (select .cse310 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse309 (select (select .cse314 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse311 (select (select .cse310 .cse315) .cse309)) (.cse312 (select (select .cse314 .cse315) .cse309))) (let ((.cse313 (select (select .cse314 .cse311) .cse312))) (or (= .cse308 .cse307) (not (<= 0 .cse309)) (not (<= 0 .cse308)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (select (select .cse310 .cse311) .cse312)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse311) (< .cse313 (+ .cse312 1)) (not (<= 0 .cse312)) (= .cse313 .cse309)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse334 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse323 (select (select .cse334 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse331 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse335 (select (select .cse331 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse332 (select (select .cse331 .cse335) .cse323)) (.cse322 (select (select .cse334 .cse335) .cse323))) (let ((.cse325 (let ((.cse333 (store .cse334 .cse332 (store (select .cse334 .cse332) .cse322 0)))) (store .cse333 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse333 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse333 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse329 (let ((.cse330 (store .cse331 .cse332 (store (select .cse331 .cse332) .cse322 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse330 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse330 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse330 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse328 (select (select .cse329 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse324 (select (select .cse325 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse326 (select (select .cse329 .cse328) .cse324)) (.cse327 (select (select .cse325 .cse328) .cse324))) (or (= .cse322 .cse323) (not (<= 0 .cse324)) (not (<= 0 .cse322)) (<= 0 (+ (select (select .cse325 .cse326) .cse327) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse326) (not (<= 0 .cse327)))))))))) (not (<= 0 .cse323)))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse350 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse336 (select (select .cse350 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse336)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse348 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse339 (select (select .cse348 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse340 (select (select .cse348 .cse339) .cse336)) (.cse338 (select (select .cse350 .cse339) .cse336))) (let ((.cse344 (let ((.cse349 (store .cse350 .cse340 (store (select .cse350 .cse340) .cse338 0)))) (store .cse349 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse349 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse349 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse345 (let ((.cse347 (store .cse348 .cse340 (store (select .cse348 .cse340) .cse338 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse347 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse347 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse347 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse346 (select (select .cse345 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse337 (select (select .cse344 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse343 (select (select .cse345 .cse346) .cse337)) (.cse341 (select (select .cse344 .cse346) .cse337))) (let ((.cse342 (select (select .cse345 .cse343) .cse341))) (or (not (<= 0 .cse337)) (not (<= 0 .cse338)) (= .cse339 .cse340) (< 0 .cse341) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse342) (not (<= 0 .cse341)) (= .cse342 .cse343) (= (select (select .cse344 .cse343) .cse341) .cse337)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse364 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse351 (select (select .cse364 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse351)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse361 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse365 (select (select .cse361 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse362 (select (select .cse361 .cse365) .cse351)) (.cse352 (select (select .cse364 .cse365) .cse351))) (let ((.cse354 (let ((.cse363 (store .cse364 .cse362 (store (select .cse364 .cse362) .cse352 0)))) (store .cse363 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse363 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse363 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse359 (let ((.cse360 (store .cse361 .cse362 (store (select .cse361 .cse362) .cse352 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse360 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse360 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse360 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse357 (select (select .cse359 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse353 (select (select .cse354 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse355 (select (select .cse359 .cse357) .cse353)) (.cse356 (select (select .cse354 .cse357) .cse353))) (let ((.cse358 (select (select .cse359 .cse355) .cse356))) (or (= .cse352 .cse351) (not (<= 0 .cse353)) (not (<= 0 .cse352)) (<= 0 (+ (select (select .cse354 .cse355) .cse356) 4)) (< 0 .cse356) (not (<= 0 .cse356)) (= .cse357 .cse358) (= .cse358 .cse355)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse380 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse366 (select (select .cse380 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse366)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse378 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse369 (select (select .cse378 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse370 (select (select .cse378 .cse369) .cse366)) (.cse368 (select (select .cse380 .cse369) .cse366))) (let ((.cse371 (let ((.cse379 (store .cse380 .cse370 (store (select .cse380 .cse370) .cse368 0)))) (store .cse379 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse379 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse379 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse376 (let ((.cse377 (store .cse378 .cse370 (store (select .cse378 .cse370) .cse368 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse377 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse377 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse377 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse374 (select (select .cse376 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse367 (select (select .cse371 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse372 (select (select .cse376 .cse374) .cse367)) (.cse373 (select (select .cse371 .cse374) .cse367))) (let ((.cse375 (select (select .cse376 .cse372) .cse373))) (or (not (<= 0 .cse367)) (not (<= 0 .cse368)) (= .cse369 .cse370) (<= 0 (+ (select (select .cse371 .cse372) .cse373) 4)) (< 0 .cse373) (not (<= 0 .cse373)) (= .cse374 .cse375) (= .cse375 .cse372)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse394 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse381 (select (select .cse394 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse381)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse391 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse395 (select (select .cse391 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse392 (select (select .cse391 .cse395) .cse381)) (.cse382 (select (select .cse394 .cse395) .cse381))) (let ((.cse387 (let ((.cse393 (store .cse394 .cse392 (store (select .cse394 .cse392) .cse382 0)))) (store .cse393 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse393 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse393 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse388 (let ((.cse390 (store .cse391 .cse392 (store (select .cse391 .cse392) .cse382 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse390 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse390 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse390 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse389 (select (select .cse388 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse383 (select (select .cse387 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse386 (select (select .cse388 .cse389) .cse383)) (.cse384 (select (select .cse387 .cse389) .cse383))) (let ((.cse385 (select (select .cse388 .cse386) .cse384))) (or (= .cse382 .cse381) (not (<= 0 .cse383)) (not (<= 0 .cse382)) (< 0 .cse384) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse385) (not (<= 0 .cse384)) (= .cse385 .cse386) (= (select (select .cse387 .cse386) .cse384) .cse383)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse409 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse396 (select (select .cse409 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse396)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse406 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse410 (select (select .cse406 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse407 (select (select .cse406 .cse410) .cse396)) (.cse397 (select (select .cse409 .cse410) .cse396))) (let ((.cse399 (let ((.cse408 (store .cse409 .cse407 (store (select .cse409 .cse407) .cse397 0)))) (store .cse408 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse408 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse408 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse404 (let ((.cse405 (store .cse406 .cse407 (store (select .cse406 .cse407) .cse397 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse405 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse405 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse405 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse402 (select (select .cse404 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse398 (select (select .cse399 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse400 (select (select .cse404 .cse402) .cse398)) (.cse401 (select (select .cse399 .cse402) .cse398))) (let ((.cse403 (select (select .cse404 .cse400) .cse401))) (or (= .cse397 .cse396) (not (<= 0 .cse398)) (not (<= 0 .cse397)) (<= 0 (+ (select (select .cse399 .cse400) .cse401) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse400) (not (<= 0 .cse401)) (= .cse402 .cse403) (= .cse403 .cse400)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse424 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse425 (select (select .cse424 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse422 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse413 (select (select .cse422 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse414 (select (select .cse422 .cse413) .cse425)) (.cse412 (select (select .cse424 .cse413) .cse425))) (let ((.cse417 (let ((.cse423 (store .cse424 .cse414 (store (select .cse424 .cse414) .cse412 0)))) (store .cse423 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse423 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse423 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse420 (let ((.cse421 (store .cse422 .cse414 (store (select .cse422 .cse414) .cse412 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse421 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse421 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse421 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse419 (select (select .cse420 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse411 (select (select .cse417 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse416 (select (select .cse420 .cse419) .cse411)) (.cse418 (select (select .cse417 .cse419) .cse411))) (let ((.cse415 (select (select .cse420 .cse416) .cse418))) (or (not (<= 0 .cse411)) (not (<= 0 .cse412)) (= .cse413 .cse414) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse415) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse416) (< (select (select .cse417 .cse416) .cse418) (+ .cse418 1)) (not (<= 0 .cse418)) (= .cse419 .cse415)))))))))) (not (<= 0 .cse425)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse439 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse426 (select (select .cse439 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse426)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse436 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse440 (select (select .cse436 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse437 (select (select .cse436 .cse440) .cse426)) (.cse427 (select (select .cse439 .cse440) .cse426))) (let ((.cse433 (let ((.cse438 (store .cse439 .cse437 (store (select .cse439 .cse437) .cse427 0)))) (store .cse438 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse438 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse438 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse431 (let ((.cse435 (store .cse436 .cse437 (store (select .cse436 .cse437) .cse427 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse435 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse435 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse435 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse434 (select (select .cse431 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse428 (select (select .cse433 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse429 (select (select .cse431 .cse434) .cse428)) (.cse430 (select (select .cse433 .cse434) .cse428))) (let ((.cse432 (select (select .cse433 .cse429) .cse430))) (or (= .cse427 .cse426) (not (<= 0 .cse428)) (not (<= 0 .cse427)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse429) (not (<= 0 .cse430)) (= (select (select .cse431 .cse429) .cse430) .cse429) (<= .cse432 0) (= .cse432 .cse428)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse455 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse441 (select (select .cse455 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse441)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse453 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse444 (select (select .cse453 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse445 (select (select .cse453 .cse444) .cse441)) (.cse443 (select (select .cse455 .cse444) .cse441))) (let ((.cse450 (let ((.cse454 (store .cse455 .cse445 (store (select .cse455 .cse445) .cse443 0)))) (store .cse454 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse454 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse454 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse447 (let ((.cse452 (store .cse453 .cse445 (store (select .cse453 .cse445) .cse443 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse452 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse452 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse452 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse451 (select (select .cse447 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse442 (select (select .cse450 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse448 (select (select .cse447 .cse451) .cse442)) (.cse446 (select (select .cse450 .cse451) .cse442))) (let ((.cse449 (select (select .cse450 .cse448) .cse446))) (or (not (<= 0 .cse442)) (not (<= 0 .cse443)) (= .cse444 .cse445) (< 0 .cse446) (not (<= 0 .cse446)) (= (select (select .cse447 .cse448) .cse446) .cse448) (<= .cse449 0) (= .cse449 .cse442)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse470 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse456 (select (select .cse470 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse456)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse468 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse459 (select (select .cse468 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse460 (select (select .cse468 .cse459) .cse456)) (.cse458 (select (select .cse470 .cse459) .cse456))) (let ((.cse466 (let ((.cse469 (store .cse470 .cse460 (store (select .cse470 .cse460) .cse458 0)))) (store .cse469 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse469 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse469 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse465 (let ((.cse467 (store .cse468 .cse460 (store (select .cse468 .cse460) .cse458 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse467 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse467 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse467 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse463 (select (select .cse465 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse457 (select (select .cse466 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse464 (select (select .cse465 .cse463) .cse457)) (.cse461 (select (select .cse466 .cse463) .cse457))) (let ((.cse462 (select (select .cse465 .cse464) .cse461))) (or (not (<= 0 .cse457)) (not (<= 0 .cse458)) (= .cse459 .cse460) (< 0 .cse461) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse462) (not (<= 0 .cse461)) (= .cse463 .cse462) (= .cse462 .cse464)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse485 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse471 (select (select .cse485 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse471)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse483 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse474 (select (select .cse483 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse475 (select (select .cse483 .cse474) .cse471)) (.cse473 (select (select .cse485 .cse474) .cse471))) (let ((.cse480 (let ((.cse484 (store .cse485 .cse475 (store (select .cse485 .cse475) .cse473 0)))) (store .cse484 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse484 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse484 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse478 (let ((.cse482 (store .cse483 .cse475 (store (select .cse483 .cse475) .cse473 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse482 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse482 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse482 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse481 (select (select .cse478 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse472 (select (select .cse480 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse476 (select (select .cse478 .cse481) .cse472)) (.cse477 (select (select .cse480 .cse481) .cse472))) (let ((.cse479 (select (select .cse480 .cse476) .cse477))) (or (not (<= 0 .cse472)) (not (<= 0 .cse473)) (= .cse474 .cse475) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse476) (not (<= 0 .cse477)) (= (select (select .cse478 .cse476) .cse477) .cse476) (<= .cse479 0) (= .cse479 .cse472)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse499 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse486 (select (select .cse499 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse486)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse496 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse500 (select (select .cse496 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse497 (select (select .cse496 .cse500) .cse486)) (.cse487 (select (select .cse499 .cse500) .cse486))) (let ((.cse492 (let ((.cse498 (store .cse499 .cse497 (store (select .cse499 .cse497) .cse487 0)))) (store .cse498 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse498 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse498 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse494 (let ((.cse495 (store .cse496 .cse497 (store (select .cse496 .cse497) .cse487 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse495 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse495 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse495 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse493 (select (select .cse494 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse488 (select (select .cse492 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse491 (select (select .cse494 .cse493) .cse488)) (.cse489 (select (select .cse492 .cse493) .cse488))) (let ((.cse490 (select (select .cse492 .cse491) .cse489))) (or (= .cse487 .cse486) (not (<= 0 .cse488)) (not (<= 0 .cse487)) (not (<= 0 .cse489)) (not (<= .cse489 0)) (<= .cse490 0) (not (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse491)) (= .cse490 .cse488)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse514 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse501 (select (select .cse514 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse501)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse511 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse515 (select (select .cse511 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse512 (select (select .cse511 .cse515) .cse501)) (.cse502 (select (select .cse514 .cse515) .cse501))) (let ((.cse506 (let ((.cse513 (store .cse514 .cse512 (store (select .cse514 .cse512) .cse502 0)))) (store .cse513 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse513 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse513 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse509 (let ((.cse510 (store .cse511 .cse512 (store (select .cse511 .cse512) .cse502 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse510 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse510 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse510 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse508 (select (select .cse509 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse503 (select (select .cse506 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse505 (select (select .cse509 .cse508) .cse503)) (.cse507 (select (select .cse506 .cse508) .cse503))) (let ((.cse504 (select (select .cse509 .cse505) .cse507))) (or (= .cse502 .cse501) (not (<= 0 .cse503)) (not (<= 0 .cse502)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse504) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse505) (< (select (select .cse506 .cse505) .cse507) (+ .cse507 1)) (not (<= 0 .cse507)) (= .cse508 .cse504)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse529 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse516 (select (select .cse529 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse516)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse527 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse519 (select (select .cse527 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse520 (select (select .cse527 .cse519) .cse516)) (.cse518 (select (select .cse529 .cse519) .cse516))) (let ((.cse521 (let ((.cse528 (store .cse529 .cse520 (store (select .cse529 .cse520) .cse518 0)))) (store .cse528 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse528 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse528 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse525 (let ((.cse526 (store .cse527 .cse520 (store (select .cse527 .cse520) .cse518 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse526 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse526 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse526 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse524 (select (select .cse525 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse517 (select (select .cse521 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse522 (select (select .cse525 .cse524) .cse517)) (.cse523 (select (select .cse521 .cse524) .cse517))) (or (not (<= 0 .cse517)) (not (<= 0 .cse518)) (= .cse519 .cse520) (<= 0 (+ (select (select .cse521 .cse522) .cse523) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse522) (not (<= 0 .cse523))))))))))))))))) (not (<= 0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) is different from true [2022-11-23 02:43:16,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5208992] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:43:16,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:43:16,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 39] total 77 [2022-11-23 02:43:16,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656841199] [2022-11-23 02:43:16,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:43:16,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-11-23 02:43:16,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:43:16,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-11-23 02:43:16,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=10032, Unknown=1, NotChecked=202, Total=10712 [2022-11-23 02:43:16,142 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 78 states, 74 states have (on average 1.6216216216216217) internal successors, (120), 71 states have internal predecessors, (120), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-23 02:43:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:43:47,249 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2022-11-23 02:43:47,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-23 02:43:47,250 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 74 states have (on average 1.6216216216216217) internal successors, (120), 71 states have internal predecessors, (120), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 68 [2022-11-23 02:43:47,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:43:47,251 INFO L225 Difference]: With dead ends: 165 [2022-11-23 02:43:47,251 INFO L226 Difference]: Without dead ends: 165 [2022-11-23 02:43:47,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 141 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4176 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=1469, Invalid=18556, Unknown=1, NotChecked=280, Total=20306 [2022-11-23 02:43:47,253 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1969 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 3222 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1969 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 3261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:43:47,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1969 Valid, 1363 Invalid, 3261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3222 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2022-11-23 02:43:47,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-23 02:43:47,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 99. [2022-11-23 02:43:47,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.275) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:43:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2022-11-23 02:43:47,257 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 68 [2022-11-23 02:43:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:43:47,257 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2022-11-23 02:43:47,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 74 states have (on average 1.6216216216216217) internal successors, (120), 71 states have internal predecessors, (120), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-23 02:43:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-11-23 02:43:47,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-23 02:43:47,259 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:43:47,259 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:43:47,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-11-23 02:43:47,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:43:47,467 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:43:47,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:43:47,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1057077042, now seen corresponding path program 1 times [2022-11-23 02:43:47,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:43:47,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065281455] [2022-11-23 02:43:47,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:43:47,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:43:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:43:51,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:43:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:43:51,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:43:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:43:51,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:43:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:43:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:43:52,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:43:52,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065281455] [2022-11-23 02:43:52,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065281455] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:43:52,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840724683] [2022-11-23 02:43:52,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:43:52,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:43:52,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:43:52,824 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:43:52,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-23 02:43:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:43:53,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 132 conjunts are in the unsatisfiable core [2022-11-23 02:43:53,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:43:53,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:43:53,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:43:53,988 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 02:43:53,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 02:43:54,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:43:54,675 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-23 02:43:54,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 02:43:55,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:43:55,771 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:43:55,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-23 02:43:56,627 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-23 02:43:56,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 26 [2022-11-23 02:43:57,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:43:57,648 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-23 02:43:57,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 62 [2022-11-23 02:43:57,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:43:57,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2022-11-23 02:43:57,710 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-23 02:43:57,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-11-23 02:43:59,947 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-23 02:43:59,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 69 [2022-11-23 02:44:00,009 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-23 02:44:00,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 100 [2022-11-23 02:44:00,478 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-23 02:44:00,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 226 treesize of output 153 [2022-11-23 02:44:00,531 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-23 02:44:00,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 184 treesize of output 154 [2022-11-23 02:44:01,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 107 [2022-11-23 02:44:03,375 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-23 02:44:03,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 38 [2022-11-23 02:44:03,383 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:44:03,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:44:03,472 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4802 (Array Int Int)) (v_ArrVal_4803 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4802))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1))))) is different from false [2022-11-23 02:44:05,861 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4802 (Array Int Int)) (v_ArrVal_4803 (Array Int Int))) (not (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4802))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_4800) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2)))))))))) is different from false [2022-11-23 02:44:05,885 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4802 (Array Int Int)) (v_ArrVal_4803 (Array Int Int))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4802))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_4800) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2))))))))))) is different from false [2022-11-23 02:44:05,925 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4802 (Array Int Int)) (v_ArrVal_4803 (Array Int Int))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_4802))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_4800) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_4803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2))))))))))) is different from false [2022-11-23 02:44:06,133 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56| Int) (v_ArrVal_4810 (Array Int Int)) (v_ArrVal_4811 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4802 (Array Int Int)) (v_ArrVal_4803 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56|) 0)) (not (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56| v_ArrVal_4810)) (.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56| v_ArrVal_4811))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse8 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse5 (select (select .cse6 .cse7) .cse8))) (let ((.cse1 (store (store .cse6 .cse5 (store (select .cse6 .cse5) (select (select .cse4 .cse7) .cse8) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56| v_ArrVal_4802))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store .cse4 .cse5 v_ArrVal_4800) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56| v_ArrVal_4803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2))))))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56| |c_#StackHeapBarrier|)))) is different from false [2022-11-23 02:44:06,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840724683] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:44:06,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:44:06,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 68 [2022-11-23 02:44:06,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398832634] [2022-11-23 02:44:06,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:44:06,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-23 02:44:06,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:44:06,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-23 02:44:06,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=4627, Unknown=152, NotChecked=710, Total=5700 [2022-11-23 02:44:06,141 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 68 states, 64 states have (on average 1.84375) internal successors, (118), 59 states have internal predecessors, (118), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:44:21,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:44:21,480 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2022-11-23 02:44:21,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-23 02:44:21,481 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 64 states have (on average 1.84375) internal successors, (118), 59 states have internal predecessors, (118), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 69 [2022-11-23 02:44:21,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:44:21,482 INFO L225 Difference]: With dead ends: 119 [2022-11-23 02:44:21,482 INFO L226 Difference]: Without dead ends: 119 [2022-11-23 02:44:21,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1788 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=683, Invalid=8482, Unknown=167, NotChecked=970, Total=10302 [2022-11-23 02:44:21,484 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 864 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 2502 mSolverCounterSat, 38 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2502 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-23 02:44:21,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 1462 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2502 Invalid, 40 Unknown, 0 Unchecked, 5.7s Time] [2022-11-23 02:44:21,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-23 02:44:21,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 99. [2022-11-23 02:44:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.2625) internal successors, (101), 94 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:44:21,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2022-11-23 02:44:21,490 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 69 [2022-11-23 02:44:21,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:44:21,490 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2022-11-23 02:44:21,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 64 states have (on average 1.84375) internal successors, (118), 59 states have internal predecessors, (118), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:44:21,491 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2022-11-23 02:44:21,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-23 02:44:21,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:44:21,492 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:44:21,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-23 02:44:21,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:44:21,695 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:44:21,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:44:21,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1590317415, now seen corresponding path program 2 times [2022-11-23 02:44:21,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:44:21,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715386616] [2022-11-23 02:44:21,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:44:21,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:44:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:44:27,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:44:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:44:28,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:44:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:44:28,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:44:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:44:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:44:30,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:44:30,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715386616] [2022-11-23 02:44:30,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715386616] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:44:30,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660828636] [2022-11-23 02:44:30,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:44:30,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:44:30,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:44:30,306 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:44:30,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-23 02:44:30,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:44:30,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:44:30,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 213 conjunts are in the unsatisfiable core [2022-11-23 02:44:30,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:44:30,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:44:30,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:44:31,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:44:31,669 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 02:44:31,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 02:44:32,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:44:32,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:44:32,943 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 02:44:32,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-23 02:44:33,021 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-23 02:44:33,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 02:44:33,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:44:33,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:44:34,377 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:44:34,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 50 [2022-11-23 02:44:34,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 02:44:35,544 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:44:35,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 38 [2022-11-23 02:44:35,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:44:35,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:44:36,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:44:37,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:44:37,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:44:37,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:44:37,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-23 02:44:37,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:44:37,297 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 02:44:37,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 65 [2022-11-23 02:44:37,334 INFO L321 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2022-11-23 02:44:37,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-11-23 02:44:37,412 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-23 02:44:37,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-23 02:44:41,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:44:41,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:44:41,861 INFO L321 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2022-11-23 02:44:41,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 185 treesize of output 102 [2022-11-23 02:44:41,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:44:41,957 INFO L321 Elim1Store]: treesize reduction 132, result has 18.5 percent of original size [2022-11-23 02:44:41,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 184 treesize of output 142 [2022-11-23 02:44:42,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-23 02:44:43,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:44:43,158 INFO L321 Elim1Store]: treesize reduction 120, result has 17.8 percent of original size [2022-11-23 02:44:43,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 564 treesize of output 184 [2022-11-23 02:44:43,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:44:43,335 INFO L321 Elim1Store]: treesize reduction 275, result has 11.6 percent of original size [2022-11-23 02:44:43,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 539 treesize of output 257 [2022-11-23 02:44:43,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:44:43,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 100 [2022-11-23 02:44:46,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:44:46,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:44:46,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:44:46,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 12 [2022-11-23 02:44:48,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:44:48,325 INFO L321 Elim1Store]: treesize reduction 158, result has 12.7 percent of original size [2022-11-23 02:44:48,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 14 new quantified variables, introduced 20 case distinctions, treesize of input 308 treesize of output 154 [2022-11-23 02:44:48,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:44:48,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:44:48,377 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-23 02:44:48,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 46 [2022-11-23 02:44:49,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:44:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:44:49,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:45:02,038 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:45:02,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 3539 treesize of output 3532 [2022-11-23 02:45:02,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:45:02,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38318 treesize of output 36587 [2022-11-23 02:45:02,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41788 treesize of output 34856 [2022-11-23 02:45:02,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1736 treesize of output 3 [2022-11-23 02:45:02,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:45:02,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8705 treesize of output 8707 [2022-11-23 02:46:58,150 WARN L233 SmtUtils]: Spent 30.61s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:46:58,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660828636] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:46:58,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:46:58,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 85 [2022-11-23 02:46:58,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231041879] [2022-11-23 02:46:58,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:46:58,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-11-23 02:46:58,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:46:58,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-11-23 02:46:58,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=10672, Unknown=16, NotChecked=0, Total=11130 [2022-11-23 02:46:58,156 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 85 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 75 states have internal predecessors, (126), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:47:37,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:47:37,908 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2022-11-23 02:47:37,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-23 02:47:37,909 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 75 states have internal predecessors, (126), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 70 [2022-11-23 02:47:37,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:47:37,909 INFO L225 Difference]: With dead ends: 117 [2022-11-23 02:47:37,909 INFO L226 Difference]: Without dead ends: 117 [2022-11-23 02:47:37,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4569 ImplicationChecksByTransitivity, 175.0s TimeCoverageRelationStatistics Valid=1229, Invalid=17657, Unknown=20, NotChecked=0, Total=18906 [2022-11-23 02:47:37,911 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 798 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 2953 mSolverCounterSat, 50 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 3006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2953 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-23 02:47:37,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1049 Invalid, 3006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2953 Invalid, 3 Unknown, 0 Unchecked, 7.9s Time] [2022-11-23 02:47:37,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-23 02:47:37,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2022-11-23 02:47:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.25) internal successors, (100), 94 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:47:37,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2022-11-23 02:47:37,915 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 70 [2022-11-23 02:47:37,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:47:37,915 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2022-11-23 02:47:37,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 75 states have internal predecessors, (126), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:47:37,916 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2022-11-23 02:47:37,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-23 02:47:37,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:47:37,917 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:47:37,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-23 02:47:38,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-23 02:47:38,124 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:47:38,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:47:38,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1692406426, now seen corresponding path program 3 times [2022-11-23 02:47:38,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:47:38,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862349214] [2022-11-23 02:47:38,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:47:38,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:47:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:47:42,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:47:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:47:43,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:47:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:47:43,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:47:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:47:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:47:44,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:47:44,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862349214] [2022-11-23 02:47:44,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862349214] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:47:44,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774507236] [2022-11-23 02:47:44,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 02:47:44,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:47:44,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:47:44,419 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:47:44,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-23 02:47:45,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-23 02:47:45,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:47:45,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 178 conjunts are in the unsatisfiable core [2022-11-23 02:47:45,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:47:45,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:47:46,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:47:47,398 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:47:47,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 02:47:47,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:47:47,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:47:48,620 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:47:48,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2022-11-23 02:47:48,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 02:47:49,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:47:49,594 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:47:49,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 36 [2022-11-23 02:47:49,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2022-11-23 02:47:49,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:47:49,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:47:51,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:47:51,077 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 02:47:51,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 75 [2022-11-23 02:47:51,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:47:51,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:47:51,098 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 02:47:51,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 85 [2022-11-23 02:47:51,170 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-23 02:47:51,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-11-23 02:47:54,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:47:54,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:47:55,021 INFO L321 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2022-11-23 02:47:55,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 171 treesize of output 96 [2022-11-23 02:47:55,117 INFO L321 Elim1Store]: treesize reduction 144, result has 13.3 percent of original size [2022-11-23 02:47:55,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 161 treesize of output 114 [2022-11-23 02:47:56,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:47:56,081 INFO L321 Elim1Store]: treesize reduction 108, result has 19.4 percent of original size [2022-11-23 02:47:56,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 109 [2022-11-23 02:47:56,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:47:56,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:47:56,119 INFO L321 Elim1Store]: treesize reduction 57, result has 10.9 percent of original size [2022-11-23 02:47:56,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 108 [2022-11-23 02:47:59,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:47:59,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-23 02:48:01,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:48:01,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:48:01,550 INFO L321 Elim1Store]: treesize reduction 235, result has 8.6 percent of original size [2022-11-23 02:48:01,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 14 new quantified variables, introduced 20 case distinctions, treesize of input 237 treesize of output 139 [2022-11-23 02:48:01,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:48:01,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:48:01,583 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 02:48:01,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 31 [2022-11-23 02:48:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:48:01,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:48:12,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14885 treesize of output 11423 [2022-11-23 02:48:28,301 WARN L233 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:48:28,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774507236] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:48:28,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:48:28,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 79 [2022-11-23 02:48:28,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711809022] [2022-11-23 02:48:28,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:48:28,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-23 02:48:28,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:48:28,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-23 02:48:28,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=8995, Unknown=1, NotChecked=0, Total=9312 [2022-11-23 02:48:28,305 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 79 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 70 states have internal predecessors, (134), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:48:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:48:48,978 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2022-11-23 02:48:48,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-23 02:48:48,978 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 70 states have internal predecessors, (134), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2022-11-23 02:48:48,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:48:48,979 INFO L225 Difference]: With dead ends: 107 [2022-11-23 02:48:48,979 INFO L226 Difference]: Without dead ends: 107 [2022-11-23 02:48:48,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3656 ImplicationChecksByTransitivity, 52.4s TimeCoverageRelationStatistics Valid=894, Invalid=15615, Unknown=3, NotChecked=0, Total=16512 [2022-11-23 02:48:48,980 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 757 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 3310 mSolverCounterSat, 25 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 3337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3310 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-23 02:48:48,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1397 Invalid, 3337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3310 Invalid, 2 Unknown, 0 Unchecked, 7.7s Time] [2022-11-23 02:48:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-23 02:48:48,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 89. [2022-11-23 02:48:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.178082191780822) internal successors, (86), 84 states have internal predecessors, (86), 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-23 02:48:48,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2022-11-23 02:48:48,982 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 74 [2022-11-23 02:48:48,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:48:48,983 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2022-11-23 02:48:48,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 70 states have internal predecessors, (134), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:48:48,983 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-11-23 02:48:48,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-23 02:48:48,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:48:48,984 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:48:48,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-23 02:48:49,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-23 02:48:49,187 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:48:49,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:48:49,188 INFO L85 PathProgramCache]: Analyzing trace with hash -924992669, now seen corresponding path program 2 times [2022-11-23 02:48:49,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:48:49,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603078485] [2022-11-23 02:48:49,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:48:49,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:48:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:49,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:48:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:49,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:48:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:49,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:48:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-23 02:48:49,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:48:49,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603078485] [2022-11-23 02:48:49,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603078485] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:48:49,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884622810] [2022-11-23 02:48:49,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:48:49,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:48:49,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:48:49,548 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:48:49,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-23 02:48:49,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:48:49,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:48:49,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-23 02:48:49,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:48:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-23 02:48:50,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:48:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-23 02:48:51,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884622810] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:48:51,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:48:51,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-11-23 02:48:51,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365045589] [2022-11-23 02:48:51,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:48:51,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 02:48:51,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:48:51,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 02:48:51,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-23 02:48:51,169 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 12 states have internal predecessors, (83), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-23 02:48:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:48:51,439 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-11-23 02:48:51,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 02:48:51,439 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 12 states have internal predecessors, (83), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2022-11-23 02:48:51,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:48:51,440 INFO L225 Difference]: With dead ends: 87 [2022-11-23 02:48:51,440 INFO L226 Difference]: Without dead ends: 87 [2022-11-23 02:48:51,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 148 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-23 02:48:51,440 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 77 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:48:51,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 492 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 02:48:51,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-23 02:48:51,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-11-23 02:48:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:48:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2022-11-23 02:48:51,443 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 75 [2022-11-23 02:48:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:48:51,444 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2022-11-23 02:48:51,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 12 states have internal predecessors, (83), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-23 02:48:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-11-23 02:48:51,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-23 02:48:51,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:48:51,445 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:48:51,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-23 02:48:51,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:48:51,652 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:48:51,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:48:51,653 INFO L85 PathProgramCache]: Analyzing trace with hash 54226440, now seen corresponding path program 1 times [2022-11-23 02:48:51,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:48:51,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642519805] [2022-11-23 02:48:51,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:48:51,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:48:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:52,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:48:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:52,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:48:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:52,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:48:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-23 02:48:52,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:48:52,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642519805] [2022-11-23 02:48:52,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642519805] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:48:52,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640979818] [2022-11-23 02:48:52,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:48:52,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:48:52,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:48:52,124 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:48:52,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-23 02:48:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:52,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-23 02:48:52,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:48:52,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-23 02:48:52,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-23 02:48:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-23 02:48:52,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:48:53,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:48:53,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-23 02:48:53,537 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-23 02:48:53,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640979818] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:48:53,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:48:53,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-11-23 02:48:53,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941337146] [2022-11-23 02:48:53,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:48:53,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 02:48:53,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:48:53,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 02:48:53,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-11-23 02:48:53,538 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 16 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:48:54,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:48:54,484 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-11-23 02:48:54,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 02:48:54,485 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 78 [2022-11-23 02:48:54,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:48:54,486 INFO L225 Difference]: With dead ends: 86 [2022-11-23 02:48:54,486 INFO L226 Difference]: Without dead ends: 86 [2022-11-23 02:48:54,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-11-23 02:48:54,486 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 110 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 02:48:54,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 404 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 02:48:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-23 02:48:54,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-23 02:48:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 81 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:48:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-11-23 02:48:54,489 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 78 [2022-11-23 02:48:54,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:48:54,490 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-11-23 02:48:54,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:48:54,490 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-11-23 02:48:54,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-23 02:48:54,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:48:54,491 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:48:54,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-23 02:48:54,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:48:54,698 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:48:54,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:48:54,698 INFO L85 PathProgramCache]: Analyzing trace with hash 54226439, now seen corresponding path program 1 times [2022-11-23 02:48:54,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:48:54,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968571462] [2022-11-23 02:48:54,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:48:54,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:48:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:54,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:48:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:54,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:48:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:54,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:48:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-23 02:48:54,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:48:54,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968571462] [2022-11-23 02:48:54,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968571462] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:48:54,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783191751] [2022-11-23 02:48:54,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:48:54,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:48:54,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:48:54,961 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:48:54,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-23 02:48:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:55,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-23 02:48:55,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:48:55,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-23 02:48:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-23 02:48:55,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:48:55,673 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-23 02:48:55,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-11-23 02:48:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-23 02:48:55,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783191751] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:48:55,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:48:55,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2022-11-23 02:48:55,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454683070] [2022-11-23 02:48:55,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:48:55,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 02:48:55,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:48:55,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 02:48:55,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-23 02:48:55,695 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:48:56,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:48:56,286 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2022-11-23 02:48:56,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 02:48:56,287 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 78 [2022-11-23 02:48:56,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:48:56,287 INFO L225 Difference]: With dead ends: 102 [2022-11-23 02:48:56,287 INFO L226 Difference]: Without dead ends: 102 [2022-11-23 02:48:56,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-23 02:48:56,288 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 62 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 02:48:56,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 312 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 02:48:56,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-23 02:48:56,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2022-11-23 02:48:56,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 84 states have internal predecessors, (89), 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-23 02:48:56,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2022-11-23 02:48:56,291 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 78 [2022-11-23 02:48:56,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:48:56,292 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2022-11-23 02:48:56,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:48:56,292 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2022-11-23 02:48:56,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-23 02:48:56,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:48:56,293 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:48:56,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-23 02:48:56,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:48:56,495 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:48:56,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:48:56,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1681053503, now seen corresponding path program 1 times [2022-11-23 02:48:56,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:48:56,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452296114] [2022-11-23 02:48:56,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:48:56,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:48:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:57,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:48:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:57,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:48:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:58,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:48:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-23 02:48:58,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:48:58,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452296114] [2022-11-23 02:48:58,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452296114] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:48:58,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770752809] [2022-11-23 02:48:58,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:48:58,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:48:58,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:48:58,487 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:48:58,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-23 02:48:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:58,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-23 02:48:58,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:48:59,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:48:59,212 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_5953 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5953))))) is different from true [2022-11-23 02:48:59,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:48:59,313 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_5954 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5954))))) is different from true [2022-11-23 02:48:59,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:48:59,456 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_5955 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5955))))) is different from true [2022-11-23 02:48:59,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:48:59,925 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 02:48:59,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 02:49:00,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-23 02:49:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 18 not checked. [2022-11-23 02:49:00,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:49:00,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 02:49:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-23 02:49:02,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770752809] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 02:49:02,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:49:02,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [24, 12] total 37 [2022-11-23 02:49:02,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866180166] [2022-11-23 02:49:02,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:49:02,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 02:49:02,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:49:02,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 02:49:02,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1017, Unknown=3, NotChecked=198, Total=1332 [2022-11-23 02:49:02,475 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:49:03,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:49:03,129 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2022-11-23 02:49:03,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 02:49:03,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 79 [2022-11-23 02:49:03,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:49:03,130 INFO L225 Difference]: With dead ends: 89 [2022-11-23 02:49:03,130 INFO L226 Difference]: Without dead ends: 89 [2022-11-23 02:49:03,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 142 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=165, Invalid=1404, Unknown=3, NotChecked=234, Total=1806 [2022-11-23 02:49:03,131 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 169 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:49:03,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 133 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 02:49:03,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-23 02:49:03,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-23 02:49:03,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:49:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2022-11-23 02:49:03,134 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 79 [2022-11-23 02:49:03,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:49:03,135 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2022-11-23 02:49:03,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:49:03,135 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-11-23 02:49:03,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-23 02:49:03,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:49:03,136 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:49:03,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-23 02:49:03,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-23 02:49:03,343 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:49:03,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:49:03,343 INFO L85 PathProgramCache]: Analyzing trace with hash 552239499, now seen corresponding path program 1 times [2022-11-23 02:49:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:49:03,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873544261] [2022-11-23 02:49:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:49:03,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:49:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:04,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:49:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:04,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:49:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:04,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:49:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-23 02:49:04,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:49:04,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873544261] [2022-11-23 02:49:04,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873544261] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:49:04,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254497996] [2022-11-23 02:49:04,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:49:04,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:49:04,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:49:04,046 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:49:04,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-23 02:49:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:04,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-23 02:49:04,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:49:05,161 INFO L321 Elim1Store]: treesize reduction 12, result has 85.9 percent of original size [2022-11-23 02:49:05,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 122 [2022-11-23 02:49:05,392 INFO L321 Elim1Store]: treesize reduction 12, result has 83.6 percent of original size [2022-11-23 02:49:05,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 126 [2022-11-23 02:49:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-23 02:49:09,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:49:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-23 02:49:10,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254497996] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 02:49:10,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:49:10,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13, 12] total 20 [2022-11-23 02:49:10,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726656149] [2022-11-23 02:49:10,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:49:10,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 02:49:10,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:49:10,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 02:49:10,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-11-23 02:49:10,113 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:49:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:49:11,080 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-11-23 02:49:11,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 02:49:11,081 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 81 [2022-11-23 02:49:11,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:49:11,082 INFO L225 Difference]: With dead ends: 86 [2022-11-23 02:49:11,082 INFO L226 Difference]: Without dead ends: 86 [2022-11-23 02:49:11,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2022-11-23 02:49:11,082 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 231 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 02:49:11,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 320 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 02:49:11,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-23 02:49:11,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-23 02:49:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 81 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:49:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2022-11-23 02:49:11,085 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 81 [2022-11-23 02:49:11,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:49:11,085 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2022-11-23 02:49:11,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:49:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2022-11-23 02:49:11,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-23 02:49:11,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:49:11,087 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:49:11,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-23 02:49:11,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:49:11,295 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:49:11,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:49:11,296 INFO L85 PathProgramCache]: Analyzing trace with hash 552239549, now seen corresponding path program 1 times [2022-11-23 02:49:11,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:49:11,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866561031] [2022-11-23 02:49:11,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:49:11,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:49:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:11,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:49:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:11,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:49:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:11,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:49:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-23 02:49:11,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:49:11,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866561031] [2022-11-23 02:49:11,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866561031] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:49:11,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747496709] [2022-11-23 02:49:11,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:49:11,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:49:11,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:49:11,807 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:49:11,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-23 02:49:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:12,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-23 02:49:12,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:49:12,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-11-23 02:49:12,569 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:49:12,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-23 02:49:12,583 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-23 02:49:12,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:49:12,686 INFO L321 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-11-23 02:49:12,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-11-23 02:49:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-23 02:49:12,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747496709] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:49:12,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:49:12,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 16 [2022-11-23 02:49:12,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371429677] [2022-11-23 02:49:12,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:49:12,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 02:49:12,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:49:12,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 02:49:12,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-11-23 02:49:12,835 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 17 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:49:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:49:14,095 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-11-23 02:49:14,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 02:49:14,095 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 81 [2022-11-23 02:49:14,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:49:14,096 INFO L225 Difference]: With dead ends: 93 [2022-11-23 02:49:14,096 INFO L226 Difference]: Without dead ends: 93 [2022-11-23 02:49:14,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2022-11-23 02:49:14,096 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 73 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:49:14,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 544 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 02:49:14,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-23 02:49:14,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2022-11-23 02:49:14,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 81 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:49:14,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-11-23 02:49:14,098 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 81 [2022-11-23 02:49:14,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:49:14,098 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-11-23 02:49:14,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:49:14,099 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-11-23 02:49:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-23 02:49:14,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:49:14,099 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:49:14,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-23 02:49:14,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-23 02:49:14,303 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:49:14,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:49:14,304 INFO L85 PathProgramCache]: Analyzing trace with hash 552239550, now seen corresponding path program 1 times [2022-11-23 02:49:14,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:49:14,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276798389] [2022-11-23 02:49:14,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:49:14,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:49:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:15,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:49:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:15,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:49:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:49:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-23 02:49:15,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:49:15,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276798389] [2022-11-23 02:49:15,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276798389] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:49:15,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680002867] [2022-11-23 02:49:15,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:49:15,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:49:15,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:49:15,059 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:49:15,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-23 02:49:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:15,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-23 02:49:15,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:49:16,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:49:16,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 60 [2022-11-23 02:49:16,077 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:49:16,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2022-11-23 02:49:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-23 02:49:16,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:49:16,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:49:16,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2022-11-23 02:49:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-23 02:49:17,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680002867] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:49:17,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:49:17,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2022-11-23 02:49:17,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735674531] [2022-11-23 02:49:17,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:49:17,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 02:49:17,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:49:17,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 02:49:17,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2022-11-23 02:49:17,360 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 26 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:49:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:49:19,500 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-11-23 02:49:19,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 02:49:19,500 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 81 [2022-11-23 02:49:19,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:49:19,501 INFO L225 Difference]: With dead ends: 92 [2022-11-23 02:49:19,501 INFO L226 Difference]: Without dead ends: 92 [2022-11-23 02:49:19,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=149, Invalid=907, Unknown=0, NotChecked=0, Total=1056 [2022-11-23 02:49:19,502 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 231 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-23 02:49:19,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 546 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-23 02:49:19,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-23 02:49:19,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2022-11-23 02:49:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 81 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:49:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2022-11-23 02:49:19,505 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 81 [2022-11-23 02:49:19,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:49:19,506 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2022-11-23 02:49:19,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 02:49:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2022-11-23 02:49:19,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-23 02:49:19,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:49:19,507 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:49:19,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-23 02:49:19,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:49:19,711 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:49:19,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:49:19,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1873734531, now seen corresponding path program 1 times [2022-11-23 02:49:19,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:49:19,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246387952] [2022-11-23 02:49:19,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:49:19,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:49:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:23,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:49:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:24,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:49:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:24,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:49:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:25,761 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-23 02:49:25,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:49:25,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246387952] [2022-11-23 02:49:25,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246387952] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:49:25,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485806321] [2022-11-23 02:49:25,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:49:25,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:49:25,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:49:25,762 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:49:25,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-23 02:49:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:26,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 157 conjunts are in the unsatisfiable core [2022-11-23 02:49:26,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:49:26,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:49:26,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:49:27,053 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 02:49:27,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 02:49:27,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:49:27,965 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-23 02:49:27,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 02:49:28,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:49:28,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:49:29,106 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:49:29,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-11-23 02:49:29,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 02:49:29,970 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:49:29,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 28 [2022-11-23 02:49:29,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:49:31,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:49:31,319 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 02:49:31,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 51 [2022-11-23 02:49:31,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:49:31,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:49:31,378 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-23 02:49:31,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2022-11-23 02:49:31,420 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 02:49:31,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 02:49:33,989 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-23 02:49:33,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 82 [2022-11-23 02:49:34,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:49:34,068 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-23 02:49:34,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 43 [2022-11-23 02:49:34,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:49:34,561 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 02:49:34,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 63 [2022-11-23 02:49:34,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:49:34,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:49:34,633 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-23 02:49:34,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 57 [2022-11-23 02:49:36,557 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-23 02:49:36,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 42 [2022-11-23 02:49:37,212 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 02:49:37,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-23 02:49:37,466 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-23 02:49:37,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:49:38,434 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6693 (Array Int Int)) (v_ArrVal_6692 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_6693))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_6692) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1) 0) (not (<= 0 .cse1)))))) is different from false [2022-11-23 02:49:39,100 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6693 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_6690 (Array Int Int)) (v_ArrVal_6692 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_6693))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_6690) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_6692) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1) 0) (not (<= 0 .cse1)))))) is different from false [2022-11-23 02:49:39,133 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6693 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_53| Int) (v_ArrVal_6690 (Array Int Int)) (v_ArrVal_6692 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_53| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_6693))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (= (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6690) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_6692) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0) 0)))))) is different from false [2022-11-23 02:49:39,195 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6693 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_53| Int) (v_ArrVal_6690 (Array Int Int)) (v_ArrVal_6692 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_53| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_6693))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6690) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_6692) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2) 0) (not (<= 0 .cse2))))))) is different from false [2022-11-23 02:49:39,880 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6693 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_53| Int) (v_ArrVal_6690 (Array Int Int)) (v_ArrVal_6692 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_53| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_6693))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6690) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_6692) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2) 0) (not (<= 0 .cse2))))))) is different from false [2022-11-23 02:49:40,135 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6693 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_53| Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_76| Int) (v_ArrVal_6700 (Array Int Int)) (v_ArrVal_6701 (Array Int Int)) (v_ArrVal_6690 (Array Int Int)) (v_ArrVal_6692 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_76| v_ArrVal_6701)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_76| v_ArrVal_6700))) (let ((.cse3 (select (select .cse2 (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_53| 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_76| v_ArrVal_6693))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_76| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_76|) 0)) (= (select (select .cse1 (select (select (store (store .cse2 .cse3 v_ArrVal_6690) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_76| v_ArrVal_6692) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0) 0))))))) is different from false [2022-11-23 02:49:40,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485806321] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:49:40,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:49:40,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 33] total 69 [2022-11-23 02:49:40,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449506264] [2022-11-23 02:49:40,139 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:49:40,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-23 02:49:40,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:49:40,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-23 02:49:40,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=5270, Unknown=65, NotChecked=906, Total=6480 [2022-11-23 02:49:40,141 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 70 states, 65 states have (on average 2.0) internal successors, (130), 61 states have internal predecessors, (130), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:49:59,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:49:59,083 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2022-11-23 02:49:59,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-23 02:49:59,083 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 65 states have (on average 2.0) internal successors, (130), 61 states have internal predecessors, (130), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 83 [2022-11-23 02:49:59,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:49:59,084 INFO L225 Difference]: With dead ends: 90 [2022-11-23 02:49:59,084 INFO L226 Difference]: Without dead ends: 90 [2022-11-23 02:49:59,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=767, Invalid=9289, Unknown=68, NotChecked=1218, Total=11342 [2022-11-23 02:49:59,085 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 804 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 2433 mSolverCounterSat, 54 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 2491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2433 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-23 02:49:59,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 767 Invalid, 2491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2433 Invalid, 4 Unknown, 0 Unchecked, 5.8s Time] [2022-11-23 02:49:59,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-23 02:49:59,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2022-11-23 02:49:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:49:59,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2022-11-23 02:49:59,088 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2022-11-23 02:49:59,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:49:59,088 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2022-11-23 02:49:59,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 65 states have (on average 2.0) internal successors, (130), 61 states have internal predecessors, (130), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:49:59,088 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-11-23 02:49:59,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-23 02:49:59,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:49:59,089 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:49:59,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-23 02:49:59,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:49:59,297 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 02:49:59,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:49:59,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2043771859, now seen corresponding path program 1 times [2022-11-23 02:49:59,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:49:59,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057608852] [2022-11-23 02:49:59,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:49:59,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:49:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:50:03,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:50:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:50:03,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:50:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:50:04,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 02:50:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:50:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-23 02:50:04,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:50:04,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057608852] [2022-11-23 02:50:04,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057608852] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:50:04,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838735766] [2022-11-23 02:50:04,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:50:04,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:50:04,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:50:04,947 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:50:04,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_566960ca-2032-4eda-b37d-a1cf514d4e62/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-23 02:50:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:50:05,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 137 conjunts are in the unsatisfiable core [2022-11-23 02:50:05,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:50:05,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:50:06,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:50:06,816 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:50:06,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 02:50:07,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:50:07,908 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:50:07,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-23 02:50:08,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:50:08,726 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:50:08,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 22 [2022-11-23 02:50:08,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:50:10,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:50:10,100 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 02:50:10,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 51 [2022-11-23 02:50:10,129 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 02:50:10,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 02:50:10,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:50:10,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2022-11-23 02:50:12,735 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-23 02:50:12,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 82 [2022-11-23 02:50:12,771 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-23 02:50:12,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 61 [2022-11-23 02:50:13,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:50:13,255 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 02:50:13,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 63 [2022-11-23 02:50:13,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:50:13,303 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 02:50:13,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 81 [2022-11-23 02:50:15,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 39 [2022-11-23 02:50:15,893 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:50:15,909 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:50:15,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 20 [2022-11-23 02:50:16,361 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 02:50:16,361 INFO L328 TraceCheckSpWp]: Computing backward predicates...