./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN --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 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- 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-6b4ec56 [2022-11-20 11:17:10,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:17:10,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:17:10,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:17:10,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:17:10,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:17:10,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:17:10,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:17:10,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:17:10,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:17:10,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:17:10,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:17:10,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:17:10,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:17:10,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:17:10,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:17:10,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:17:10,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:17:10,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:17:10,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:17:10,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:17:10,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:17:10,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:17:10,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:17:10,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:17:10,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:17:10,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:17:10,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:17:10,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:17:10,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:17:10,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:17:10,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:17:10,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:17:10,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:17:10,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:17:10,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:17:10,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:17:10,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:17:10,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:17:10,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:17:10,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:17:10,409 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 11:17:10,451 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:17:10,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:17:10,452 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:17:10,452 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:17:10,453 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:17:10,453 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:17:10,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:17:10,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:17:10,454 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:17:10,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:17:10,455 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:17:10,456 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:17:10,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:17:10,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:17:10,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:17:10,456 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 11:17:10,457 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 11:17:10,457 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 11:17:10,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:17:10,457 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 11:17:10,457 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:17:10,458 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:17:10,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:17:10,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:17:10,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:17:10,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:17:10,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:17:10,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:17:10,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:17:10,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:17:10,459 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/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_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN 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 -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2022-11-20 11:17:10,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:17:10,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:17:10,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:17:10,738 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:17:10,740 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:17:10,742 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-11-20 11:17:13,990 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:17:14,261 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:17:14,262 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-11-20 11:17:14,275 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/data/822bd02aa/0763f8c9b07f45d886bdb559a7b11ad5/FLAG94c6a4389 [2022-11-20 11:17:14,293 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/data/822bd02aa/0763f8c9b07f45d886bdb559a7b11ad5 [2022-11-20 11:17:14,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:17:14,298 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:17:14,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:17:14,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:17:14,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:17:14,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:17:14" (1/1) ... [2022-11-20 11:17:14,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@708c570a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:14, skipping insertion in model container [2022-11-20 11:17:14,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:17:14" (1/1) ... [2022-11-20 11:17:14,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:17:14,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:17:14,714 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_b1fe708b-c871-4242-9302-aaf0b6f443d1/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2022-11-20 11:17:14,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:17:14,738 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:17:14,802 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_b1fe708b-c871-4242-9302-aaf0b6f443d1/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2022-11-20 11:17:14,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:17:14,831 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:17:14,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:14 WrapperNode [2022-11-20 11:17:14,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:17:14,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:17:14,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:17:14,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:17:14,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:14" (1/1) ... [2022-11-20 11:17:14,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:14" (1/1) ... [2022-11-20 11:17:14,896 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 125 [2022-11-20 11:17:14,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:17:14,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:17:14,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:17:14,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:17:14,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:14" (1/1) ... [2022-11-20 11:17:14,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:14" (1/1) ... [2022-11-20 11:17:14,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:14" (1/1) ... [2022-11-20 11:17:14,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:14" (1/1) ... [2022-11-20 11:17:14,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:14" (1/1) ... [2022-11-20 11:17:14,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:14" (1/1) ... [2022-11-20 11:17:14,930 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:14" (1/1) ... [2022-11-20 11:17:14,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:14" (1/1) ... [2022-11-20 11:17:14,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:17:14,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:17:14,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:17:14,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:17:14,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:14" (1/1) ... [2022-11-20 11:17:14,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:17:14,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:17:14,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:17:14,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:17:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:17:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:17:15,016 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-20 11:17:15,016 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-20 11:17:15,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:17:15,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:17:15,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:17:15,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 11:17:15,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 11:17:15,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:17:15,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 11:17:15,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:17:15,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:17:15,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:17:15,184 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:17:15,188 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:17:15,737 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:17:15,748 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:17:15,754 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-20 11:17:15,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:17:15 BoogieIcfgContainer [2022-11-20 11:17:15,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:17:15,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:17:15,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:17:15,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:17:15,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:17:14" (1/3) ... [2022-11-20 11:17:15,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4edb8212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:17:15, skipping insertion in model container [2022-11-20 11:17:15,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:14" (2/3) ... [2022-11-20 11:17:15,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4edb8212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:17:15, skipping insertion in model container [2022-11-20 11:17:15,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:17:15" (3/3) ... [2022-11-20 11:17:15,772 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2022-11-20 11:17:15,795 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:17:15,796 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-11-20 11:17:15,875 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:17:15,884 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@53bd6758, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:17:15,884 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-11-20 11:17:15,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 52 states have (on average 2.0384615384615383) internal successors, (106), 93 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 11:17:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 11:17:15,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:15,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:17:15,899 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:15,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:15,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1815348631, now seen corresponding path program 1 times [2022-11-20 11:17:15,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:15,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236557729] [2022-11-20 11:17:15,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:15,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:16,164 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-20 11:17:16,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:16,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236557729] [2022-11-20 11:17:16,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236557729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:17:16,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:17:16,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:17:16,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130196842] [2022-11-20 11:17:16,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:17:16,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:17:16,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:16,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:17:16,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:17:16,208 INFO L87 Difference]: Start difference. First operand has 97 states, 52 states have (on average 2.0384615384615383) internal successors, (106), 93 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:17:16,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:16,391 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-11-20 11:17:16,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:17:16,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 11:17:16,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:16,402 INFO L225 Difference]: With dead ends: 94 [2022-11-20 11:17:16,402 INFO L226 Difference]: Without dead ends: 91 [2022-11-20 11:17:16,404 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-20 11:17:16,408 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 10 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:16,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:17:16,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-20 11:17:16,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-20 11:17:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 50 states have (on average 1.88) internal successors, (94), 87 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 11:17:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2022-11-20 11:17:16,454 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 7 [2022-11-20 11:17:16,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:16,455 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2022-11-20 11:17:16,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:17:16,456 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-11-20 11:17:16,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 11:17:16,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:16,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:17:16,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:17:16,457 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:16,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:16,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1815348632, now seen corresponding path program 1 times [2022-11-20 11:17:16,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:16,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343909524] [2022-11-20 11:17:16,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:16,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:16,645 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-20 11:17:16,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:16,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343909524] [2022-11-20 11:17:16,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343909524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:17:16,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:17:16,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:17:16,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172119249] [2022-11-20 11:17:16,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:17:16,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:17:16,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:16,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:17:16,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:17:16,650 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:17:16,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:16,738 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-11-20 11:17:16,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:17:16,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 11:17:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:16,741 INFO L225 Difference]: With dead ends: 88 [2022-11-20 11:17:16,741 INFO L226 Difference]: Without dead ends: 88 [2022-11-20 11:17:16,741 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-20 11:17:16,743 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:16,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 144 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:17:16,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-20 11:17:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-20 11:17:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.82) internal successors, (91), 84 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 11:17:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-11-20 11:17:16,752 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 7 [2022-11-20 11:17:16,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:16,752 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-11-20 11:17:16,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:17:16,753 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-11-20 11:17:16,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:17:16,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:16,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:17:16,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:17:16,754 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:16,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:16,755 INFO L85 PathProgramCache]: Analyzing trace with hash 927333361, now seen corresponding path program 1 times [2022-11-20 11:17:16,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:16,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110916402] [2022-11-20 11:17:16,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:16,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:17,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:17:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:17,217 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-20 11:17:17,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:17,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110916402] [2022-11-20 11:17:17,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110916402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:17:17,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:17:17,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:17:17,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815767057] [2022-11-20 11:17:17,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:17:17,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:17:17,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:17,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:17:17,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:17:17,224 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-20 11:17:17,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:17,517 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-11-20 11:17:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:17:17,518 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 14 [2022-11-20 11:17:17,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:17,520 INFO L225 Difference]: With dead ends: 91 [2022-11-20 11:17:17,521 INFO L226 Difference]: Without dead ends: 91 [2022-11-20 11:17:17,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-20 11:17:17,522 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 22 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:17,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 364 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:17:17,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-20 11:17:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2022-11-20 11:17:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 50 states have (on average 1.78) internal successors, (89), 82 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 11:17:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-11-20 11:17:17,532 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 14 [2022-11-20 11:17:17,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:17,533 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-11-20 11:17:17,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-20 11:17:17,534 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-11-20 11:17:17,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:17:17,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:17,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:17:17,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:17:17,535 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:17,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:17,536 INFO L85 PathProgramCache]: Analyzing trace with hash 927333360, now seen corresponding path program 1 times [2022-11-20 11:17:17,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:17,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233242819] [2022-11-20 11:17:17,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:17,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:17,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:17:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:17,701 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-20 11:17:17,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:17,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233242819] [2022-11-20 11:17:17,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233242819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:17:17,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:17:17,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:17:17,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495053359] [2022-11-20 11:17:17,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:17:17,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:17:17,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:17,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:17:17,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:17:17,707 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-20 11:17:17,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:17,978 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2022-11-20 11:17:17,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:17:17,979 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 14 [2022-11-20 11:17:17,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:17,980 INFO L225 Difference]: With dead ends: 89 [2022-11-20 11:17:17,980 INFO L226 Difference]: Without dead ends: 89 [2022-11-20 11:17:17,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:17:17,981 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 15 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:17,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 316 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:17:17,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-20 11:17:17,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2022-11-20 11:17:17,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.74) internal successors, (87), 80 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 11:17:17,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-11-20 11:17:17,989 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 14 [2022-11-20 11:17:17,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:17,990 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-11-20 11:17:17,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-20 11:17:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-11-20 11:17:17,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:17:17,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:17,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:17:17,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:17:17,991 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:17,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:17,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1763306156, now seen corresponding path program 1 times [2022-11-20 11:17:17,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:17,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175340085] [2022-11-20 11:17:17,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:17,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:18,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 11:17:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:18,064 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-20 11:17:18,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:18,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175340085] [2022-11-20 11:17:18,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175340085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:17:18,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:17:18,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:17:18,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864711712] [2022-11-20 11:17:18,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:17:18,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:17:18,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:18,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:17:18,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:17:18,067 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-20 11:17:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:18,168 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-11-20 11:17:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:17:18,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2022-11-20 11:17:18,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:18,170 INFO L225 Difference]: With dead ends: 94 [2022-11-20 11:17:18,170 INFO L226 Difference]: Without dead ends: 94 [2022-11-20 11:17:18,170 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-20 11:17:18,171 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 9 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:18,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 211 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:17:18,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-20 11:17:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2022-11-20 11:17:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 11:17:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2022-11-20 11:17:18,178 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2022-11-20 11:17:18,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:18,178 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2022-11-20 11:17:18,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-20 11:17:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-11-20 11:17:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 11:17:18,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:18,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:17:18,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:17:18,180 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:18,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:18,181 INFO L85 PathProgramCache]: Analyzing trace with hash 958467140, now seen corresponding path program 1 times [2022-11-20 11:17:18,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:18,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974529294] [2022-11-20 11:17:18,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:18,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:18,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:17:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:18,256 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-20 11:17:18,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:18,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974529294] [2022-11-20 11:17:18,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974529294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:17:18,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:17:18,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:17:18,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290634662] [2022-11-20 11:17:18,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:17:18,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:17:18,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:18,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:17:18,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:17:18,259 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-20 11:17:18,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:18,354 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-11-20 11:17:18,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:17:18,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2022-11-20 11:17:18,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:18,356 INFO L225 Difference]: With dead ends: 91 [2022-11-20 11:17:18,356 INFO L226 Difference]: Without dead ends: 91 [2022-11-20 11:17:18,356 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-20 11:17:18,357 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:18,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 207 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:17:18,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-20 11:17:18,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2022-11-20 11:17:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.6727272727272726) 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-20 11:17:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2022-11-20 11:17:18,363 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 17 [2022-11-20 11:17:18,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:18,364 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2022-11-20 11:17:18,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-20 11:17:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2022-11-20 11:17:18,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 11:17:18,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:18,365 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:17:18,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:17:18,365 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:18,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:18,366 INFO L85 PathProgramCache]: Analyzing trace with hash 239866037, now seen corresponding path program 1 times [2022-11-20 11:17:18,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:18,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224908998] [2022-11-20 11:17:18,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:18,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:18,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:17:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:18,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 11:17:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 11:17:18,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:18,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224908998] [2022-11-20 11:17:18,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224908998] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:17:18,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957480180] [2022-11-20 11:17:18,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:18,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:17:18,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:17:18,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:17:18,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:17:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:18,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:17:18,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:17:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:17:18,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:17:18,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 11:17:18,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957480180] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:17:18,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:17:18,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-20 11:17:18,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304964614] [2022-11-20 11:17:18,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:17:18,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:17:18,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:18,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:17:18,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:17:18,784 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 11:17:18,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:18,888 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-11-20 11:17:18,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:17:18,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-11-20 11:17:18,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:18,891 INFO L225 Difference]: With dead ends: 92 [2022-11-20 11:17:18,891 INFO L226 Difference]: Without dead ends: 92 [2022-11-20 11:17:18,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:17:18,893 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 14 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:18,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 218 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:17:18,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-20 11:17:18,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-20 11:17:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 87 states have internal predecessors, (94), 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-20 11:17:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-11-20 11:17:18,910 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 31 [2022-11-20 11:17:18,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:18,911 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-11-20 11:17:18,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 11:17:18,911 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-11-20 11:17:18,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 11:17:18,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:18,913 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 11:17:18,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:17:19,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:17:19,120 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:19,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:19,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1367704317, now seen corresponding path program 1 times [2022-11-20 11:17:19,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:19,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511935951] [2022-11-20 11:17:19,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:19,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:19,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:17:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:19,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:17:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:17:19,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:19,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511935951] [2022-11-20 11:17:19,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511935951] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:17:19,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071703331] [2022-11-20 11:17:19,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:19,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:17:19,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:17:19,623 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:17:19,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:17:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:19,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 11:17:19,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:17:19,823 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-20 11:17:19,900 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_510 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-20 11:17:19,980 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:17:19,980 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-20 11:17:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-20 11:17:19,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:17:20,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071703331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:17:20,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:17:20,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-11-20 11:17:20,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78782029] [2022-11-20 11:17:20,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:17:20,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 11:17:20,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:20,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 11:17:20,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2022-11-20 11:17:20,055 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 11:17:20,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:20,445 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-11-20 11:17:20,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:17:20,445 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-11-20 11:17:20,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:20,446 INFO L225 Difference]: With dead ends: 103 [2022-11-20 11:17:20,446 INFO L226 Difference]: Without dead ends: 103 [2022-11-20 11:17:20,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=191, Unknown=1, NotChecked=28, Total=272 [2022-11-20 11:17:20,447 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 146 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:20,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 275 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 359 Invalid, 0 Unknown, 91 Unchecked, 0.3s Time] [2022-11-20 11:17:20,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-20 11:17:20,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2022-11-20 11:17:20,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.631578947368421) internal successors, (93), 86 states have internal predecessors, (93), 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-20 11:17:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-11-20 11:17:20,452 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 32 [2022-11-20 11:17:20,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:20,453 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-11-20 11:17:20,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 11:17:20,453 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-11-20 11:17:20,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 11:17:20,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:20,454 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 11:17:20,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:17:20,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 11:17:20,682 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:20,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:20,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1367704316, now seen corresponding path program 1 times [2022-11-20 11:17:20,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:20,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106814412] [2022-11-20 11:17:20,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:20,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:21,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:17:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:21,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:17:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:17:21,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:21,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106814412] [2022-11-20 11:17:21,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106814412] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:17:21,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124858212] [2022-11-20 11:17:21,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:21,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:17:21,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:17:21,486 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:17:21,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:17:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:21,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-20 11:17:21,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:17:21,674 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-20 11:17:22,049 INFO L321 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-11-20 11:17:22,050 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 14 treesize of output 13 [2022-11-20 11:17:22,066 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:17:22,066 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-20 11:17:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:17:22,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:17:24,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124858212] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:17:24,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:17:24,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2022-11-20 11:17:24,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660397058] [2022-11-20 11:17:24,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:17:24,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 11:17:24,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:24,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 11:17:24,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-11-20 11:17:24,321 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 11:17:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:25,103 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-11-20 11:17:25,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:17:25,103 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-11-20 11:17:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:25,104 INFO L225 Difference]: With dead ends: 91 [2022-11-20 11:17:25,104 INFO L226 Difference]: Without dead ends: 91 [2022-11-20 11:17:25,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2022-11-20 11:17:25,105 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 92 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:25,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 515 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 11:17:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-20 11:17:25,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2022-11-20 11:17:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.6140350877192982) 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-20 11:17:25,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2022-11-20 11:17:25,110 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 32 [2022-11-20 11:17:25,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:25,110 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2022-11-20 11:17:25,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 11:17:25,111 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2022-11-20 11:17:25,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 11:17:25,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:25,112 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:17:25,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:17:25,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:17:25,318 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:25,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:25,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1122646220, now seen corresponding path program 2 times [2022-11-20 11:17:25,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:25,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390739657] [2022-11-20 11:17:25,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:25,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:25,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:17:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:25,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:17:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:25,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 11:17:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 11:17:25,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:25,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390739657] [2022-11-20 11:17:25,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390739657] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:17:25,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287671011] [2022-11-20 11:17:25,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:17:25,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:17:25,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:17:25,502 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:17:25,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:17:25,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:17:25,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:17:25,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 11:17:25,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:17:25,742 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-20 11:17:25,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:17:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 11:17:25,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287671011] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:17:25,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:17:25,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2022-11-20 11:17:25,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822318633] [2022-11-20 11:17:25,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:17:25,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:17:25,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:25,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:17:25,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:17:25,801 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 11:17:26,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:26,021 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2022-11-20 11:17:26,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:17:26,022 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2022-11-20 11:17:26,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:26,023 INFO L225 Difference]: With dead ends: 90 [2022-11-20 11:17:26,023 INFO L226 Difference]: Without dead ends: 90 [2022-11-20 11:17:26,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:17:26,024 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 144 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:26,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 355 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:17:26,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-20 11:17:26,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-20 11:17:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 85 states have internal predecessors, (91), 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-20 11:17:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2022-11-20 11:17:26,028 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 46 [2022-11-20 11:17:26,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:26,029 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2022-11-20 11:17:26,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 11:17:26,029 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2022-11-20 11:17:26,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-20 11:17:26,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:26,030 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] [2022-11-20 11:17:26,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:17:26,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 11:17:26,231 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:26,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:26,232 INFO L85 PathProgramCache]: Analyzing trace with hash 186649324, now seen corresponding path program 1 times [2022-11-20 11:17:26,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:26,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885174316] [2022-11-20 11:17:26,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:26,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:26,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:17:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:26,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:17:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:26,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:17:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:17:26,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:26,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885174316] [2022-11-20 11:17:26,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885174316] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:17:26,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651586759] [2022-11-20 11:17:26,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:26,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:17:26,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:17:26,790 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:17:26,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:17:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:27,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-20 11:17:27,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:17:27,017 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-20 11:17:27,044 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-20 11:17:27,066 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1168 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1168)))) is different from true [2022-11-20 11:17:27,093 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1168 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1168)))) is different from true [2022-11-20 11:17:27,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:17:27,115 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-20 11:17:27,240 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-20 11:17:27,280 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:17:27,280 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-20 11:17:27,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:17:27,503 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-20 11:17:27,503 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 17 treesize of output 22 [2022-11-20 11:17:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 14 not checked. [2022-11-20 11:17:27,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:17:27,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651586759] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:17:27,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:17:27,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2022-11-20 11:17:27,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033587631] [2022-11-20 11:17:27,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:17:27,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 11:17:27,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:27,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 11:17:27,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=280, Unknown=3, NotChecked=108, Total=462 [2022-11-20 11:17:27,782 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 11:17:28,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:28,235 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2022-11-20 11:17:28,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 11:17:28,236 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 47 [2022-11-20 11:17:28,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:28,237 INFO L225 Difference]: With dead ends: 90 [2022-11-20 11:17:28,237 INFO L226 Difference]: Without dead ends: 90 [2022-11-20 11:17:28,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=533, Unknown=3, NotChecked=150, Total=812 [2022-11-20 11:17:28,238 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 13 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:28,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 459 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 241 Invalid, 0 Unknown, 346 Unchecked, 0.2s Time] [2022-11-20 11:17:28,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-20 11:17:28,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-11-20 11:17:28,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.5789473684210527) 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-20 11:17:28,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2022-11-20 11:17:28,243 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 47 [2022-11-20 11:17:28,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:28,243 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2022-11-20 11:17:28,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 11:17:28,244 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2022-11-20 11:17:28,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-20 11:17:28,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:28,245 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] [2022-11-20 11:17:28,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:17:28,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 11:17:28,451 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:28,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash 186649325, now seen corresponding path program 1 times [2022-11-20 11:17:28,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:28,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410590934] [2022-11-20 11:17:28,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:28,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:28,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:17:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:29,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:17:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:29,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:17:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-20 11:17:29,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:29,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410590934] [2022-11-20 11:17:29,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410590934] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:17:29,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027584161] [2022-11-20 11:17:29,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:29,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:17:29,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:17:29,190 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:17:29,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 11:17:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:29,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 11:17:29,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:17:29,441 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-20 11:17:29,476 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-20 11:17:29,495 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_1418 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1418) |c_#length|)))) is different from true [2022-11-20 11:17:29,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:17:29,546 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-20 11:17:29,593 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-20 11:17:29,602 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_1419 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1419) |c_#length|)))) is different from true [2022-11-20 11:17:29,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:17:29,650 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-20 11:17:29,730 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-20 11:17:29,738 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_1420 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1420) |c_#length|)))) is different from true [2022-11-20 11:17:29,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:17:29,782 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-20 11:17:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 21 not checked. [2022-11-20 11:17:29,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:17:30,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027584161] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:17:30,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:17:30,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-11-20 11:17:30,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599669494] [2022-11-20 11:17:30,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:17:30,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 11:17:30,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:30,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 11:17:30,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=167, Unknown=3, NotChecked=84, Total=306 [2022-11-20 11:17:30,032 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 16 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 11:17:30,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:30,445 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-11-20 11:17:30,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:17:30,446 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 47 [2022-11-20 11:17:30,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:30,447 INFO L225 Difference]: With dead ends: 95 [2022-11-20 11:17:30,447 INFO L226 Difference]: Without dead ends: 95 [2022-11-20 11:17:30,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=207, Unknown=3, NotChecked=96, Total=380 [2022-11-20 11:17:30,448 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 215 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:30,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 210 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 296 Invalid, 0 Unknown, 273 Unchecked, 0.3s Time] [2022-11-20 11:17:30,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-20 11:17:30,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2022-11-20 11:17:30,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 78 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-20 11:17:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2022-11-20 11:17:30,452 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 47 [2022-11-20 11:17:30,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:30,452 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2022-11-20 11:17:30,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 11:17:30,452 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2022-11-20 11:17:30,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-20 11:17:30,453 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:30,453 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] [2022-11-20 11:17:30,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 11:17:30,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:17:30,660 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:30,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:30,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1018625491, now seen corresponding path program 1 times [2022-11-20 11:17:30,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:30,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329296125] [2022-11-20 11:17:30,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:30,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:30,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:17:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:30,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:17:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:30,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:17:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-20 11:17:30,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:30,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329296125] [2022-11-20 11:17:30,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329296125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:17:30,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:17:30,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:17:30,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744696041] [2022-11-20 11:17:30,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:17:30,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:17:30,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:30,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:17:30,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:17:30,769 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 11:17:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:30,868 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-11-20 11:17:30,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:17:30,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-11-20 11:17:30,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:30,869 INFO L225 Difference]: With dead ends: 93 [2022-11-20 11:17:30,869 INFO L226 Difference]: Without dead ends: 93 [2022-11-20 11:17:30,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-20 11:17:30,870 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 50 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:30,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 117 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:17:30,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-20 11:17:30,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2022-11-20 11:17:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 76 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-20 11:17:30,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2022-11-20 11:17:30,874 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 49 [2022-11-20 11:17:30,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:30,874 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2022-11-20 11:17:30,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 11:17:30,875 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2022-11-20 11:17:30,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 11:17:30,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:30,876 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] [2022-11-20 11:17:30,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:17:30,876 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:30,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:30,877 INFO L85 PathProgramCache]: Analyzing trace with hash 353447346, now seen corresponding path program 1 times [2022-11-20 11:17:30,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:30,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109884985] [2022-11-20 11:17:30,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:30,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:31,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:17:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:31,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:17:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:31,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:17:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 11:17:31,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:31,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109884985] [2022-11-20 11:17:31,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109884985] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:17:31,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710304472] [2022-11-20 11:17:31,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:31,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:17:31,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:17:31,799 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:17:31,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 11:17:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:32,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-20 11:17:32,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:17:32,133 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-20 11:17:32,372 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-20 11:17:32,553 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1824 (Array Int Int)) (|node_create_~temp~0#1.base| 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|)) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1824) |c_#memory_$Pointer$.base|))) is different from true [2022-11-20 11:17:32,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:17:32,592 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-20 11:17:32,611 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2022-11-20 11:17:32,611 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 23 treesize of output 24 [2022-11-20 11:17:32,672 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-20 11:17:32,679 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-11-20 11:17:32,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:17:32,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710304472] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:17:32,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:17:32,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2022-11-20 11:17:32,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363608297] [2022-11-20 11:17:32,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:17:32,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 11:17:32,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:32,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 11:17:32,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=572, Unknown=1, NotChecked=48, Total=702 [2022-11-20 11:17:32,809 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 26 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 11:17:33,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:33,601 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2022-11-20 11:17:33,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 11:17:33,602 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-11-20 11:17:33,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:33,603 INFO L225 Difference]: With dead ends: 111 [2022-11-20 11:17:33,603 INFO L226 Difference]: Without dead ends: 111 [2022-11-20 11:17:33,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=146, Invalid=979, Unknown=1, NotChecked=64, Total=1190 [2022-11-20 11:17:33,604 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 86 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:33,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 547 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 545 Invalid, 0 Unknown, 79 Unchecked, 0.5s Time] [2022-11-20 11:17:33,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-20 11:17:33,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2022-11-20 11:17:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 75 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-20 11:17:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-11-20 11:17:33,607 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 51 [2022-11-20 11:17:33,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:33,607 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-11-20 11:17:33,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 11:17:33,607 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-11-20 11:17:33,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 11:17:33,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:33,609 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] [2022-11-20 11:17:33,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 11:17:33,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 11:17:33,816 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:33,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:33,816 INFO L85 PathProgramCache]: Analyzing trace with hash 353447347, now seen corresponding path program 1 times [2022-11-20 11:17:33,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:33,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688745864] [2022-11-20 11:17:33,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:33,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:34,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:17:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:34,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:17:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:34,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:17:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:17:35,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:35,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688745864] [2022-11-20 11:17:35,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688745864] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:17:35,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534484390] [2022-11-20 11:17:35,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:35,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:17:35,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:17:35,715 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:17:35,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 11:17:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:35,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-20 11:17:35,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:17:36,057 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-20 11:17:36,623 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-20 11:17:36,629 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-20 11:17:36,939 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2083 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2083) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2078 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2078) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2084 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2084))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-20 11:17:37,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:17:37,001 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 31 treesize of output 31 [2022-11-20 11:17:37,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:17:37,012 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 22 treesize of output 24 [2022-11-20 11:17:37,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:17:37,020 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 29 treesize of output 29 [2022-11-20 11:17:37,035 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 11:17:37,036 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-20 11:17:37,132 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-20 11:17:37,135 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-20 11:17:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-11-20 11:17:37,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:17:38,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534484390] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:17:38,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:17:38,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2022-11-20 11:17:38,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557390731] [2022-11-20 11:17:38,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:17:38,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-20 11:17:38,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:38,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-20 11:17:38,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1225, Unknown=2, NotChecked=70, Total=1406 [2022-11-20 11:17:38,615 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 34 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 11:17:40,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:40,980 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2022-11-20 11:17:40,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 11:17:40,981 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-11-20 11:17:40,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:40,982 INFO L225 Difference]: With dead ends: 119 [2022-11-20 11:17:40,982 INFO L226 Difference]: Without dead ends: 119 [2022-11-20 11:17:40,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=219, Invalid=2132, Unknown=5, NotChecked=94, Total=2450 [2022-11-20 11:17:40,984 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 188 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:40,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1390 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1070 Invalid, 0 Unknown, 203 Unchecked, 1.2s Time] [2022-11-20 11:17:40,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-20 11:17:40,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 83. [2022-11-20 11:17:40,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 78 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 11:17:40,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-11-20 11:17:40,989 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 51 [2022-11-20 11:17:40,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:40,990 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-11-20 11:17:40,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 11:17:40,990 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-11-20 11:17:40,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 11:17:40,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:40,991 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] [2022-11-20 11:17:40,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 11:17:41,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 11:17:41,195 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:41,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:41,195 INFO L85 PathProgramCache]: Analyzing trace with hash 353294446, now seen corresponding path program 1 times [2022-11-20 11:17:41,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:41,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885687589] [2022-11-20 11:17:41,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:41,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:41,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:17:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:41,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:17:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:41,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:17:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-20 11:17:41,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:41,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885687589] [2022-11-20 11:17:41,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885687589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:17:41,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:17:41,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:17:41,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175910957] [2022-11-20 11:17:41,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:17:41,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:17:41,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:41,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:17:41,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:17:41,387 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 11:17:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:41,498 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-11-20 11:17:41,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:17:41,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-11-20 11:17:41,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:41,499 INFO L225 Difference]: With dead ends: 94 [2022-11-20 11:17:41,499 INFO L226 Difference]: Without dead ends: 94 [2022-11-20 11:17:41,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:17:41,500 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 156 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:41,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 137 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:17:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-20 11:17:41,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2022-11-20 11:17:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 77 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-20 11:17:41,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2022-11-20 11:17:41,505 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 51 [2022-11-20 11:17:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:41,506 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2022-11-20 11:17:41,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 11:17:41,506 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-11-20 11:17:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-20 11:17:41,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:41,507 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] [2022-11-20 11:17:41,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 11:17:41,508 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:41,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:41,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1709893007, now seen corresponding path program 1 times [2022-11-20 11:17:41,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:41,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720786424] [2022-11-20 11:17:41,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:41,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:41,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:17:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:41,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:17:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:41,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:17:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 11:17:41,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:41,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720786424] [2022-11-20 11:17:41,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720786424] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:17:41,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:17:41,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:17:41,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187631580] [2022-11-20 11:17:41,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:17:41,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:17:41,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:41,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:17:41,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:17:41,773 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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-20 11:17:41,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:41,955 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-11-20 11:17:41,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:17:41,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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 54 [2022-11-20 11:17:41,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:41,956 INFO L225 Difference]: With dead ends: 93 [2022-11-20 11:17:41,956 INFO L226 Difference]: Without dead ends: 93 [2022-11-20 11:17:41,957 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-20 11:17:41,957 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 44 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:41,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 219 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:17:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-20 11:17:41,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2022-11-20 11:17:41,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.360655737704918) internal successors, (83), 76 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-20 11:17:41,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2022-11-20 11:17:41,961 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 54 [2022-11-20 11:17:41,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:41,962 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2022-11-20 11:17:41,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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-20 11:17:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2022-11-20 11:17:41,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-20 11:17:41,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:41,967 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] [2022-11-20 11:17:41,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 11:17:41,967 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:41,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:41,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1709893006, now seen corresponding path program 1 times [2022-11-20 11:17:41,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:41,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020756394] [2022-11-20 11:17:41,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:41,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:42,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:17:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:42,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:17:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:42,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:17:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 11:17:42,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:42,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020756394] [2022-11-20 11:17:42,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020756394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:17:42,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:17:42,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:17:42,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276858949] [2022-11-20 11:17:42,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:17:42,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:17:42,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:42,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:17:42,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:17:42,353 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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-20 11:17:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:42,536 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2022-11-20 11:17:42,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:17:42,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 54 [2022-11-20 11:17:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:42,537 INFO L225 Difference]: With dead ends: 80 [2022-11-20 11:17:42,537 INFO L226 Difference]: Without dead ends: 80 [2022-11-20 11:17:42,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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-20 11:17:42,538 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 45 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:42,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 218 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:17:42,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-20 11:17:42,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-20 11:17:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 75 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-20 11:17:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-11-20 11:17:42,541 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 54 [2022-11-20 11:17:42,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:42,541 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-11-20 11:17:42,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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-20 11:17:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-11-20 11:17:42,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-20 11:17:42,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:42,542 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] [2022-11-20 11:17:42,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 11:17:42,545 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:42,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:42,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1969948792, now seen corresponding path program 1 times [2022-11-20 11:17:42,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:42,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103066634] [2022-11-20 11:17:42,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:42,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:42,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:17:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:42,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:17:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:42,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:17:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 11:17:42,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:42,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103066634] [2022-11-20 11:17:42,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103066634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:17:42,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:17:42,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 11:17:42,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893430991] [2022-11-20 11:17:42,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:17:42,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:17:42,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:42,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:17:42,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:17:42,946 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 11:17:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:43,296 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2022-11-20 11:17:43,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:17:43,296 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-11-20 11:17:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:43,298 INFO L225 Difference]: With dead ends: 141 [2022-11-20 11:17:43,298 INFO L226 Difference]: Without dead ends: 141 [2022-11-20 11:17:43,299 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-20 11:17:43,299 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 240 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:43,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 323 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:17:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-20 11:17:43,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 84. [2022-11-20 11:17:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 79 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-20 11:17:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2022-11-20 11:17:43,304 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 54 [2022-11-20 11:17:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:43,304 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2022-11-20 11:17:43,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 11:17:43,305 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2022-11-20 11:17:43,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-20 11:17:43,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:43,312 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] [2022-11-20 11:17:43,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 11:17:43,313 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:43,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:43,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1969948791, now seen corresponding path program 1 times [2022-11-20 11:17:43,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:43,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542466543] [2022-11-20 11:17:43,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:43,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:43,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:17:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:43,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:17:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:43,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:17:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 11:17:44,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:44,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542466543] [2022-11-20 11:17:44,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542466543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:17:44,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:17:44,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 11:17:44,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833087476] [2022-11-20 11:17:44,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:17:44,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:17:44,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:44,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:17:44,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:17:44,029 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 11:17:44,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:44,388 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2022-11-20 11:17:44,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:17:44,391 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-11-20 11:17:44,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:44,392 INFO L225 Difference]: With dead ends: 131 [2022-11-20 11:17:44,392 INFO L226 Difference]: Without dead ends: 131 [2022-11-20 11:17:44,393 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-20 11:17:44,394 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 226 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:44,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 325 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:17:44,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-20 11:17:44,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 86. [2022-11-20 11:17:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 81 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-20 11:17:44,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2022-11-20 11:17:44,435 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 54 [2022-11-20 11:17:44,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:44,435 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2022-11-20 11:17:44,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 11:17:44,436 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2022-11-20 11:17:44,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 11:17:44,437 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:44,437 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] [2022-11-20 11:17:44,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 11:17:44,437 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:44,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:44,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1467023000, now seen corresponding path program 1 times [2022-11-20 11:17:44,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:44,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071921218] [2022-11-20 11:17:44,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:44,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:45,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:17:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:45,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:17:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:45,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:17:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:17:47,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:47,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071921218] [2022-11-20 11:17:47,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071921218] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:17:47,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573756554] [2022-11-20 11:17:47,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:47,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:17:47,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:17:47,111 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:17:47,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 11:17:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:47,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-20 11:17:47,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:17:47,563 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-20 11:17:47,985 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:17:47,986 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-20 11:17:48,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:17:48,429 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:17:48,429 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 34 treesize of output 35 [2022-11-20 11:17:48,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:17:48,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:17:48,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 18 [2022-11-20 11:17:48,826 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-20 11:17:49,126 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3142 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_3143 (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|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3143)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3142)))) is different from true [2022-11-20 11:17:49,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:17:49,195 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:17:49,195 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 57 treesize of output 55 [2022-11-20 11:17:49,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:17:49,206 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 58 [2022-11-20 11:17:49,253 INFO L321 Elim1Store]: treesize reduction 94, result has 36.9 percent of original size [2022-11-20 11:17:49,254 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 42 treesize of output 64 [2022-11-20 11:17:49,391 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 63 treesize of output 43 [2022-11-20 11:17:49,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:17:49,652 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:17:49,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 21 [2022-11-20 11:17:49,795 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-20 11:17:49,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:17:50,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573756554] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:17:50,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:17:50,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 48 [2022-11-20 11:17:50,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405787314] [2022-11-20 11:17:50,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:17:50,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-20 11:17:50,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:50,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-20 11:17:50,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2448, Unknown=1, NotChecked=100, Total=2756 [2022-11-20 11:17:50,172 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 49 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 42 states have internal predecessors, (90), 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-20 11:17:51,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:17:51,467 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2022-11-20 11:17:51,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 11:17:51,468 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 42 states have internal predecessors, (90), 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 55 [2022-11-20 11:17:51,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:17:51,469 INFO L225 Difference]: With dead ends: 89 [2022-11-20 11:17:51,469 INFO L226 Difference]: Without dead ends: 89 [2022-11-20 11:17:51,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=318, Invalid=3345, Unknown=1, NotChecked=118, Total=3782 [2022-11-20 11:17:51,471 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 66 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:17:51,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 680 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 626 Invalid, 0 Unknown, 121 Unchecked, 0.7s Time] [2022-11-20 11:17:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-20 11:17:51,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-11-20 11:17:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 83 states have internal predecessors, (93), 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-20 11:17:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2022-11-20 11:17:51,476 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 55 [2022-11-20 11:17:51,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:17:51,476 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2022-11-20 11:17:51,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 42 states have internal predecessors, (90), 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-20 11:17:51,477 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2022-11-20 11:17:51,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 11:17:51,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:17:51,477 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] [2022-11-20 11:17:51,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 11:17:51,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:17:51,684 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:17:51,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:17:51,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1467022999, now seen corresponding path program 1 times [2022-11-20 11:17:51,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:17:51,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022784668] [2022-11-20 11:17:51,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:51,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:17:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:53,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:17:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:53,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:17:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:53,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:17:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:55,202 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:17:55,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:17:55,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022784668] [2022-11-20 11:17:55,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022784668] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:17:55,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351825510] [2022-11-20 11:17:55,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:17:55,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:17:55,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:17:55,204 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:17:55,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 11:17:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:17:55,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-20 11:17:55,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:17:55,587 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-20 11:17:56,107 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:17:56,107 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-20 11:17:56,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:17:56,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:17:56,477 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:17:56,478 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 65 treesize of output 62 [2022-11-20 11:17:56,487 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 41 [2022-11-20 11:17:56,959 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:17:56,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 36 [2022-11-20 11:17:56,978 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:17:56,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-11-20 11:17:57,357 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3415 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3415))) (exists ((v_ArrVal_3409 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3409) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3414 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3414) |c_#memory_$Pointer$.base|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-20 11:17:57,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:17:57,433 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:17:57,434 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 67 [2022-11-20 11:17:57,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:17:57,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:17:57,451 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:17:57,452 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 48 treesize of output 47 [2022-11-20 11:17:57,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:17:57,467 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 30 treesize of output 32 [2022-11-20 11:17:57,491 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:17:57,492 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-20 11:17:57,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:17:57,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:17:57,940 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:17:57,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 45 [2022-11-20 11:17:57,960 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-11-20 11:17:57,960 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 3 case distinctions, treesize of input 39 treesize of output 25 [2022-11-20 11:17:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-20 11:17:58,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:17:58,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351825510] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:17:58,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:17:58,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 53 [2022-11-20 11:17:58,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268743876] [2022-11-20 11:17:58,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:17:58,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-20 11:17:58,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:17:58,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-20 11:17:58,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=3231, Unknown=2, NotChecked=114, Total=3540 [2022-11-20 11:17:58,949 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 54 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 47 states have internal predecessors, (97), 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-20 11:18:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:18:03,636 INFO L93 Difference]: Finished difference Result 167 states and 185 transitions. [2022-11-20 11:18:03,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 11:18:03,636 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 47 states have internal predecessors, (97), 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 55 [2022-11-20 11:18:03,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:18:03,637 INFO L225 Difference]: With dead ends: 167 [2022-11-20 11:18:03,637 INFO L226 Difference]: Without dead ends: 167 [2022-11-20 11:18:03,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=452, Invalid=5402, Unknown=2, NotChecked=150, Total=6006 [2022-11-20 11:18:03,640 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 550 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 2251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 468 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:18:03,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1443 Invalid, 2251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1725 Invalid, 0 Unknown, 468 Unchecked, 2.0s Time] [2022-11-20 11:18:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-20 11:18:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 90. [2022-11-20 11:18:03,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 85 states have internal predecessors, (95), 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-20 11:18:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2022-11-20 11:18:03,645 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 55 [2022-11-20 11:18:03,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:18:03,645 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2022-11-20 11:18:03,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 47 states have internal predecessors, (97), 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-20 11:18:03,645 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2022-11-20 11:18:03,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 11:18:03,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:18:03,646 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] [2022-11-20 11:18:03,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 11:18:03,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-20 11:18:03,855 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:18:03,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:18:03,856 INFO L85 PathProgramCache]: Analyzing trace with hash -938871693, now seen corresponding path program 1 times [2022-11-20 11:18:03,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:18:03,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545635081] [2022-11-20 11:18:03,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:18:03,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:18:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:04,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:18:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:04,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:18:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:04,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:18:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 11:18:04,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:18:04,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545635081] [2022-11-20 11:18:04,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545635081] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:18:04,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:18:04,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 11:18:04,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614057024] [2022-11-20 11:18:04,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:18:04,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:18:04,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:18:04,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:18:04,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:18:04,196 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 11:18:04,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:18:04,446 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2022-11-20 11:18:04,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:18:04,447 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2022-11-20 11:18:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:18:04,447 INFO L225 Difference]: With dead ends: 118 [2022-11-20 11:18:04,447 INFO L226 Difference]: Without dead ends: 118 [2022-11-20 11:18:04,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-20 11:18:04,448 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 157 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:18:04,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 515 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:18:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-20 11:18:04,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 90. [2022-11-20 11:18:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 85 states have internal predecessors, (94), 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-20 11:18:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2022-11-20 11:18:04,457 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 55 [2022-11-20 11:18:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:18:04,457 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2022-11-20 11:18:04,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 11:18:04,458 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2022-11-20 11:18:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 11:18:04,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:18:04,458 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] [2022-11-20 11:18:04,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 11:18:04,459 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:18:04,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:18:04,459 INFO L85 PathProgramCache]: Analyzing trace with hash 959790642, now seen corresponding path program 1 times [2022-11-20 11:18:04,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:18:04,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306392763] [2022-11-20 11:18:04,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:18:04,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:18:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:04,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:18:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:04,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:18:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:04,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:18:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:05,101 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:18:05,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:18:05,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306392763] [2022-11-20 11:18:05,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306392763] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:18:05,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086301539] [2022-11-20 11:18:05,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:18:05,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:18:05,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:18:05,103 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:18:05,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 11:18:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:05,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-20 11:18:05,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:18:05,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:18:05,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:18:05,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:18:05,967 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-20 11:18:05,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:18:06,039 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 28 treesize of output 16 [2022-11-20 11:18:06,044 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-20 11:18:06,144 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-20 11:18:06,178 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 11:18:06,178 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:18:06,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086301539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:18:06,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:18:06,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2022-11-20 11:18:06,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759742267] [2022-11-20 11:18:06,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:18:06,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 11:18:06,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:18:06,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 11:18:06,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-11-20 11:18:06,180 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 11:18:06,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:18:06,862 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2022-11-20 11:18:06,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 11:18:06,862 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2022-11-20 11:18:06,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:18:06,863 INFO L225 Difference]: With dead ends: 116 [2022-11-20 11:18:06,863 INFO L226 Difference]: Without dead ends: 116 [2022-11-20 11:18:06,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2022-11-20 11:18:06,864 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 146 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:18:06,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 568 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:18:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-20 11:18:06,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 90. [2022-11-20 11:18:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 85 states have internal predecessors, (93), 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-20 11:18:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-11-20 11:18:06,873 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 56 [2022-11-20 11:18:06,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:18:06,874 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-11-20 11:18:06,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 11:18:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-11-20 11:18:06,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 11:18:06,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:18:06,875 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:18:06,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 11:18:07,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-20 11:18:07,079 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:18:07,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:18:07,079 INFO L85 PathProgramCache]: Analyzing trace with hash -588248546, now seen corresponding path program 2 times [2022-11-20 11:18:07,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:18:07,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717976443] [2022-11-20 11:18:07,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:18:07,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:18:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:09,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:18:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:09,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:18:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:10,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:18:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:18:11,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:18:11,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717976443] [2022-11-20 11:18:11,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717976443] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:18:11,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747247593] [2022-11-20 11:18:11,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:18:11,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:18:11,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:18:11,839 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:18:11,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 11:18:12,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:18:12,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:18:12,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 141 conjunts are in the unsatisfiable core [2022-11-20 11:18:12,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:18:12,308 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-20 11:18:12,621 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-20 11:18:12,633 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-20 11:18:13,391 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:18:13,392 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 14 treesize of output 20 [2022-11-20 11:18:13,415 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:18:13,415 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 14 treesize of output 20 [2022-11-20 11:18:13,446 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:18:13,446 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-20 11:18:13,666 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-20 11:18:13,681 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-20 11:18:13,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 11:18:13,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 11:18:14,012 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 11:18:14,013 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 94 treesize of output 57 [2022-11-20 11:18:14,022 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 0 case distinctions, treesize of input 46 treesize of output 42 [2022-11-20 11:18:14,661 INFO L321 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2022-11-20 11:18:14,662 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 44 [2022-11-20 11:18:14,681 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-20 11:18:14,682 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 2 case distinctions, treesize of input 21 treesize of output 21 [2022-11-20 11:18:14,695 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-20 11:18:14,982 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4120 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_4119 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_4119)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_4120)))) is different from true [2022-11-20 11:18:15,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:18:15,053 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-20 11:18:15,053 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 116 treesize of output 106 [2022-11-20 11:18:15,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:18:15,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:18:15,077 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-20 11:18:15,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 110 [2022-11-20 11:18:15,107 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-20 11:18:15,108 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 34 treesize of output 36 [2022-11-20 11:18:16,090 INFO L321 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2022-11-20 11:18:16,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 74 [2022-11-20 11:18:16,114 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-11-20 11:18:16,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 32 [2022-11-20 11:18:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-20 11:18:16,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:18:17,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747247593] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:18:17,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:18:17,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 56 [2022-11-20 11:18:17,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631240421] [2022-11-20 11:18:17,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:18:17,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-20 11:18:17,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:18:17,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-20 11:18:17,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3491, Unknown=3, NotChecked=118, Total=3782 [2022-11-20 11:18:17,125 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 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-20 11:18:21,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:18:21,482 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2022-11-20 11:18:21,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 11:18:21,483 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 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 59 [2022-11-20 11:18:21,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:18:21,484 INFO L225 Difference]: With dead ends: 114 [2022-11-20 11:18:21,484 INFO L226 Difference]: Without dead ends: 114 [2022-11-20 11:18:21,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=329, Invalid=5992, Unknown=3, NotChecked=156, Total=6480 [2022-11-20 11:18:21,486 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 53 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 299 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:18:21,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1499 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1415 Invalid, 0 Unknown, 299 Unchecked, 1.5s Time] [2022-11-20 11:18:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-20 11:18:21,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2022-11-20 11:18:21,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 105 states have internal predecessors, (116), 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-20 11:18:21,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2022-11-20 11:18:21,492 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 59 [2022-11-20 11:18:21,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:18:21,493 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2022-11-20 11:18:21,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 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-20 11:18:21,494 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2022-11-20 11:18:21,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 11:18:21,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:18:21,495 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] [2022-11-20 11:18:21,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 11:18:21,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:18:21,703 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:18:21,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:18:21,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1935094492, now seen corresponding path program 1 times [2022-11-20 11:18:21,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:18:21,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839286980] [2022-11-20 11:18:21,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:18:21,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:18:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:22,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:18:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:22,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:18:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:22,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:18:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:18:22,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:18:22,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839286980] [2022-11-20 11:18:22,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839286980] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:18:22,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:18:22,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-20 11:18:22,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171476584] [2022-11-20 11:18:22,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:18:22,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 11:18:22,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:18:22,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 11:18:22,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2022-11-20 11:18:22,622 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 23 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 11:18:23,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:18:23,903 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2022-11-20 11:18:23,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 11:18:23,904 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2022-11-20 11:18:23,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:18:23,905 INFO L225 Difference]: With dead ends: 176 [2022-11-20 11:18:23,905 INFO L226 Difference]: Without dead ends: 176 [2022-11-20 11:18:23,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2022-11-20 11:18:23,906 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 593 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:18:23,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 473 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 11:18:23,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-20 11:18:23,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 119. [2022-11-20 11:18:23,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 112 states have internal predecessors, (125), 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-20 11:18:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2022-11-20 11:18:23,912 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 59 [2022-11-20 11:18:23,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:18:23,912 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2022-11-20 11:18:23,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 11:18:23,912 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2022-11-20 11:18:23,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 11:18:23,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:18:23,913 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] [2022-11-20 11:18:23,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 11:18:23,913 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:18:23,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:18:23,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1935094491, now seen corresponding path program 1 times [2022-11-20 11:18:23,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:18:23,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974443672] [2022-11-20 11:18:23,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:18:23,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:18:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:24,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:18:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:24,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:18:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:24,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:18:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:18:25,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:18:25,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974443672] [2022-11-20 11:18:25,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974443672] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:18:25,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381757305] [2022-11-20 11:18:25,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:18:25,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:18:25,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:18:25,738 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:18:25,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 11:18:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:26,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-20 11:18:26,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:18:26,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:18:26,814 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 27 treesize of output 15 [2022-11-20 11:18:26,819 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-20 11:18:27,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:18:27,340 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-20 11:18:27,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:18:27,350 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 16 treesize of output 18 [2022-11-20 11:18:27,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:18:27,357 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 33 treesize of output 31 [2022-11-20 11:18:27,375 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 11:18:27,376 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-20 11:18:27,846 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-20 11:18:27,847 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 21 treesize of output 20 [2022-11-20 11:18:27,878 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-11-20 11:18:27,878 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 44 [2022-11-20 11:18:27,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:18:27,905 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-20 11:18:27,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:18:27,917 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-20 11:18:28,000 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-20 11:18:28,007 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-20 11:18:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:18:28,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:18:30,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381757305] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:18:30,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:18:30,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 41 [2022-11-20 11:18:30,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152778478] [2022-11-20 11:18:30,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:18:30,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-20 11:18:30,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:18:30,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-20 11:18:30,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2359, Unknown=26, NotChecked=0, Total=2550 [2022-11-20 11:18:30,438 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 42 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 36 states have internal predecessors, (90), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-20 11:18:33,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:18:33,645 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2022-11-20 11:18:33,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 11:18:33,646 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 36 states have internal predecessors, (90), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 59 [2022-11-20 11:18:33,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:18:33,647 INFO L225 Difference]: With dead ends: 182 [2022-11-20 11:18:33,647 INFO L226 Difference]: Without dead ends: 182 [2022-11-20 11:18:33,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=418, Invalid=4805, Unknown=33, NotChecked=0, Total=5256 [2022-11-20 11:18:33,649 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 264 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:18:33,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1428 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1230 Invalid, 0 Unknown, 59 Unchecked, 1.2s Time] [2022-11-20 11:18:33,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-20 11:18:33,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 122. [2022-11-20 11:18:33,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 102 states have (on average 1.2549019607843137) internal successors, (128), 115 states have internal predecessors, (128), 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-20 11:18:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2022-11-20 11:18:33,654 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 59 [2022-11-20 11:18:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:18:33,655 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2022-11-20 11:18:33,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 36 states have internal predecessors, (90), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-20 11:18:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2022-11-20 11:18:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 11:18:33,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:18:33,656 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:18:33,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-20 11:18:33,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:18:33,859 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:18:33,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:18:33,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1526484642, now seen corresponding path program 1 times [2022-11-20 11:18:33,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:18:33,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887728021] [2022-11-20 11:18:33,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:18:33,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:18:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:34,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:18:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:34,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:18:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:34,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:18:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:34,517 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 11:18:34,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:18:34,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887728021] [2022-11-20 11:18:34,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887728021] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:18:34,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739030170] [2022-11-20 11:18:34,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:18:34,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:18:34,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:18:34,523 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:18:34,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 11:18:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:34,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-20 11:18:34,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:18:35,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-20 11:18:35,351 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_4848 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_4848)))) is different from true [2022-11-20 11:18:35,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:18:35,381 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 15 treesize of output 17 [2022-11-20 11:18:35,427 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 16 treesize of output 8 [2022-11-20 11:18:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 3 not checked. [2022-11-20 11:18:35,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:18:35,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739030170] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:18:35,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:18:35,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-11-20 11:18:35,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709033786] [2022-11-20 11:18:35,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:18:35,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 11:18:35,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:18:35,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 11:18:35,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=613, Unknown=6, NotChecked=50, Total=756 [2022-11-20 11:18:35,584 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand has 26 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 22 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 11:18:36,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:18:36,219 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2022-11-20 11:18:36,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 11:18:36,220 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 22 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2022-11-20 11:18:36,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:18:36,221 INFO L225 Difference]: With dead ends: 115 [2022-11-20 11:18:36,221 INFO L226 Difference]: Without dead ends: 115 [2022-11-20 11:18:36,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=1012, Unknown=6, NotChecked=66, Total=1260 [2022-11-20 11:18:36,222 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 304 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:18:36,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 496 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 434 Invalid, 0 Unknown, 76 Unchecked, 0.4s Time] [2022-11-20 11:18:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-20 11:18:36,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-20 11:18:36,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 108 states have internal predecessors, (119), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 11:18:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2022-11-20 11:18:36,226 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 59 [2022-11-20 11:18:36,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:18:36,227 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2022-11-20 11:18:36,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 22 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 11:18:36,227 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-11-20 11:18:36,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-20 11:18:36,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:18:36,228 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] [2022-11-20 11:18:36,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 11:18:36,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 11:18:36,440 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:18:36,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:18:36,440 INFO L85 PathProgramCache]: Analyzing trace with hash 95034574, now seen corresponding path program 1 times [2022-11-20 11:18:36,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:18:36,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232004223] [2022-11-20 11:18:36,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:18:36,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:18:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:37,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:18:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:38,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:18:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:38,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:18:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:18:40,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:18:40,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232004223] [2022-11-20 11:18:40,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232004223] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:18:40,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876448173] [2022-11-20 11:18:40,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:18:40,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:18:40,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:18:40,627 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:18:40,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 11:18:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:41,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-20 11:18:41,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:18:41,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:18:41,765 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:18:41,765 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 17 treesize of output 21 [2022-11-20 11:18:42,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:18:42,158 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:18:42,159 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 44 treesize of output 43 [2022-11-20 11:18:42,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:18:42,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 22 [2022-11-20 11:18:42,727 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-20 11:18:43,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:18:43,454 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-20 11:18:43,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:18:43,479 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:18:43,479 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 57 treesize of output 49 [2022-11-20 11:18:43,508 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:18:43,509 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-20 11:18:43,797 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-20 11:18:44,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:18:44,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 15 [2022-11-20 11:18:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:18:44,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:18:44,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876448173] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:18:44,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:18:44,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 56 [2022-11-20 11:18:44,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239512208] [2022-11-20 11:18:44,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:18:44,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-20 11:18:44,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:18:44,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-20 11:18:44,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3367, Unknown=5, NotChecked=0, Total=3540 [2022-11-20 11:18:44,761 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 56 states, 54 states have (on average 2.0) internal successors, (108), 47 states have internal predecessors, (108), 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-20 11:18:48,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:18:48,793 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2022-11-20 11:18:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 11:18:48,794 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 2.0) internal successors, (108), 47 states have internal predecessors, (108), 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 61 [2022-11-20 11:18:48,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:18:48,795 INFO L225 Difference]: With dead ends: 108 [2022-11-20 11:18:48,795 INFO L226 Difference]: Without dead ends: 108 [2022-11-20 11:18:48,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=398, Invalid=5759, Unknown=5, NotChecked=0, Total=6162 [2022-11-20 11:18:48,798 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 121 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:18:48,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1296 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1301 Invalid, 0 Unknown, 152 Unchecked, 1.3s Time] [2022-11-20 11:18:48,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-20 11:18:48,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-11-20 11:18:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.25) internal successors, (110), 101 states have internal predecessors, (110), 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-20 11:18:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2022-11-20 11:18:48,804 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 61 [2022-11-20 11:18:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:18:48,804 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2022-11-20 11:18:48,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 2.0) internal successors, (108), 47 states have internal predecessors, (108), 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-20 11:18:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2022-11-20 11:18:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-20 11:18:48,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:18:48,810 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:18:48,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 11:18:49,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 11:18:49,011 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:18:49,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:18:49,011 INFO L85 PathProgramCache]: Analyzing trace with hash 592087770, now seen corresponding path program 1 times [2022-11-20 11:18:49,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:18:49,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618316897] [2022-11-20 11:18:49,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:18:49,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:18:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:49,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:18:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:49,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:18:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:50,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:18:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:18:50,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:18:50,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618316897] [2022-11-20 11:18:50,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618316897] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:18:50,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120013458] [2022-11-20 11:18:50,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:18:50,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:18:50,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:18:50,326 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:18:50,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 11:18:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:50,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-20 11:18:50,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:18:50,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:18:51,294 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-20 11:18:51,411 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5413 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5413))) (exists ((v_ArrVal_5412 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_5412)))) is different from true [2022-11-20 11:18:51,422 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5414 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5414))) (exists ((v_ArrVal_5412 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_5412)))) is different from true [2022-11-20 11:18:51,433 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5415 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5415))) (exists ((v_ArrVal_5412 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_5412)))) is different from true [2022-11-20 11:18:51,447 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5415 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_5415) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5412 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_5412)))) is different from true [2022-11-20 11:18:51,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:18:51,465 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-20 11:18:51,486 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 11:18:51,486 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 16 treesize of output 26 [2022-11-20 11:18:52,126 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-11-20 11:18:52,127 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2022-11-20 11:18:52,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:18:52,146 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-20 11:18:52,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 11:18:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 5 not checked. [2022-11-20 11:18:52,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:18:54,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120013458] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:18:54,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:18:54,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2022-11-20 11:18:54,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820357792] [2022-11-20 11:18:54,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:18:54,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-20 11:18:54,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:18:54,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-20 11:18:54,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2829, Unknown=25, NotChecked=444, Total=3540 [2022-11-20 11:18:54,117 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand has 51 states, 48 states have (on average 2.1875) internal successors, (105), 45 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 11:18:56,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:18:56,010 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-11-20 11:18:56,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 11:18:56,010 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 2.1875) internal successors, (105), 45 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 63 [2022-11-20 11:18:56,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:18:56,011 INFO L225 Difference]: With dead ends: 113 [2022-11-20 11:18:56,011 INFO L226 Difference]: Without dead ends: 113 [2022-11-20 11:18:56,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1352 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=452, Invalid=4508, Unknown=26, NotChecked=564, Total=5550 [2022-11-20 11:18:56,013 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 82 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:18:56,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 797 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 856 Invalid, 0 Unknown, 355 Unchecked, 0.8s Time] [2022-11-20 11:18:56,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-20 11:18:56,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-11-20 11:18:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 101 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-20 11:18:56,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2022-11-20 11:18:56,019 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 63 [2022-11-20 11:18:56,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:18:56,020 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2022-11-20 11:18:56,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 2.1875) internal successors, (105), 45 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 11:18:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-11-20 11:18:56,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 11:18:56,021 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:18:56,022 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:18:56,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-20 11:18:56,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:18:56,231 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:18:56,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:18:56,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2060666116, now seen corresponding path program 1 times [2022-11-20 11:18:56,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:18:56,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106689719] [2022-11-20 11:18:56,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:18:56,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:18:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:58,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:18:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:58,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:18:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:58,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:18:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:18:59,920 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:18:59,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:18:59,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106689719] [2022-11-20 11:18:59,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106689719] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:18:59,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397827098] [2022-11-20 11:18:59,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:18:59,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:18:59,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:18:59,922 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:18:59,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 11:19:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:19:00,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 149 conjunts are in the unsatisfiable core [2022-11-20 11:19:00,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:19:00,559 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-20 11:19:01,018 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-20 11:19:01,229 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-20 11:19:01,485 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:19:01,486 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 17 treesize of output 21 [2022-11-20 11:19:01,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-20 11:19:01,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:19:01,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:19:01,970 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-20 11:19:02,200 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:19:02,200 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 57 treesize of output 54 [2022-11-20 11:19:02,214 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 20 treesize of output 22 [2022-11-20 11:19:02,934 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:19:02,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 34 [2022-11-20 11:19:02,944 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-20 11:19:02,953 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-20 11:19:03,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:19:03,704 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-20 11:19:03,705 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 60 [2022-11-20 11:19:03,731 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2022-11-20 11:19:03,731 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 20 treesize of output 23 [2022-11-20 11:19:03,740 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-20 11:19:03,772 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:19:03,772 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-20 11:19:03,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:19:03,799 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 16 treesize of output 11 [2022-11-20 11:19:05,686 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-20 11:19:05,687 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 173 treesize of output 124 [2022-11-20 11:19:05,728 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-20 11:19:05,728 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 69 treesize of output 49 [2022-11-20 11:19:05,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:19:05,739 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 32 treesize of output 34 [2022-11-20 11:19:05,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:19:05,946 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:19:05,947 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 75 treesize of output 63 [2022-11-20 11:19:05,963 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-20 11:19:05,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:19:05,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:19:06,165 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:19:06,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 27 [2022-11-20 11:19:06,171 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-20 11:19:06,435 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-20 11:19:06,532 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:19:06,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:19:06,556 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5721 (Array Int Int)) (v_ArrVal_5720 (Array Int Int)) (v_ArrVal_5722 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5720) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5722) |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_dll_append_~new_last~0#1.base| v_ArrVal_5721) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-20 11:19:06,572 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5721 (Array Int Int)) (v_ArrVal_5720 (Array Int Int)) (v_ArrVal_5722 (Array Int Int)) (v_ArrVal_5718 (Array Int Int)) (v_ArrVal_5717 (Array Int Int)) (v_ArrVal_5719 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5718) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5720) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5717) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5722) |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_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_5719)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5721) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-20 11:19:08,489 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5721 (Array Int Int)) (v_ArrVal_5720 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| Int) (v_ArrVal_5722 (Array Int Int)) (v_ArrVal_5736 (Array Int Int)) (v_ArrVal_5735 (Array Int Int)) (v_ArrVal_5737 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_28| Int) (v_ArrVal_5718 (Array Int Int)) (v_ArrVal_5717 (Array Int Int)) (v_ArrVal_5719 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5737)) (.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5736))) (let ((.cse1 (select (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ 4 (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_28| 4))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| |c_#StackHeapBarrier|)) (not (= 0 (select (select .cse0 .cse1) .cse2))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5735) .cse1 v_ArrVal_5718) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5720) (select (select (store (store .cse0 .cse1 v_ArrVal_5717) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5722) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_5719)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5721) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41|) 0)))))) is different from false [2022-11-20 11:19:08,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397827098] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:19:08,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:19:08,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 37] total 66 [2022-11-20 11:19:08,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410758978] [2022-11-20 11:19:08,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:19:08,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-20 11:19:08,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:19:08,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-20 11:19:08,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=4993, Unknown=4, NotChecked=432, Total=5700 [2022-11-20 11:19:08,496 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 66 states, 64 states have (on average 1.6875) internal successors, (108), 57 states have internal predecessors, (108), 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-20 11:19:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:19:19,519 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2022-11-20 11:19:19,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-20 11:19:19,520 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 64 states have (on average 1.6875) internal successors, (108), 57 states have internal predecessors, (108), 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 65 [2022-11-20 11:19:19,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:19:19,523 INFO L225 Difference]: With dead ends: 167 [2022-11-20 11:19:19,523 INFO L226 Difference]: Without dead ends: 167 [2022-11-20 11:19:19,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 105 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2478 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=948, Invalid=9772, Unknown=4, NotChecked=618, Total=11342 [2022-11-20 11:19:19,527 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1088 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:19:19,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 955 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-20 11:19:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-20 11:19:19,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 115. [2022-11-20 11:19:19,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 108 states have internal predecessors, (116), 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-20 11:19:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2022-11-20 11:19:19,533 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 65 [2022-11-20 11:19:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:19:19,534 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2022-11-20 11:19:19,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 64 states have (on average 1.6875) internal successors, (108), 57 states have internal predecessors, (108), 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-20 11:19:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2022-11-20 11:19:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-20 11:19:19,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:19:19,535 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:19:19,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 11:19:19,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-20 11:19:19,739 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:19:19,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:19:19,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1337458320, now seen corresponding path program 1 times [2022-11-20 11:19:19,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:19:19,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119350394] [2022-11-20 11:19:19,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:19:19,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:19:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:19:22,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:19:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:19:23,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:19:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:19:23,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:19:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:19:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:19:25,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:19:25,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119350394] [2022-11-20 11:19:25,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119350394] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:19:25,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296249901] [2022-11-20 11:19:25,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:19:25,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:19:25,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:19:25,595 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:19:25,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 11:19:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:19:26,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-20 11:19:26,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:19:26,178 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-20 11:19:26,728 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-20 11:19:27,131 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:19:27,132 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 17 treesize of output 21 [2022-11-20 11:19:27,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:19:27,643 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:19:27,643 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 43 treesize of output 42 [2022-11-20 11:19:28,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:19:28,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 25 [2022-11-20 11:19:28,296 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-20 11:19:28,301 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-20 11:19:29,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:19:29,099 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:19:29,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 66 treesize of output 56 [2022-11-20 11:19:29,124 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:19:29,124 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-20 11:19:29,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:19:29,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:19:30,840 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-20 11:19:30,840 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 161 treesize of output 114 [2022-11-20 11:19:30,871 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-20 11:19:30,871 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 68 treesize of output 48 [2022-11-20 11:19:31,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:19:31,084 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:19:31,085 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 77 treesize of output 61 [2022-11-20 11:19:31,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:19:31,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:19:31,283 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-20 11:19:31,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:19:31,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 25 [2022-11-20 11:19:31,731 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:19:31,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:19:32,272 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6021 (Array Int Int)) (v_ArrVal_6020 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6021) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6020))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse1 4))) 1) (not (<= 0 .cse1))))) is different from false [2022-11-20 11:19:32,979 INFO L321 Elim1Store]: treesize reduction 5, result has 89.4 percent of original size [2022-11-20 11:19:32,980 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 51 treesize of output 50 [2022-11-20 11:19:35,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296249901] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:19:35,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:19:35,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 69 [2022-11-20 11:19:35,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147385884] [2022-11-20 11:19:35,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:19:35,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-20 11:19:35,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:19:35,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-20 11:19:35,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=6529, Unknown=19, NotChecked=162, Total=6972 [2022-11-20 11:19:35,485 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 70 states, 67 states have (on average 1.791044776119403) internal successors, (120), 61 states have internal predecessors, (120), 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-20 11:19:43,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:19:43,973 INFO L93 Difference]: Finished difference Result 138 states and 151 transitions. [2022-11-20 11:19:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 11:19:43,974 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 67 states have (on average 1.791044776119403) internal successors, (120), 61 states have internal predecessors, (120), 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-20 11:19:43,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:19:43,975 INFO L225 Difference]: With dead ends: 138 [2022-11-20 11:19:43,975 INFO L226 Difference]: Without dead ends: 138 [2022-11-20 11:19:43,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1812 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=576, Invalid=10539, Unknown=19, NotChecked=208, Total=11342 [2022-11-20 11:19:43,977 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 228 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 2641 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:19:43,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1294 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2641 Invalid, 0 Unknown, 258 Unchecked, 3.0s Time] [2022-11-20 11:19:43,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-20 11:19:43,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2022-11-20 11:19:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.2323232323232323) 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-20 11:19:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2022-11-20 11:19:43,982 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 68 [2022-11-20 11:19:43,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:19:43,982 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2022-11-20 11:19:43,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 67 states have (on average 1.791044776119403) internal successors, (120), 61 states have internal predecessors, (120), 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-20 11:19:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2022-11-20 11:19:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-20 11:19:43,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:19:43,984 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:19:43,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-20 11:19:44,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-20 11:19:44,194 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:19:44,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:19:44,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1337458321, now seen corresponding path program 1 times [2022-11-20 11:19:44,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:19:44,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950958786] [2022-11-20 11:19:44,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:19:44,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:19:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:19:47,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:19:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:19:48,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:19:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:19:48,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:19:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:19:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:19:50,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:19:50,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950958786] [2022-11-20 11:19:50,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950958786] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:19:50,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161804232] [2022-11-20 11:19:50,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:19:50,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:19:50,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:19:50,037 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:19:50,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-20 11:19:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:19:50,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 147 conjunts are in the unsatisfiable core [2022-11-20 11:19:50,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:19:50,527 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-20 11:19:50,620 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-20 11:19:50,882 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:19:50,882 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-20 11:19:51,352 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-20 11:19:51,634 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 11:19:51,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-20 11:19:51,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-20 11:19:52,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:19:52,249 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:19:52,249 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 70 [2022-11-20 11:19:52,259 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 41 treesize of output 41 [2022-11-20 11:19:53,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:19:53,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 48 [2022-11-20 11:19:53,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 26 treesize of output 14 [2022-11-20 11:19:53,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 11:19:54,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:19:54,058 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:19:54,059 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 107 treesize of output 85 [2022-11-20 11:19:54,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:19:54,092 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:19:54,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-20 11:19:54,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:19:54,104 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 48 treesize of output 47 [2022-11-20 11:19:54,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 32 [2022-11-20 11:19:56,094 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-20 11:19:56,095 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 183 treesize of output 130 [2022-11-20 11:19:56,130 INFO L321 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-11-20 11:19:56,131 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 83 treesize of output 62 [2022-11-20 11:19:56,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:19:56,361 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:19:56,362 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 105 treesize of output 83 [2022-11-20 11:19:56,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:19:56,373 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 48 treesize of output 47 [2022-11-20 11:19:57,315 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:19:57,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:19:57,319 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:19:57,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 57 [2022-11-20 11:19:57,335 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 11:19:57,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 25 [2022-11-20 11:19:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:19:57,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:19:58,494 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6319 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6319))) (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_6320 (Array Int Int))) (<= 0 (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6320) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse1 4)))) (not (<= 0 .cse1)))))) (forall ((v_ArrVal_6319 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6319))) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6320 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6320))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ .cse6 4))) (<= (+ (select (select .cse2 .cse3) .cse4) 4) (select |c_#length| (select (select .cse5 .cse3) .cse4)))))) (not (<= 0 .cse6))))))) is different from false [2022-11-20 11:20:07,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161804232] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:20:07,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:20:07,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 73 [2022-11-20 11:20:07,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296260355] [2022-11-20 11:20:07,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:20:07,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-20 11:20:07,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:20:07,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-20 11:20:07,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=7534, Unknown=7, NotChecked=174, Total=8010 [2022-11-20 11:20:07,495 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 74 states, 71 states have (on average 1.732394366197183) internal successors, (123), 65 states have internal predecessors, (123), 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-20 11:20:23,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:20:23,042 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2022-11-20 11:20:23,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-20 11:20:23,043 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 71 states have (on average 1.732394366197183) internal successors, (123), 65 states have internal predecessors, (123), 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 68 [2022-11-20 11:20:23,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:20:23,044 INFO L225 Difference]: With dead ends: 142 [2022-11-20 11:20:23,044 INFO L226 Difference]: Without dead ends: 142 [2022-11-20 11:20:23,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 119 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3107 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=967, Invalid=13310, Unknown=7, NotChecked=236, Total=14520 [2022-11-20 11:20:23,046 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 615 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 2687 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 3104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 344 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:20:23,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1255 Invalid, 3104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2687 Invalid, 0 Unknown, 344 Unchecked, 3.4s Time] [2022-11-20 11:20:23,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-20 11:20:23,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 118. [2022-11-20 11:20:23,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 111 states have internal predecessors, (120), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 11:20:23,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2022-11-20 11:20:23,052 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 68 [2022-11-20 11:20:23,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:20:23,053 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2022-11-20 11:20:23,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 71 states have (on average 1.732394366197183) internal successors, (123), 65 states have internal predecessors, (123), 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-20 11:20:23,053 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2022-11-20 11:20:23,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-20 11:20:23,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:20:23,055 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:20:23,066 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-20 11:20:23,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-20 11:20:23,263 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:20:23,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:20:23,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1488466325, now seen corresponding path program 1 times [2022-11-20 11:20:23,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:20:23,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129291119] [2022-11-20 11:20:23,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:20:23,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:20:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:20:25,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:20:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:20:26,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:20:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:20:26,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:20:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:20:27,209 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:20:27,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:20:27,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129291119] [2022-11-20 11:20:27,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129291119] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:20:27,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301460073] [2022-11-20 11:20:27,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:20:27,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:20:27,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:20:27,211 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:20:27,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-20 11:20:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:20:27,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 134 conjunts are in the unsatisfiable core [2022-11-20 11:20:27,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:20:27,712 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-20 11:20:27,803 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-20 11:20:28,105 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:20:28,105 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 17 treesize of output 21 [2022-11-20 11:20:28,519 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-20 11:20:28,796 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 11:20:28,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-20 11:20:29,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 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-20 11:20:29,309 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:20:29,310 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-11-20 11:20:30,038 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:20:30,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 34 [2022-11-20 11:20:30,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 11:20:30,052 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-20 11:20:30,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:20:30,802 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-20 11:20:30,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:20:30,824 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:20:30,825 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 67 [2022-11-20 11:20:30,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:20:30,851 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:20:30,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-20 11:20:32,661 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-20 11:20:32,662 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 161 treesize of output 112 [2022-11-20 11:20:32,680 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-20 11:20:32,680 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 49 treesize of output 33 [2022-11-20 11:20:32,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:20:32,846 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:20:32,846 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 83 treesize of output 65 [2022-11-20 11:20:32,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:20:32,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:20:32,995 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-20 11:20:33,324 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:20:33,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 27 [2022-11-20 11:20:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:20:33,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:20:33,718 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6618 (Array Int Int)) (v_ArrVal_6617 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6618) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6617))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse1 4)) 0)) (not (<= 0 .cse1))))) is different from false [2022-11-20 11:20:33,732 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6614 Int) (v_ArrVal_6616 (Array Int Int)) (v_ArrVal_6618 (Array Int Int)) (v_ArrVal_6617 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_6614)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6618) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (not (= (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6616) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6617))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 .cse0)) 0))))) is different from false [2022-11-20 11:20:35,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301460073] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:20:35,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:20:35,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 69 [2022-11-20 11:20:35,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304815148] [2022-11-20 11:20:35,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:20:35,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-11-20 11:20:35,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:20:35,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-11-20 11:20:35,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=6160, Unknown=15, NotChecked=318, Total=6806 [2022-11-20 11:20:35,634 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 69 states, 67 states have (on average 1.8059701492537314) internal successors, (121), 60 states have internal predecessors, (121), 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-20 11:20:41,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:20:41,474 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2022-11-20 11:20:41,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 11:20:41,474 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 67 states have (on average 1.8059701492537314) internal successors, (121), 60 states have internal predecessors, (121), 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-20 11:20:41,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:20:41,475 INFO L225 Difference]: With dead ends: 119 [2022-11-20 11:20:41,475 INFO L226 Difference]: Without dead ends: 119 [2022-11-20 11:20:41,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2537 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=609, Invalid=9686, Unknown=15, NotChecked=402, Total=10712 [2022-11-20 11:20:41,476 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 181 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-20 11:20:41,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1139 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1752 Invalid, 0 Unknown, 147 Unchecked, 1.9s Time] [2022-11-20 11:20:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-20 11:20:41,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2022-11-20 11:20:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 110 states have internal predecessors, (118), 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-20 11:20:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2022-11-20 11:20:41,480 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 69 [2022-11-20 11:20:41,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:20:41,480 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2022-11-20 11:20:41,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 67 states have (on average 1.8059701492537314) internal successors, (121), 60 states have internal predecessors, (121), 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-20 11:20:41,481 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2022-11-20 11:20:41,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-20 11:20:41,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:20:41,482 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:20:41,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-20 11:20:41,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-20 11:20:41,687 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:20:41,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:20:41,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1102226234, now seen corresponding path program 1 times [2022-11-20 11:20:41,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:20:41,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285920056] [2022-11-20 11:20:41,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:20:41,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:20:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:20:44,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:20:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:20:45,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:20:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:20:45,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:20:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:20:47,520 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:20:47,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:20:47,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285920056] [2022-11-20 11:20:47,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285920056] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:20:47,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814398094] [2022-11-20 11:20:47,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:20:47,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:20:47,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:20:47,521 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:20:47,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-20 11:20:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:20:48,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 179 conjunts are in the unsatisfiable core [2022-11-20 11:20:48,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:20:48,168 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-20 11:20:48,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:20:48,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:20:48,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 11:20:48,842 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-20 11:20:48,845 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-20 11:20:49,662 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:20:49,663 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 17 treesize of output 21 [2022-11-20 11:20:49,678 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-20 11:20:50,088 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-20 11:20:50,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:20:50,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:20:50,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:20:50,448 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:20:50,448 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 101 treesize of output 92 [2022-11-20 11:20:50,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:20:50,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2022-11-20 11:20:50,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 11:20:51,340 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:20:51,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 41 [2022-11-20 11:20:51,353 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:20:51,353 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 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:20:51,359 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-20 11:20:51,365 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-20 11:20:52,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:20:52,232 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-20 11:20:52,233 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 94 treesize of output 69 [2022-11-20 11:20:52,263 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-20 11:20:52,263 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 24 treesize of output 31 [2022-11-20 11:20:52,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 11:20:52,306 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:20:52,307 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-20 11:20:52,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:20:52,329 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:20:52,330 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 1 case distinctions, treesize of input 27 treesize of output 25 [2022-11-20 11:20:54,664 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-20 11:20:54,665 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 226 treesize of output 163 [2022-11-20 11:20:54,733 INFO L321 Elim1Store]: treesize reduction 136, result has 13.9 percent of original size [2022-11-20 11:20:54,733 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 91 [2022-11-20 11:20:54,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:20:54,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:20:54,751 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 57 treesize of output 42 [2022-11-20 11:20:54,757 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 7 treesize of output 3 [2022-11-20 11:20:54,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:20:54,977 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:20:54,978 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 96 treesize of output 78 [2022-11-20 11:20:54,990 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 22 treesize of output 24 [2022-11-20 11:20:54,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:20:55,004 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:20:55,004 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 1 case distinctions, treesize of input 31 treesize of output 34 [2022-11-20 11:20:55,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:20:55,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:20:55,946 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:20:55,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 56 [2022-11-20 11:20:55,954 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:20:55,955 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 1 case distinctions, treesize of input 34 treesize of output 15 [2022-11-20 11:20:56,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:20:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:20:56,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:20:57,199 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6928 Int) (v_ArrVal_6925 Int) (v_ArrVal_6931 (Array Int Int)) (v_ArrVal_6930 (Array Int Int)) (v_ArrVal_6932 (Array Int Int)) (v_ArrVal_6927 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_6928)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6932))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6927) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6930))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ .cse5 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_6925)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6931) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))) |c_ULTIMATE.start_main_~data~0#1|) (not (<= 0 .cse5))))))) is different from false [2022-11-20 11:21:00,020 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6928 Int) (v_ArrVal_6925 Int) (v_ArrVal_6931 (Array Int Int)) (v_ArrVal_6930 (Array Int Int)) (v_ArrVal_6932 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| Int) (v_ArrVal_6946 (Array Int Int)) (v_ArrVal_6945 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_38| Int) (v_ArrVal_6947 (Array Int Int)) (v_ArrVal_6927 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6946)) (.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6947))) (let ((.cse10 (select (select .cse8 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse11 (+ (select (select .cse9 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1 (select (select .cse8 .cse10) .cse11)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_38| 4))) (let ((.cse6 (store (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 v_ArrVal_6928)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6932))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store .cse8 .cse1 v_ArrVal_6927) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6930))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ .cse7 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6945))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_6925))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6931) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (not (= (select (select .cse8 .cse1) .cse2) 0)) (not (<= 0 .cse7)) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_38| (select (select .cse9 .cse10) .cse11)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53|) 0))))))))) is different from false [2022-11-20 11:21:00,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814398094] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:21:00,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:21:00,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 71 [2022-11-20 11:21:00,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100245724] [2022-11-20 11:21:00,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:21:00,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-20 11:21:00,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:21:00,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-20 11:21:00,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=6474, Unknown=22, NotChecked=326, Total=7140 [2022-11-20 11:21:00,026 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand has 71 states, 69 states have (on average 1.710144927536232) internal successors, (118), 62 states have internal predecessors, (118), 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-20 11:21:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:21:05,520 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2022-11-20 11:21:05,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-20 11:21:05,521 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 69 states have (on average 1.710144927536232) internal successors, (118), 62 states have internal predecessors, (118), 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 70 [2022-11-20 11:21:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:21:05,522 INFO L225 Difference]: With dead ends: 123 [2022-11-20 11:21:05,522 INFO L226 Difference]: Without dead ends: 123 [2022-11-20 11:21:05,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 105 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2317 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=602, Invalid=10302, Unknown=24, NotChecked=414, Total=11342 [2022-11-20 11:21:05,524 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 168 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:21:05,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1165 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1784 Invalid, 0 Unknown, 103 Unchecked, 2.1s Time] [2022-11-20 11:21:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-20 11:21:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2022-11-20 11:21:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.21) internal successors, (121), 113 states have internal predecessors, (121), 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-20 11:21:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2022-11-20 11:21:05,529 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 70 [2022-11-20 11:21:05,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:21:05,529 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2022-11-20 11:21:05,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 69 states have (on average 1.710144927536232) internal successors, (118), 62 states have internal predecessors, (118), 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-20 11:21:05,530 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2022-11-20 11:21:05,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-20 11:21:05,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:21:05,531 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:21:05,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-20 11:21:05,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:21:05,739 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:21:05,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:21:05,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1397517466, now seen corresponding path program 2 times [2022-11-20 11:21:05,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:21:05,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528077562] [2022-11-20 11:21:05,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:21:05,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:21:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:21:09,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:21:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:21:09,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:21:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:21:09,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:21:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:21:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:21:09,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:21:09,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528077562] [2022-11-20 11:21:09,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528077562] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:21:09,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779292329] [2022-11-20 11:21:09,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:21:09,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:21:09,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:21:09,994 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:21:10,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-20 11:21:10,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:21:10,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:21:10,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 178 conjunts are in the unsatisfiable core [2022-11-20 11:21:10,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:21:10,622 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-20 11:21:10,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-20 11:21:10,732 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-20 11:21:10,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 11:21:11,083 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:21:11,083 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-20 11:21:11,098 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-20 11:21:11,584 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-20 11:21:11,588 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-20 11:21:11,864 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-20 11:21:11,865 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 16 treesize of output 18 [2022-11-20 11:21:11,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-11-20 11:21:12,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-20 11:21:12,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:21:12,520 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:21:12,520 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-11-20 11:21:12,533 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 22 treesize of output 24 [2022-11-20 11:21:13,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:21:13,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 37 [2022-11-20 11:21:13,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2022-11-20 11:21:13,304 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-20 11:21:13,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:21:14,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:21:14,337 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-20 11:21:14,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:21:14,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:21:14,358 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-20 11:21:14,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:21:14,405 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:21:14,405 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 84 treesize of output 70 [2022-11-20 11:21:14,452 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:21:14,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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-20 11:21:15,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:21:15,948 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-20 11:21:16,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:21:16,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:21:16,456 INFO L321 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2022-11-20 11:21:16,457 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 207 treesize of output 99 [2022-11-20 11:21:16,500 INFO L321 Elim1Store]: treesize reduction 112, result has 17.0 percent of original size [2022-11-20 11:21:16,501 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 78 [2022-11-20 11:21:16,731 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-20 11:21:16,732 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 250 treesize of output 185 [2022-11-20 11:21:16,763 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-20 11:21:16,763 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 195 treesize of output 163 [2022-11-20 11:21:17,903 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 11:21:17,903 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 195 treesize of output 117 [2022-11-20 11:21:18,386 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:21:18,386 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 44 [2022-11-20 11:21:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 32 refuted. 7 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:21:18,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:21:19,035 INFO L321 Elim1Store]: treesize reduction 5, result has 92.1 percent of original size [2022-11-20 11:21:19,035 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 67 treesize of output 66 [2022-11-20 11:21:22,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779292329] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:21:22,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:21:22,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 74 [2022-11-20 11:21:22,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265992310] [2022-11-20 11:21:22,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:21:22,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-20 11:21:22,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:21:22,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-20 11:21:22,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=7704, Unknown=34, NotChecked=0, Total=8010 [2022-11-20 11:21:22,945 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand has 75 states, 72 states have (on average 1.8055555555555556) internal successors, (130), 66 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-20 11:21:28,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:21:28,570 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2022-11-20 11:21:28,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-20 11:21:28,570 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 72 states have (on average 1.8055555555555556) internal successors, (130), 66 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 73 [2022-11-20 11:21:28,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:21:28,571 INFO L225 Difference]: With dead ends: 143 [2022-11-20 11:21:28,571 INFO L226 Difference]: Without dead ends: 143 [2022-11-20 11:21:28,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2393 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=558, Invalid=12061, Unknown=37, NotChecked=0, Total=12656 [2022-11-20 11:21:28,573 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 113 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 506 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:21:28,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1472 Invalid, 2882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2356 Invalid, 0 Unknown, 506 Unchecked, 2.1s Time] [2022-11-20 11:21:28,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-20 11:21:28,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2022-11-20 11:21:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 117 states have internal predecessors, (127), 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-20 11:21:28,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2022-11-20 11:21:28,578 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 73 [2022-11-20 11:21:28,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:21:28,578 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2022-11-20 11:21:28,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 72 states have (on average 1.8055555555555556) internal successors, (130), 66 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-20 11:21:28,579 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2022-11-20 11:21:28,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-20 11:21:28,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:21:28,580 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:21:28,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-20 11:21:28,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-20 11:21:28,783 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:21:28,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:21:28,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1397517467, now seen corresponding path program 2 times [2022-11-20 11:21:28,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:21:28,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006190403] [2022-11-20 11:21:28,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:21:28,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:21:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:21:32,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:21:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:21:32,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:21:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:21:33,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:21:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:21:33,741 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:21:33,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:21:33,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006190403] [2022-11-20 11:21:33,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006190403] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:21:33,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735495250] [2022-11-20 11:21:33,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:21:33,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:21:33,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:21:33,743 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:21:33,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-20 11:21:34,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:21:34,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:21:34,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 186 conjunts are in the unsatisfiable core [2022-11-20 11:21:34,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:21:34,440 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-20 11:21:34,446 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-20 11:21:34,542 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-20 11:21:34,545 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-20 11:21:34,861 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:21:34,861 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-20 11:21:34,866 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-20 11:21:35,321 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-20 11:21:35,328 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-20 11:21:35,619 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:21:35,620 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 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 11:21:35,646 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:21:35,646 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:21:36,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:21:36,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:21:36,291 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:21:36,291 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 56 treesize of output 53 [2022-11-20 11:21:36,302 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 22 treesize of output 24 [2022-11-20 11:21:37,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:21:37,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 42 [2022-11-20 11:21:37,105 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 9 treesize of output 7 [2022-11-20 11:21:37,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:21:37,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:21:37,128 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-20 11:21:38,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:21:38,138 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:21:38,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 75 [2022-11-20 11:21:38,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:21:38,151 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 20 treesize of output 22 [2022-11-20 11:21:38,179 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:21:38,179 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 28 treesize of output 30 [2022-11-20 11:21:38,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:21:38,207 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:21:38,208 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 1 case distinctions, treesize of input 25 treesize of output 30 [2022-11-20 11:21:40,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:21:40,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:21:40,457 INFO L321 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2022-11-20 11:21:40,458 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 196 treesize of output 97 [2022-11-20 11:21:40,508 INFO L321 Elim1Store]: treesize reduction 184, result has 10.7 percent of original size [2022-11-20 11:21:40,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 53 [2022-11-20 11:21:40,819 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-20 11:21:40,819 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 279 treesize of output 196 [2022-11-20 11:21:40,863 INFO L321 Elim1Store]: treesize reduction 126, result has 18.2 percent of original size [2022-11-20 11:21:40,863 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 237 treesize of output 190 [2022-11-20 11:21:44,810 INFO L321 Elim1Store]: treesize reduction 184, result has 59.7 percent of original size [2022-11-20 11:21:44,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 15 new quantified variables, introduced 36 case distinctions, treesize of input 495 treesize of output 489 [2022-11-20 11:21:45,619 INFO L321 Elim1Store]: treesize reduction 136, result has 64.3 percent of original size [2022-11-20 11:21:45,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 497 treesize of output 591 [2022-11-20 11:22:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:22:17,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:22:30,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735495250] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:22:30,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:22:30,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 76 [2022-11-20 11:22:30,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830063673] [2022-11-20 11:22:30,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:22:30,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-20 11:22:30,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:22:30,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-20 11:22:30,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8664, Unknown=16, NotChecked=0, Total=8930 [2022-11-20 11:22:30,212 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand has 77 states, 74 states have (on average 1.7972972972972974) internal successors, (133), 68 states have internal predecessors, (133), 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-20 11:22:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:22:42,141 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2022-11-20 11:22:42,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-20 11:22:42,141 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 74 states have (on average 1.7972972972972974) internal successors, (133), 68 states have internal predecessors, (133), 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 73 [2022-11-20 11:22:42,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:22:42,142 INFO L225 Difference]: With dead ends: 142 [2022-11-20 11:22:42,142 INFO L226 Difference]: Without dead ends: 142 [2022-11-20 11:22:42,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=539, Invalid=15444, Unknown=19, NotChecked=0, Total=16002 [2022-11-20 11:22:42,143 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 67 mSDsluCounter, 1806 mSDsCounter, 0 mSdLazyCounter, 2439 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 533 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:22:42,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1851 Invalid, 3004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2439 Invalid, 0 Unknown, 533 Unchecked, 2.5s Time] [2022-11-20 11:22:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-20 11:22:42,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2022-11-20 11:22:42,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.1983471074380165) internal successors, (145), 134 states have internal predecessors, (145), 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-20 11:22:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2022-11-20 11:22:42,147 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 73 [2022-11-20 11:22:42,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:22:42,148 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2022-11-20 11:22:42,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 74 states have (on average 1.7972972972972974) internal successors, (133), 68 states have internal predecessors, (133), 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-20 11:22:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2022-11-20 11:22:42,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-20 11:22:42,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:42,149 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:22:42,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-20 11:22:42,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-20 11:22:42,358 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:22:42,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:42,358 INFO L85 PathProgramCache]: Analyzing trace with hash 373367201, now seen corresponding path program 2 times [2022-11-20 11:22:42,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:22:42,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348287968] [2022-11-20 11:22:42,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:22:42,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:22:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:45,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:22:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:45,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:22:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:45,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:22:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:47,378 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:22:47,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:22:47,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348287968] [2022-11-20 11:22:47,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348287968] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:22:47,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800485627] [2022-11-20 11:22:47,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:22:47,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:22:47,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:22:47,380 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:22:47,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-20 11:22:48,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:22:48,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:22:48,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 143 conjunts are in the unsatisfiable core [2022-11-20 11:22:48,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:48,077 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-20 11:22:48,182 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-20 11:22:48,467 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:22:48,467 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-20 11:22:48,800 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-20 11:22:48,915 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-20 11:22:48,915 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-20 11:22:49,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:22:49,395 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:22:49,396 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 44 treesize of output 43 [2022-11-20 11:22:49,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:22:49,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 26 [2022-11-20 11:22:49,975 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-20 11:22:50,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:50,599 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-20 11:22:50,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:50,619 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-20 11:22:50,619 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 67 treesize of output 50 [2022-11-20 11:22:50,640 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:22:50,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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-20 11:22:52,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:52,037 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:22:52,066 INFO L321 Elim1Store]: treesize reduction 103, result has 14.9 percent of original size [2022-11-20 11:22:52,067 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 72 [2022-11-20 11:22:52,075 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 53 treesize of output 56 [2022-11-20 11:22:52,297 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-20 11:22:52,298 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 246 treesize of output 177 [2022-11-20 11:22:52,320 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-20 11:22:52,320 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 183 treesize of output 157 [2022-11-20 11:22:53,315 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 183 treesize of output 110 [2022-11-20 11:22:53,817 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-11-20 11:22:53,817 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 39 [2022-11-20 11:22:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:22:53,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:22:54,614 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7840 (Array Int Int)) (v_ArrVal_7841 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7841))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7840))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse4 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) 0)) (not (<= 0 .cse4)))))) is different from false [2022-11-20 11:22:57,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800485627] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:22:57,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:22:57,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 68 [2022-11-20 11:22:57,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62044160] [2022-11-20 11:22:57,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:22:57,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-20 11:22:57,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:22:57,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-20 11:22:57,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=6250, Unknown=18, NotChecked=158, Total=6642 [2022-11-20 11:22:57,344 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 68 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 59 states have internal predecessors, (126), 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-20 11:23:07,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:07,652 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-11-20 11:23:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 11:23:07,652 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 59 states have internal predecessors, (126), 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 74 [2022-11-20 11:23:07,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:07,653 INFO L225 Difference]: With dead ends: 149 [2022-11-20 11:23:07,654 INFO L226 Difference]: Without dead ends: 149 [2022-11-20 11:23:07,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 107 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1341 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=699, Invalid=10843, Unknown=18, NotChecked=212, Total=11772 [2022-11-20 11:23:07,655 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 434 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 2898 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 3202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:07,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 2030 Invalid, 3202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2898 Invalid, 0 Unknown, 249 Unchecked, 3.0s Time] [2022-11-20 11:23:07,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-20 11:23:07,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 141. [2022-11-20 11:23:07,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.1818181818181819) internal successors, (143), 134 states have internal predecessors, (143), 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-20 11:23:07,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 153 transitions. [2022-11-20 11:23:07,659 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 153 transitions. Word has length 74 [2022-11-20 11:23:07,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:07,660 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 153 transitions. [2022-11-20 11:23:07,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 59 states have internal predecessors, (126), 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-20 11:23:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2022-11-20 11:23:07,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-20 11:23:07,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:07,661 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:07,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-11-20 11:23:07,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-20 11:23:07,869 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:23:07,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:07,869 INFO L85 PathProgramCache]: Analyzing trace with hash 345185237, now seen corresponding path program 3 times [2022-11-20 11:23:07,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:07,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776902533] [2022-11-20 11:23:07,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:07,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:07,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:23:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:07,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:23:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:07,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 11:23:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:08,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 11:23:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-20 11:23:08,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:08,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776902533] [2022-11-20 11:23:08,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776902533] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:23:08,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634494065] [2022-11-20 11:23:08,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:23:08,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:23:08,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:23:08,009 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:23:08,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-20 11:23:08,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 11:23:08,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:23:08,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 139 conjunts are in the unsatisfiable core [2022-11-20 11:23:08,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:09,148 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-20 11:23:09,213 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 11:23:09,213 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 37 treesize of output 27 [2022-11-20 11:23:09,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:09,563 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:23:09,564 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 29 treesize of output 35 [2022-11-20 11:23:09,595 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-11-20 11:23:09,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2022-11-20 11:23:09,764 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:23:09,764 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 37 treesize of output 41 [2022-11-20 11:23:09,856 INFO L321 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-11-20 11:23:09,856 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 44 treesize of output 41 [2022-11-20 11:23:09,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:23:10,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:10,043 INFO L321 Elim1Store]: treesize reduction 106, result has 23.7 percent of original size [2022-11-20 11:23:10,044 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 119 treesize of output 88 [2022-11-20 11:23:10,055 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 77 treesize of output 77 [2022-11-20 11:23:10,553 INFO L321 Elim1Store]: treesize reduction 70, result has 13.6 percent of original size [2022-11-20 11:23:10,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 60 [2022-11-20 11:23:10,570 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-20 11:23:10,571 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 1 case distinctions, treesize of input 13 treesize of output 18 [2022-11-20 11:23:10,581 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:23:10,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 11:23:10,826 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_8214 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_8214))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_8213 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_8213))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-11-20 11:23:10,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:10,905 INFO L321 Elim1Store]: treesize reduction 90, result has 15.1 percent of original size [2022-11-20 11:23:10,905 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 164 treesize of output 126 [2022-11-20 11:23:10,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:10,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:10,920 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:23:10,920 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 155 treesize of output 148 [2022-11-20 11:23:10,996 INFO L321 Elim1Store]: treesize reduction 202, result has 33.1 percent of original size [2022-11-20 11:23:10,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 63 treesize of output 117 [2022-11-20 11:23:11,818 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-20 11:23:11,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 164 [2022-11-20 11:23:12,236 INFO L321 Elim1Store]: treesize reduction 46, result has 31.3 percent of original size [2022-11-20 11:23:12,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 71 [2022-11-20 11:23:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 47 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2022-11-20 11:23:12,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:23:13,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634494065] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:23:13,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:23:13,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 33] total 38 [2022-11-20 11:23:13,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970215159] [2022-11-20 11:23:13,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:23:13,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-20 11:23:13,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:13,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-20 11:23:13,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1930, Unknown=3, NotChecked=88, Total=2162 [2022-11-20 11:23:13,241 INFO L87 Difference]: Start difference. First operand 141 states and 153 transitions. Second operand has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-20 11:23:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:14,197 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-11-20 11:23:14,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 11:23:14,198 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 75 [2022-11-20 11:23:14,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:14,199 INFO L225 Difference]: With dead ends: 84 [2022-11-20 11:23:14,199 INFO L226 Difference]: Without dead ends: 84 [2022-11-20 11:23:14,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=232, Invalid=3306, Unknown=6, NotChecked=116, Total=3660 [2022-11-20 11:23:14,202 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 17 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 501 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:14,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 705 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 200 Invalid, 0 Unknown, 501 Unchecked, 0.2s Time] [2022-11-20 11:23:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-20 11:23:14,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-11-20 11:23:14,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 79 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-20 11:23:14,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-11-20 11:23:14,208 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 75 [2022-11-20 11:23:14,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:14,208 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-11-20 11:23:14,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-20 11:23:14,208 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-11-20 11:23:14,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-20 11:23:14,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:14,209 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:14,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:14,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-20 11:23:14,418 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:23:14,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:14,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1310476604, now seen corresponding path program 2 times [2022-11-20 11:23:14,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:14,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178837273] [2022-11-20 11:23:14,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:14,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:17,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:23:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:17,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:23:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:17,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:23:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:19,473 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:23:19,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:19,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178837273] [2022-11-20 11:23:19,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178837273] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:23:19,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932863618] [2022-11-20 11:23:19,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:23:19,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:23:19,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:23:19,475 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:23:19,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-20 11:23:20,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:23:20,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:23:20,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 165 conjunts are in the unsatisfiable core [2022-11-20 11:23:20,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:21,270 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-20 11:23:21,274 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-20 11:23:21,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 7 treesize of output 3 [2022-11-20 11:23:21,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:23:21,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:21,951 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 35 treesize of output 26 [2022-11-20 11:23:21,968 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 11:23:21,968 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-20 11:23:21,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:21,991 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-20 11:23:23,685 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 11:23:23,686 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 21 treesize of output 30 [2022-11-20 11:23:23,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:23,734 INFO L321 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-11-20 11:23:23,734 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 55 treesize of output 52 [2022-11-20 11:23:23,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:23,781 INFO L321 Elim1Store]: treesize reduction 96, result has 17.9 percent of original size [2022-11-20 11:23:23,781 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 65 [2022-11-20 11:23:24,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:24,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:24,069 INFO L321 Elim1Store]: treesize reduction 55, result has 11.3 percent of original size [2022-11-20 11:23:24,069 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 7 new quantified variables, introduced 4 case distinctions, treesize of input 533 treesize of output 170 [2022-11-20 11:23:24,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:24,112 INFO L321 Elim1Store]: treesize reduction 80, result has 25.2 percent of original size [2022-11-20 11:23:24,112 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 7 new quantified variables, introduced 4 case distinctions, treesize of input 485 treesize of output 274 [2022-11-20 11:23:24,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 158 [2022-11-20 11:23:28,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:29,128 INFO L321 Elim1Store]: treesize reduction 56, result has 84.5 percent of original size [2022-11-20 11:23:29,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 28 case distinctions, treesize of input 643 treesize of output 524 [2022-11-20 11:23:29,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:29,674 INFO L321 Elim1Store]: treesize reduction 50, result has 81.0 percent of original size [2022-11-20 11:23:29,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 593 treesize of output 564 [2022-11-20 11:25:43,733 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-20 11:25:43,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 25 [2022-11-20 11:25:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 23 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:25:43,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:25:51,209 INFO L321 Elim1Store]: treesize reduction 4, result has 99.9 percent of original size [2022-11-20 11:25:51,210 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 133436 treesize of output 129311 [2022-11-20 11:26:07,830 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse21 (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_append_~data#1|))) (let ((.cse22 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse1056 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse1053 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse1057 (select (select .cse1053 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1058 (+ (select (select .cse1056 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1055 (select (select .cse1056 .cse1057) .cse1058))) (let ((.cse1046 (+ .cse1055 4)) (.cse1052 (select (select .cse1053 .cse1057) .cse1058))) (let ((.cse1045 (select .cse1053 .cse1052)) (.cse1048 (let ((.cse1054 (store .cse1056 .cse1052 (store (select .cse1056 .cse1052) .cse1046 0)))) (store .cse1054 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1054 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1055))))) (let ((.cse1042 (select (select .cse1048 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1047 (let ((.cse1051 (store .cse1053 .cse1052 (store .cse1045 .cse1046 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse1051 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1051 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1052))))) (let ((.cse1049 (select (select .cse1047 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1050 (+ .cse1042 4))) (let ((.cse1043 (select (select .cse1047 .cse1049) .cse1050)) (.cse1044 (select (select .cse1048 .cse1049) .cse1050))) (let ((.cse1041 (select (select .cse1047 .cse1043) (+ 4 .cse1044)))) (or (= .cse1041 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse1042)) (= .cse1041 .cse1043) (= .cse1044 0) (not (= (select .cse1045 .cse1046) 0)) (not (<= 0 .cse1046)) (not (<= 0 .cse1044)))))))))))))))) (.cse0 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse1038 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse1035 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse1039 (select (select .cse1035 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1040 (+ (select (select .cse1038 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1037 (select (select .cse1038 .cse1039) .cse1040))) (let ((.cse1027 (+ .cse1037 4)) (.cse1034 (select (select .cse1035 .cse1039) .cse1040))) (let ((.cse1026 (select .cse1035 .cse1034)) (.cse1030 (let ((.cse1036 (store .cse1038 .cse1034 (store (select .cse1038 .cse1034) .cse1027 0)))) (store .cse1036 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1036 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1037))))) (let ((.cse1025 (select (select .cse1030 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1029 (let ((.cse1033 (store .cse1035 .cse1034 (store .cse1026 .cse1027 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse1033 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1033 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1034))))) (let ((.cse1031 (select (select .cse1029 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1032 (+ .cse1025 4))) (let ((.cse1023 (select (select .cse1029 .cse1031) .cse1032)) (.cse1028 (select (select .cse1030 .cse1031) .cse1032))) (let ((.cse1024 (select (select .cse1029 .cse1023) (+ 4 .cse1028)))) (or (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse1023) (= .cse1024 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse1025)) (= .cse1024 .cse1023) (not (= (select .cse1026 .cse1027) 0)) (not (<= 0 .cse1027)) (not (<= 0 .cse1028)))))))))))))))) (.cse277 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse1020 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse1017 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse1021 (select (select .cse1017 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1022 (+ (select (select .cse1020 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1019 (select (select .cse1020 .cse1021) .cse1022))) (let ((.cse1012 (+ .cse1019 4)) (.cse1016 (select (select .cse1017 .cse1021) .cse1022))) (let ((.cse1011 (select .cse1017 .cse1016)) (.cse1005 (let ((.cse1018 (store .cse1020 .cse1016 (store (select .cse1020 .cse1016) .cse1012 0)))) (store .cse1018 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1018 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1019))))) (let ((.cse1010 (select (select .cse1005 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1009 (let ((.cse1015 (store .cse1017 .cse1016 (store .cse1011 .cse1012 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse1015 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1015 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1016))))) (let ((.cse1013 (select (select .cse1009 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1014 (+ .cse1010 4))) (let ((.cse1008 (select (select .cse1005 .cse1013) .cse1014))) (let ((.cse1006 (select (select .cse1009 .cse1013) .cse1014)) (.cse1007 (+ 4 .cse1008))) (or (= (select (select .cse1005 .cse1006) .cse1007) .cse1008) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse1006) (= (select (select .cse1009 .cse1006) .cse1007) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse1010)) (not (= (select .cse1011 .cse1012) 0)) (not (<= 0 .cse1012)) (not (<= 0 .cse1008)))))))))))))))) (.cse368 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse1002 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse999 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse1003 (select (select .cse999 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1004 (+ (select (select .cse1002 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1001 (select (select .cse1002 .cse1003) .cse1004))) (let ((.cse994 (+ .cse1001 4)) (.cse998 (select (select .cse999 .cse1003) .cse1004))) (let ((.cse993 (select .cse999 .cse998)) (.cse987 (let ((.cse1000 (store .cse1002 .cse998 (store (select .cse1002 .cse998) .cse994 0)))) (store .cse1000 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1000 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1001))))) (let ((.cse992 (select (select .cse987 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse991 (let ((.cse997 (store .cse999 .cse998 (store .cse993 .cse994 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse997 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse997 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse998))))) (let ((.cse995 (select (select .cse991 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse996 (+ .cse992 4))) (let ((.cse990 (select (select .cse987 .cse995) .cse996))) (let ((.cse988 (select (select .cse991 .cse995) .cse996)) (.cse989 (+ 4 .cse990))) (or (= (select (select .cse987 .cse988) .cse989) .cse990) (= (select (select .cse991 .cse988) .cse989) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse992)) (= .cse990 0) (not (= (select .cse993 .cse994) 0)) (not (<= 0 .cse994)) (not (<= 0 .cse990))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0))))) (.cse787 (not .cse21))) (and .cse0 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse15 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse19 (select (select .cse15 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse20 (+ (select (select .cse18 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse17 (select (select .cse18 .cse19) .cse20))) (let ((.cse7 (+ .cse17 4)) (.cse8 (select (select .cse15 .cse19) .cse20))) (let ((.cse6 (select .cse15 .cse8)) (.cse11 (let ((.cse16 (store .cse18 .cse8 (store (select .cse18 .cse8) .cse7 0)))) (store .cse16 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse16 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse17))))) (let ((.cse5 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (let ((.cse14 (store .cse15 .cse8 (store .cse6 .cse7 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse14 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse14 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse8))))) (let ((.cse12 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (+ .cse5 4))) (let ((.cse2 (select (select .cse11 .cse12) .cse13))) (let ((.cse3 (select (select .cse9 .cse12) .cse13)) (.cse10 (+ 4 .cse2))) (let ((.cse1 (select (select .cse11 .cse3) .cse10)) (.cse4 (select (select .cse9 .cse3) .cse10))) (or (= .cse1 .cse2) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse3) (= .cse4 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse5)) (not (= (select .cse6 .cse7) 0)) (not (= .cse1 .cse7)) (not (<= 0 .cse7)) (not (<= 0 .cse2)) (not (= .cse4 .cse8)))))))))))))))) (or .cse21 (and .cse22 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse38 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse35 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse39 (select (select .cse35 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse40 (+ (select (select .cse38 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse37 (select (select .cse38 .cse39) .cse40))) (let ((.cse30 (+ .cse37 4)) (.cse34 (select (select .cse35 .cse39) .cse40))) (let ((.cse29 (select .cse35 .cse34)) (.cse23 (let ((.cse36 (store .cse38 .cse34 (store (select .cse38 .cse34) .cse30 0)))) (store .cse36 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse36 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse37))))) (let ((.cse26 (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse27 (let ((.cse33 (store .cse35 .cse34 (store .cse29 .cse30 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse33 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse33 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse34))))) (let ((.cse31 (select (select .cse27 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse32 (+ .cse26 4))) (let ((.cse28 (select (select .cse23 .cse31) .cse32))) (let ((.cse25 (+ 4 .cse28)) (.cse24 (select (select .cse27 .cse31) .cse32))) (or (= (select (select .cse23 .cse24) .cse25) 8) (not (<= 0 .cse26)) (= (select (select .cse27 .cse24) .cse25) .cse24) (= .cse28 0) (not (= (select .cse29 .cse30) 0)) (not (<= 0 .cse30)) (not (<= 0 .cse28))))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse56 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse53 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse57 (select (select .cse53 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse58 (+ (select (select .cse56 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse55 (select (select .cse56 .cse57) .cse58))) (let ((.cse48 (+ .cse55 4)) (.cse49 (select (select .cse53 .cse57) .cse58))) (let ((.cse47 (select .cse53 .cse49)) (.cse41 (let ((.cse54 (store .cse56 .cse49 (store (select .cse56 .cse49) .cse48 0)))) (store .cse54 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse54 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse55))))) (let ((.cse46 (select (select .cse41 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse45 (let ((.cse52 (store .cse53 .cse49 (store .cse47 .cse48 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse52 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse52 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse49))))) (let ((.cse50 (select (select .cse45 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse51 (+ .cse46 4))) (let ((.cse44 (select (select .cse41 .cse50) .cse51))) (let ((.cse43 (+ 4 .cse44)) (.cse42 (select (select .cse45 .cse50) .cse51))) (or (= (select (select .cse41 .cse42) .cse43) .cse44) (= (select (select .cse45 .cse42) .cse43) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse46)) (not (= (select .cse47 .cse48) 0)) (not (<= 0 .cse48)) (not (= .cse48 .cse44)) (not (= .cse49 .cse42))))))))))))))) .cse22 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse74 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse71 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse75 (select (select .cse71 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse76 (+ (select (select .cse74 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse73 (select (select .cse74 .cse75) .cse76))) (let ((.cse66 (+ .cse73 4)) (.cse67 (select (select .cse71 .cse75) .cse76))) (let ((.cse65 (select .cse71 .cse67)) (.cse59 (let ((.cse72 (store .cse74 .cse67 (store (select .cse74 .cse67) .cse66 0)))) (store .cse72 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse72 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse73))))) (let ((.cse64 (select (select .cse59 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse63 (let ((.cse70 (store .cse71 .cse67 (store .cse65 .cse66 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse70 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse70 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse67))))) (let ((.cse68 (select (select .cse63 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse69 (+ .cse64 4))) (let ((.cse62 (select (select .cse59 .cse68) .cse69))) (let ((.cse61 (+ 4 .cse62)) (.cse60 (select (select .cse63 .cse68) .cse69))) (or (= (select (select .cse59 .cse60) .cse61) .cse62) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse60) (= (select (select .cse63 .cse60) .cse61) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse64)) (not (= (select .cse65 .cse66) 0)) (not (<= 0 .cse66)) (not (= .cse66 .cse62)) (not (= .cse67 .cse60))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse92 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse89 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse93 (select (select .cse89 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse94 (+ (select (select .cse92 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse91 (select (select .cse92 .cse93) .cse94))) (let ((.cse82 (+ .cse91 4)) (.cse88 (select (select .cse89 .cse93) .cse94))) (let ((.cse81 (select .cse89 .cse88)) (.cse83 (let ((.cse90 (store .cse92 .cse88 (store (select .cse92 .cse88) .cse82 0)))) (store .cse90 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse90 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse91))))) (let ((.cse80 (select (select .cse83 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse86 (let ((.cse87 (store .cse89 .cse88 (store .cse81 .cse82 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse87 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse87 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse88))))) (let ((.cse84 (select (select .cse86 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse85 (+ .cse80 4))) (let ((.cse79 (select (select .cse86 .cse84) .cse85)) (.cse77 (select (select .cse83 .cse84) .cse85))) (let ((.cse78 (select (select .cse83 .cse79) (+ 4 .cse77)))) (or (= 8 .cse77) (= .cse78 .cse77) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse79) (not (<= 0 .cse80)) (= .cse78 0) (not (= (select .cse81 .cse82) 0)) (not (<= 0 .cse82)) (not (<= 0 .cse77))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse110 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse107 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse111 (select (select .cse107 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse112 (+ (select (select .cse110 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse109 (select (select .cse110 .cse111) .cse112))) (let ((.cse102 (+ .cse109 4)) (.cse106 (select (select .cse107 .cse111) .cse112))) (let ((.cse101 (select .cse107 .cse106)) (.cse97 (let ((.cse108 (store .cse110 .cse106 (store (select .cse110 .cse106) .cse102 0)))) (store .cse108 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse108 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse109))))) (let ((.cse96 (select (select .cse97 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse100 (let ((.cse105 (store .cse107 .cse106 (store .cse101 .cse102 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse105 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse105 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse106))))) (let ((.cse103 (select (select .cse100 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse104 (+ .cse96 4))) (let ((.cse95 (select (select .cse97 .cse103) .cse104))) (let ((.cse99 (+ 4 .cse95)) (.cse98 (select (select .cse100 .cse103) .cse104))) (or (= 8 .cse95) (not (<= 0 .cse96)) (= (select (select .cse97 .cse98) .cse99) 0) (= (select (select .cse100 .cse98) .cse99) .cse98) (= .cse95 0) (not (= (select .cse101 .cse102) 0)) (not (<= 0 .cse102)) (not (<= 0 .cse95))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse129 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse126 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse130 (select (select .cse126 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse131 (+ (select (select .cse129 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse128 (select (select .cse129 .cse130) .cse131))) (let ((.cse119 (+ .cse128 4)) (.cse125 (select (select .cse126 .cse130) .cse131))) (let ((.cse118 (select .cse126 .cse125)) (.cse121 (let ((.cse127 (store .cse129 .cse125 (store (select .cse129 .cse125) .cse119 0)))) (store .cse127 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse127 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse128))))) (let ((.cse115 (select (select .cse121 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse116 (let ((.cse124 (store .cse126 .cse125 (store .cse118 .cse119 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse124 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse124 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse125))))) (let ((.cse122 (select (select .cse116 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse123 (+ .cse115 4))) (let ((.cse120 (select (select .cse121 .cse122) .cse123))) (let ((.cse114 (select (select .cse116 .cse122) .cse123)) (.cse117 (+ 4 .cse120))) (let ((.cse113 (select (select .cse121 .cse114) .cse117))) (or (= .cse113 8) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse114) (not (<= 0 .cse115)) (= .cse113 0) (= (select (select .cse116 .cse114) .cse117) .cse114) (not (= (select .cse118 .cse119) 0)) (not (<= 0 .cse119)) (not (<= 0 .cse120)))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (or .cse21 (and .cse0 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse147 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse144 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse148 (select (select .cse144 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse149 (+ (select (select .cse147 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse146 (select (select .cse147 .cse148) .cse149))) (let ((.cse138 (+ .cse146 4)) (.cse143 (select (select .cse144 .cse148) .cse149))) (let ((.cse137 (select .cse144 .cse143)) (.cse132 (let ((.cse145 (store .cse147 .cse143 (store (select .cse147 .cse143) .cse138 0)))) (store .cse145 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse145 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse146))))) (let ((.cse135 (select (select .cse132 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse136 (let ((.cse142 (store .cse144 .cse143 (store .cse137 .cse138 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse142 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse142 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse143))))) (let ((.cse140 (select (select .cse136 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse141 (+ .cse135 4))) (let ((.cse139 (select (select .cse132 .cse140) .cse141))) (let ((.cse134 (+ 4 .cse139)) (.cse133 (select (select .cse136 .cse140) .cse141))) (or (= (select (select .cse132 .cse133) .cse134) 8) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse133) (not (<= 0 .cse135)) (= (select (select .cse136 .cse133) .cse134) .cse133) (not (= (select .cse137 .cse138) 0)) (not (<= 0 .cse138)) (not (<= 0 .cse139))))))))))))))))) (or .cse21 (forall ((v_ArrVal_8525 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8524 (Array Int Int))) (let ((.cse164 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse161 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse165 (select (select .cse161 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse166 (+ (select (select .cse164 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse163 (select (select .cse164 .cse165) .cse166))) (let ((.cse155 (+ .cse163 4)) (.cse160 (select (select .cse161 .cse165) .cse166))) (let ((.cse154 (select .cse161 .cse160)) (.cse156 (let ((.cse162 (store .cse164 .cse160 (store (select .cse164 .cse160) .cse155 0)))) (store .cse162 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse162 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse163))))) (let ((.cse151 (select (select .cse156 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse152 (let ((.cse159 (store .cse161 .cse160 (store .cse154 .cse155 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse159 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse159 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse160))))) (let ((.cse157 (select (select .cse152 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse158 (+ .cse151 4))) (let ((.cse150 (select (select .cse152 .cse157) .cse158)) (.cse153 (select (select .cse156 .cse157) .cse158))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse150) (not (<= 0 .cse151)) (= (select (select .cse152 .cse150) (+ 4 .cse153)) .cse150) (not (= (select .cse154 .cse155) 0)) (not (<= 0 .cse155)) (not (<= 0 .cse153))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse182 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse179 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse183 (select (select .cse179 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse184 (+ (select (select .cse182 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse181 (select (select .cse182 .cse183) .cse184))) (let ((.cse174 (+ .cse181 4)) (.cse175 (select (select .cse179 .cse183) .cse184))) (let ((.cse173 (select .cse179 .cse175)) (.cse169 (let ((.cse180 (store .cse182 .cse175 (store (select .cse182 .cse175) .cse174 0)))) (store .cse180 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse180 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse181))))) (let ((.cse168 (select (select .cse169 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse172 (let ((.cse178 (store .cse179 .cse175 (store .cse173 .cse174 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse178 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse178 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse175))))) (let ((.cse176 (select (select .cse172 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse177 (+ .cse168 4))) (let ((.cse167 (select (select .cse169 .cse176) .cse177))) (let ((.cse171 (+ 4 .cse167)) (.cse170 (select (select .cse172 .cse176) .cse177))) (or (= 8 .cse167) (not (<= 0 .cse168)) (= (select (select .cse169 .cse170) .cse171) 0) (= (select (select .cse172 .cse170) .cse171) .cse170) (not (= (select .cse173 .cse174) 0)) (not (<= 0 .cse174)) (not (= .cse174 .cse167)) (not (= .cse175 .cse170))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse200 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse197 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse201 (select (select .cse197 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse202 (+ (select (select .cse200 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse199 (select (select .cse200 .cse201) .cse202))) (let ((.cse190 (+ .cse199 4)) (.cse196 (select (select .cse197 .cse201) .cse202))) (let ((.cse189 (select .cse197 .cse196)) (.cse191 (let ((.cse198 (store .cse200 .cse196 (store (select .cse200 .cse196) .cse190 0)))) (store .cse198 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse198 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse199))))) (let ((.cse188 (select (select .cse191 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse194 (let ((.cse195 (store .cse197 .cse196 (store .cse189 .cse190 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse195 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse195 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse196))))) (let ((.cse192 (select (select .cse194 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse193 (+ .cse188 4))) (let ((.cse187 (select (select .cse194 .cse192) .cse193)) (.cse186 (select (select .cse191 .cse192) .cse193))) (let ((.cse185 (select (select .cse191 .cse187) (+ 4 .cse186)))) (or (= .cse185 .cse186) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse187) (not (<= 0 .cse188)) (= .cse185 0) (not (= (select .cse189 .cse190) 0)) (not (<= 0 .cse190)) (not (<= 0 .cse186))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse219 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse216 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse220 (select (select .cse216 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse221 (+ (select (select .cse219 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse218 (select (select .cse219 .cse220) .cse221))) (let ((.cse207 (+ .cse218 4)) (.cse211 (select (select .cse216 .cse220) .cse221))) (let ((.cse206 (select .cse216 .cse211)) (.cse208 (let ((.cse217 (store .cse219 .cse211 (store (select .cse219 .cse211) .cse207 0)))) (store .cse217 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse217 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse218))))) (let ((.cse205 (select (select .cse208 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse212 (let ((.cse215 (store .cse216 .cse211 (store .cse206 .cse207 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse215 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse215 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse211))))) (let ((.cse213 (select (select .cse212 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse214 (+ .cse205 4))) (let ((.cse210 (select (select .cse208 .cse213) .cse214))) (let ((.cse203 (select (select .cse212 .cse213) .cse214)) (.cse209 (+ 4 .cse210))) (let ((.cse204 (select (select .cse212 .cse203) .cse209))) (or (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse203) (= .cse204 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse205)) (= .cse204 .cse203) (not (= (select .cse206 .cse207) 0)) (not (= (select (select .cse208 .cse203) .cse209) .cse207)) (not (<= 0 .cse207)) (not (<= 0 .cse210)) (not (= .cse204 .cse211)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse239 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse236 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse240 (select (select .cse236 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse241 (+ (select (select .cse239 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse238 (select (select .cse239 .cse240) .cse241))) (let ((.cse227 (+ .cse238 4)) (.cse228 (select (select .cse236 .cse240) .cse241))) (let ((.cse226 (select .cse236 .cse228)) (.cse232 (let ((.cse237 (store .cse239 .cse228 (store (select .cse239 .cse228) .cse227 0)))) (store .cse237 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse237 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse238))))) (let ((.cse225 (select (select .cse232 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse229 (let ((.cse235 (store .cse236 .cse228 (store .cse226 .cse227 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse235 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse235 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse228))))) (let ((.cse233 (select (select .cse229 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse234 (+ .cse225 4))) (let ((.cse223 (select (select .cse232 .cse233) .cse234))) (let ((.cse230 (select (select .cse229 .cse233) .cse234)) (.cse231 (+ 4 .cse223))) (let ((.cse222 (select (select .cse232 .cse230) .cse231)) (.cse224 (select (select .cse229 .cse230) .cse231))) (or (= .cse222 .cse223) (= .cse224 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse225)) (= .cse223 0) (not (= (select .cse226 .cse227) 0)) (not (= .cse222 .cse227)) (not (<= 0 .cse227)) (not (<= 0 .cse223)) (not (= .cse224 .cse228)))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse256 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse253 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse257 (select (select .cse253 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse258 (+ (select (select .cse256 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse255 (select (select .cse256 .cse257) .cse258))) (let ((.cse246 (+ .cse255 4)) (.cse252 (select (select .cse253 .cse257) .cse258))) (let ((.cse245 (select .cse253 .cse252)) (.cse247 (let ((.cse254 (store .cse256 .cse252 (store (select .cse256 .cse252) .cse246 0)))) (store .cse254 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse254 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse255))))) (let ((.cse244 (select (select .cse247 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse248 (let ((.cse251 (store .cse253 .cse252 (store .cse245 .cse246 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse251 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse251 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse252))))) (let ((.cse249 (select (select .cse248 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse250 (+ .cse244 4))) (let ((.cse242 (select (select .cse247 .cse249) .cse250))) (let ((.cse243 (select (select .cse247 (select (select .cse248 .cse249) .cse250)) (+ 4 .cse242)))) (or (= 8 .cse242) (= .cse243 .cse242) (not (<= 0 .cse244)) (= .cse243 0) (= .cse242 0) (not (= (select .cse245 .cse246) 0)) (not (<= 0 .cse246)) (not (<= 0 .cse242))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse274 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse271 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse275 (select (select .cse271 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse276 (+ (select (select .cse274 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse273 (select (select .cse274 .cse275) .cse276))) (let ((.cse263 (+ .cse273 4)) (.cse265 (select (select .cse271 .cse275) .cse276))) (let ((.cse262 (select .cse271 .cse265)) (.cse267 (let ((.cse272 (store .cse274 .cse265 (store (select .cse274 .cse265) .cse263 0)))) (store .cse272 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse272 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse273))))) (let ((.cse260 (select (select .cse267 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse266 (let ((.cse270 (store .cse271 .cse265 (store .cse262 .cse263 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse270 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse270 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse265))))) (let ((.cse268 (select (select .cse266 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse269 (+ .cse260 4))) (let ((.cse261 (select (select .cse266 .cse268) .cse269)) (.cse264 (select (select .cse267 .cse268) .cse269))) (let ((.cse259 (select (select .cse266 .cse261) (+ 4 .cse264)))) (or (= .cse259 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse260)) (= .cse259 .cse261) (not (= (select .cse262 .cse263) 0)) (not (<= 0 .cse263)) (not (= .cse263 .cse264)) (not (= .cse265 .cse261))))))))))))))) (or .cse21 (and .cse277 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse293 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse290 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse294 (select (select .cse290 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse295 (+ (select (select .cse293 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse292 (select (select .cse293 .cse294) .cse295))) (let ((.cse283 (+ .cse292 4)) (.cse289 (select (select .cse290 .cse294) .cse295))) (let ((.cse282 (select .cse290 .cse289)) (.cse284 (let ((.cse291 (store .cse293 .cse289 (store (select .cse293 .cse289) .cse283 0)))) (store .cse291 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse291 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse292))))) (let ((.cse281 (select (select .cse284 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse287 (let ((.cse288 (store .cse290 .cse289 (store .cse282 .cse283 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse288 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse288 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse289))))) (let ((.cse285 (select (select .cse287 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse286 (+ .cse281 4))) (let ((.cse280 (select (select .cse287 .cse285) .cse286)) (.cse279 (select (select .cse284 .cse285) .cse286))) (let ((.cse278 (select (select .cse284 .cse280) (+ 4 .cse279)))) (or (= .cse278 8) (= .cse278 .cse279) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse280) (not (<= 0 .cse281)) (not (= (select .cse282 .cse283) 0)) (not (<= 0 .cse283)) (not (<= 0 .cse279))))))))))))))))) (or .cse21 (forall ((v_ArrVal_8525 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8524 (Array Int Int))) (let ((.cse310 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse307 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse311 (select (select .cse307 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse312 (+ (select (select .cse310 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse309 (select (select .cse310 .cse311) .cse312))) (let ((.cse301 (+ .cse309 4)) (.cse302 (select (select .cse307 .cse311) .cse312))) (let ((.cse300 (select .cse307 .cse302)) (.cse297 (let ((.cse308 (store .cse310 .cse302 (store (select .cse310 .cse302) .cse301 0)))) (store .cse308 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse308 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse309))))) (let ((.cse299 (select (select .cse297 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse303 (let ((.cse306 (store .cse307 .cse302 (store .cse300 .cse301 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse306 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse306 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse302))))) (let ((.cse304 (select (select .cse303 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse305 (+ .cse299 4))) (let ((.cse296 (select (select .cse297 .cse304) .cse305)) (.cse298 (select (select .cse303 .cse304) .cse305))) (or (= 8 .cse296) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (= (select (select .cse297 .cse298) (+ 4 .cse296)) .cse296) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (not (<= 0 .cse299)) (not (= (select .cse300 .cse301) 0)) (not (<= 0 .cse301)) (not (= .cse301 .cse296)) (not (= .cse302 .cse298))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse330 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse327 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse331 (select (select .cse327 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse332 (+ (select (select .cse330 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse329 (select (select .cse330 .cse331) .cse332))) (let ((.cse319 (+ .cse329 4)) (.cse320 (select (select .cse327 .cse331) .cse332))) (let ((.cse318 (select .cse327 .cse320)) (.cse323 (let ((.cse328 (store .cse330 .cse320 (store (select .cse330 .cse320) .cse319 0)))) (store .cse328 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse328 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse329))))) (let ((.cse314 (select (select .cse323 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse321 (let ((.cse326 (store .cse327 .cse320 (store .cse318 .cse319 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse326 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse326 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse320))))) (let ((.cse324 (select (select .cse321 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse325 (+ .cse314 4))) (let ((.cse317 (select (select .cse323 .cse324) .cse325))) (let ((.cse316 (select (select .cse321 .cse324) .cse325)) (.cse322 (+ 4 .cse317))) (let ((.cse313 (select (select .cse323 .cse316) .cse322)) (.cse315 (select (select .cse321 .cse316) .cse322))) (or (= .cse313 8) (not (<= 0 .cse314)) (= .cse315 .cse316) (= .cse317 0) (not (= (select .cse318 .cse319) 0)) (not (= .cse313 .cse319)) (not (<= 0 .cse319)) (not (<= 0 .cse317)) (not (= .cse315 .cse320)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse348 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse345 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse349 (select (select .cse345 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse350 (+ (select (select .cse348 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse347 (select (select .cse348 .cse349) .cse350))) (let ((.cse339 (+ .cse347 4)) (.cse341 (select (select .cse345 .cse349) .cse350))) (let ((.cse338 (select .cse345 .cse341)) (.cse334 (let ((.cse346 (store .cse348 .cse341 (store (select .cse348 .cse341) .cse339 0)))) (store .cse346 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse346 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse347))))) (let ((.cse333 (select (select .cse334 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse337 (let ((.cse344 (store .cse345 .cse341 (store .cse338 .cse339 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse344 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse344 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse341))))) (let ((.cse342 (select (select .cse337 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse343 (+ .cse333 4))) (let ((.cse340 (select (select .cse334 .cse342) .cse343))) (let ((.cse336 (+ 4 .cse340)) (.cse335 (select (select .cse337 .cse342) .cse343))) (or (not (<= 0 .cse333)) (= (select (select .cse334 .cse335) .cse336) 0) (= (select (select .cse337 .cse335) .cse336) .cse335) (not (= (select .cse338 .cse339) 0)) (not (<= 0 .cse339)) (not (= .cse339 .cse340)) (not (= .cse341 .cse335))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (or .cse21 (forall ((v_ArrVal_8525 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8524 (Array Int Int))) (let ((.cse365 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse362 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse366 (select (select .cse362 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse367 (+ (select (select .cse365 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse364 (select (select .cse365 .cse366) .cse367))) (let ((.cse356 (+ .cse364 4)) (.cse357 (select (select .cse362 .cse366) .cse367))) (let ((.cse355 (select .cse362 .cse357)) (.cse360 (let ((.cse363 (store .cse365 .cse357 (store (select .cse365 .cse357) .cse356 0)))) (store .cse363 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse363 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse364))))) (let ((.cse351 (select (select .cse360 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse352 (let ((.cse361 (store .cse362 .cse357 (store .cse355 .cse356 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse361 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse361 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse357))))) (let ((.cse358 (select (select .cse352 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse359 (+ .cse351 4))) (let ((.cse354 (select (select .cse360 .cse358) .cse359)) (.cse353 (select (select .cse352 .cse358) .cse359))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (not (<= 0 .cse351)) (= (select (select .cse352 .cse353) (+ 4 .cse354)) .cse353) (not (= (select .cse355 .cse356) 0)) (not (<= 0 .cse356)) (not (= .cse356 .cse354)) (not (= .cse357 .cse353))))))))))))) (or .cse21 (and .cse368 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse383 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse380 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse384 (select (select .cse380 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse385 (+ (select (select .cse383 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse382 (select (select .cse383 .cse384) .cse385))) (let ((.cse373 (+ .cse382 4)) (.cse379 (select (select .cse380 .cse384) .cse385))) (let ((.cse372 (select .cse380 .cse379)) (.cse374 (let ((.cse381 (store .cse383 .cse379 (store (select .cse383 .cse379) .cse373 0)))) (store .cse381 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse381 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse382))))) (let ((.cse371 (select (select .cse374 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse375 (let ((.cse378 (store .cse380 .cse379 (store .cse372 .cse373 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse378 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse378 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse379))))) (let ((.cse376 (select (select .cse375 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse377 (+ .cse371 4))) (let ((.cse370 (select (select .cse374 .cse376) .cse377))) (let ((.cse369 (select (select .cse374 (select (select .cse375 .cse376) .cse377)) (+ 4 .cse370)))) (or (= .cse369 8) (= .cse369 .cse370) (not (<= 0 .cse371)) (= .cse370 0) (not (= (select .cse372 .cse373) 0)) (not (<= 0 .cse373)) (not (<= 0 .cse370))))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse402 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse399 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse403 (select (select .cse399 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse404 (+ (select (select .cse402 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse401 (select (select .cse402 .cse403) .cse404))) (let ((.cse390 (+ .cse401 4)) (.cse394 (select (select .cse399 .cse403) .cse404))) (let ((.cse389 (select .cse399 .cse394)) (.cse395 (let ((.cse400 (store .cse402 .cse394 (store (select .cse402 .cse394) .cse390 0)))) (store .cse400 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse400 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse401))))) (let ((.cse388 (select (select .cse395 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse391 (let ((.cse398 (store .cse399 .cse394 (store .cse389 .cse390 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse398 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse398 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse394))))) (let ((.cse396 (select (select .cse391 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse397 (+ .cse388 4))) (let ((.cse387 (select (select .cse395 .cse396) .cse397))) (let ((.cse392 (select (select .cse391 .cse396) .cse397)) (.cse393 (+ 4 .cse387))) (let ((.cse386 (select (select .cse395 .cse392) .cse393))) (or (= .cse386 8) (= .cse386 .cse387) (not (<= 0 .cse388)) (= .cse387 0) (not (= (select .cse389 .cse390) 0)) (not (= .cse386 .cse390)) (not (<= 0 .cse390)) (not (<= 0 .cse387)) (not (= (select (select .cse391 .cse392) .cse393) .cse394)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse420 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse417 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse421 (select (select .cse417 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse422 (+ (select (select .cse420 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse419 (select (select .cse420 .cse421) .cse422))) (let ((.cse411 (+ .cse419 4)) (.cse413 (select (select .cse417 .cse421) .cse422))) (let ((.cse410 (select .cse417 .cse413)) (.cse407 (let ((.cse418 (store .cse420 .cse413 (store (select .cse420 .cse413) .cse411 0)))) (store .cse418 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse418 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse419))))) (let ((.cse406 (select (select .cse407 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse409 (let ((.cse416 (store .cse417 .cse413 (store .cse410 .cse411 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse416 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse416 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse413))))) (let ((.cse414 (select (select .cse409 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse415 (+ .cse406 4))) (let ((.cse412 (select (select .cse407 .cse414) .cse415))) (let ((.cse408 (+ 4 .cse412)) (.cse405 (select (select .cse409 .cse414) .cse415))) (or (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse405) (not (<= 0 .cse406)) (= (select (select .cse407 .cse405) .cse408) 0) (= (select (select .cse409 .cse405) .cse408) .cse405) (not (= (select .cse410 .cse411) 0)) (not (<= 0 .cse411)) (not (= .cse411 .cse412)) (not (= .cse413 .cse405))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse438 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse435 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse439 (select (select .cse435 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse440 (+ (select (select .cse438 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse437 (select (select .cse438 .cse439) .cse440))) (let ((.cse428 (+ .cse437 4)) (.cse434 (select (select .cse435 .cse439) .cse440))) (let ((.cse427 (select .cse435 .cse434)) (.cse429 (let ((.cse436 (store .cse438 .cse434 (store (select .cse438 .cse434) .cse428 0)))) (store .cse436 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse436 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse437))))) (let ((.cse426 (select (select .cse429 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse432 (let ((.cse433 (store .cse435 .cse434 (store .cse427 .cse428 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse433 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse433 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse434))))) (let ((.cse430 (select (select .cse432 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse431 (+ .cse426 4))) (let ((.cse425 (select (select .cse432 .cse430) .cse431)) (.cse424 (select (select .cse429 .cse430) .cse431))) (let ((.cse423 (select (select .cse429 .cse425) (+ 4 .cse424)))) (or (= .cse423 8) (= .cse423 .cse424) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse425) (not (<= 0 .cse426)) (= .cse423 0) (not (= (select .cse427 .cse428) 0)) (not (<= 0 .cse428)) (not (<= 0 .cse424))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse456 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse453 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse457 (select (select .cse453 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse458 (+ (select (select .cse456 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse455 (select (select .cse456 .cse457) .cse458))) (let ((.cse448 (+ .cse455 4)) (.cse449 (select (select .cse453 .cse457) .cse458))) (let ((.cse447 (select .cse453 .cse449)) (.cse442 (let ((.cse454 (store .cse456 .cse449 (store (select .cse456 .cse449) .cse448 0)))) (store .cse454 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse454 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse455))))) (let ((.cse446 (select (select .cse442 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse445 (let ((.cse452 (store .cse453 .cse449 (store .cse447 .cse448 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse452 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse452 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse449))))) (let ((.cse450 (select (select .cse445 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse451 (+ .cse446 4))) (let ((.cse441 (select (select .cse442 .cse450) .cse451))) (let ((.cse444 (+ 4 .cse441)) (.cse443 (select (select .cse445 .cse450) .cse451))) (or (= 8 .cse441) (= (select (select .cse442 .cse443) .cse444) .cse441) (= (select (select .cse445 .cse443) .cse444) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse446)) (not (= (select .cse447 .cse448) 0)) (not (<= 0 .cse448)) (not (= .cse448 .cse441)) (not (= .cse449 .cse443))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse473 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse470 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse474 (select (select .cse470 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse475 (+ (select (select .cse473 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse472 (select (select .cse473 .cse474) .cse475))) (let ((.cse463 (+ .cse472 4)) (.cse469 (select (select .cse470 .cse474) .cse475))) (let ((.cse462 (select .cse470 .cse469)) (.cse464 (let ((.cse471 (store .cse473 .cse469 (store (select .cse473 .cse469) .cse463 0)))) (store .cse471 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse471 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse472))))) (let ((.cse461 (select (select .cse464 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse465 (let ((.cse468 (store .cse470 .cse469 (store .cse462 .cse463 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse468 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse468 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse469))))) (let ((.cse466 (select (select .cse465 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse467 (+ .cse461 4))) (let ((.cse460 (select (select .cse464 .cse466) .cse467))) (let ((.cse459 (select (select .cse464 (select (select .cse465 .cse466) .cse467)) (+ 4 .cse460)))) (or (= .cse459 8) (= .cse459 .cse460) (not (<= 0 .cse461)) (= .cse459 0) (= .cse460 0) (not (= (select .cse462 .cse463) 0)) (not (<= 0 .cse463)) (not (<= 0 .cse460))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse492 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse489 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse493 (select (select .cse489 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse494 (+ (select (select .cse492 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse491 (select (select .cse492 .cse493) .cse494))) (let ((.cse482 (+ .cse491 4)) (.cse488 (select (select .cse489 .cse493) .cse494))) (let ((.cse481 (select .cse489 .cse488)) (.cse479 (let ((.cse490 (store .cse492 .cse488 (store (select .cse492 .cse488) .cse482 0)))) (store .cse490 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse490 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse491))))) (let ((.cse478 (select (select .cse479 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse484 (let ((.cse487 (store .cse489 .cse488 (store .cse481 .cse482 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse487 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse487 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse488))))) (let ((.cse485 (select (select .cse484 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse486 (+ .cse478 4))) (let ((.cse483 (select (select .cse479 .cse485) .cse486))) (let ((.cse476 (select (select .cse484 .cse485) .cse486)) (.cse480 (+ 4 .cse483))) (let ((.cse477 (select (select .cse484 .cse476) .cse480))) (or (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse476) (= .cse477 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse478)) (= (select (select .cse479 .cse476) .cse480) 0) (= .cse477 .cse476) (not (= (select .cse481 .cse482) 0)) (not (<= 0 .cse482)) (not (<= 0 .cse483)))))))))))))))) (or .cse21 (forall ((v_ArrVal_8525 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8524 (Array Int Int))) (let ((.cse509 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse506 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse510 (select (select .cse506 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse511 (+ (select (select .cse509 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse508 (select (select .cse509 .cse510) .cse511))) (let ((.cse500 (+ .cse508 4)) (.cse501 (select (select .cse506 .cse510) .cse511))) (let ((.cse499 (select .cse506 .cse501)) (.cse495 (let ((.cse507 (store .cse509 .cse501 (store (select .cse509 .cse501) .cse500 0)))) (store .cse507 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse507 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse508))))) (let ((.cse498 (select (select .cse495 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse502 (let ((.cse505 (store .cse506 .cse501 (store .cse499 .cse500 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse505 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse505 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse501))))) (let ((.cse503 (select (select .cse502 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse504 (+ .cse498 4))) (let ((.cse497 (select (select .cse495 .cse503) .cse504)) (.cse496 (select (select .cse502 .cse503) .cse504))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (= (select (select .cse495 .cse496) (+ 4 .cse497)) .cse497) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse496) (not (<= 0 .cse498)) (not (= (select .cse499 .cse500) 0)) (not (<= 0 .cse500)) (not (= .cse500 .cse497)) (not (= .cse501 .cse496))))))))))))) (or (forall ((v_ArrVal_8525 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8524 (Array Int Int))) (let ((.cse526 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse523 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse527 (select (select .cse523 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse528 (+ (select (select .cse526 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse525 (select (select .cse526 .cse527) .cse528))) (let ((.cse517 (+ .cse525 4)) (.cse522 (select (select .cse523 .cse527) .cse528))) (let ((.cse516 (select .cse523 .cse522)) (.cse512 (let ((.cse524 (store .cse526 .cse522 (store (select .cse526 .cse522) .cse517 0)))) (store .cse524 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse524 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse525))))) (let ((.cse515 (select (select .cse512 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse520 (let ((.cse521 (store .cse523 .cse522 (store .cse516 .cse517 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse521 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse521 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse522))))) (let ((.cse518 (select (select .cse520 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse519 (+ .cse515 4))) (let ((.cse513 (select (select .cse520 .cse518) .cse519)) (.cse514 (select (select .cse512 .cse518) .cse519))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (= (select (select .cse512 .cse513) (+ 4 .cse514)) .cse514) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse513) (not (<= 0 .cse515)) (not (= (select .cse516 .cse517) 0)) (not (<= 0 .cse517)) (not (<= 0 .cse514)))))))))))) .cse21) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse545 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse542 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse546 (select (select .cse542 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse547 (+ (select (select .cse545 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse544 (select (select .cse545 .cse546) .cse547))) (let ((.cse534 (+ .cse544 4)) (.cse537 (select (select .cse542 .cse546) .cse547))) (let ((.cse533 (select .cse542 .cse537)) (.cse535 (let ((.cse543 (store .cse545 .cse537 (store (select .cse545 .cse537) .cse534 0)))) (store .cse543 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse543 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse544))))) (let ((.cse530 (select (select .cse535 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse538 (let ((.cse541 (store .cse542 .cse537 (store .cse533 .cse534 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse541 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse541 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse537))))) (let ((.cse539 (select (select .cse538 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse540 (+ .cse530 4))) (let ((.cse532 (select (select .cse535 .cse539) .cse540))) (let ((.cse531 (select (select .cse538 .cse539) .cse540)) (.cse536 (+ 4 .cse532))) (let ((.cse529 (select (select .cse538 .cse531) .cse536))) (or (= .cse529 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse530)) (= .cse529 .cse531) (= .cse532 0) (not (= (select .cse533 .cse534) 0)) (not (= (select (select .cse535 .cse531) .cse536) .cse534)) (not (<= 0 .cse534)) (not (<= 0 .cse532)) (not (= .cse529 .cse537)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse563 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse560 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse564 (select (select .cse560 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse565 (+ (select (select .cse563 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse562 (select (select .cse563 .cse564) .cse565))) (let ((.cse555 (+ .cse562 4)) (.cse559 (select (select .cse560 .cse564) .cse565))) (let ((.cse554 (select .cse560 .cse559)) (.cse551 (let ((.cse561 (store .cse563 .cse559 (store (select .cse563 .cse559) .cse555 0)))) (store .cse561 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse561 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse562))))) (let ((.cse550 (select (select .cse551 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse553 (let ((.cse558 (store .cse560 .cse559 (store .cse554 .cse555 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse558 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse558 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse559))))) (let ((.cse556 (select (select .cse553 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse557 (+ .cse550 4))) (let ((.cse548 (select (select .cse551 .cse556) .cse557))) (let ((.cse552 (+ 4 .cse548)) (.cse549 (select (select .cse553 .cse556) .cse557))) (or (= 8 .cse548) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse549) (not (<= 0 .cse550)) (= (select (select .cse551 .cse549) .cse552) 0) (= (select (select .cse553 .cse549) .cse552) .cse549) (not (= (select .cse554 .cse555) 0)) (not (<= 0 .cse555)) (not (<= 0 .cse548))))))))))))))) (or (forall ((v_ArrVal_8525 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8524 (Array Int Int))) (let ((.cse580 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse577 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse581 (select (select .cse577 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse582 (+ (select (select .cse580 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse579 (select (select .cse580 .cse581) .cse582))) (let ((.cse571 (+ .cse579 4)) (.cse572 (select (select .cse577 .cse581) .cse582))) (let ((.cse570 (select .cse577 .cse572)) (.cse575 (let ((.cse578 (store .cse580 .cse572 (store (select .cse580 .cse572) .cse571 0)))) (store .cse578 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse578 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse579))))) (let ((.cse567 (select (select .cse575 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse568 (let ((.cse576 (store .cse577 .cse572 (store .cse570 .cse571 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse576 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse576 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse572))))) (let ((.cse573 (select (select .cse568 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse574 (+ .cse567 4))) (let ((.cse569 (select (select .cse575 .cse573) .cse574)) (.cse566 (select (select .cse568 .cse573) .cse574))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse566) (not (<= 0 .cse567)) (= (select (select .cse568 .cse566) (+ 4 .cse569)) .cse566) (not (= (select .cse570 .cse571) 0)) (not (<= 0 .cse571)) (not (= .cse571 .cse569)) (not (= .cse572 .cse566)))))))))))) .cse21) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse599 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse596 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse600 (select (select .cse596 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse601 (+ (select (select .cse599 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse598 (select (select .cse599 .cse600) .cse601))) (let ((.cse590 (+ .cse598 4)) (.cse595 (select (select .cse596 .cse600) .cse601))) (let ((.cse589 (select .cse596 .cse595)) (.cse591 (let ((.cse597 (store .cse599 .cse595 (store (select .cse599 .cse595) .cse590 0)))) (store .cse597 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse597 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse598))))) (let ((.cse588 (select (select .cse591 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse585 (let ((.cse594 (store .cse596 .cse595 (store .cse589 .cse590 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse594 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse594 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse595))))) (let ((.cse592 (select (select .cse585 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse593 (+ .cse588 4))) (let ((.cse584 (select (select .cse591 .cse592) .cse593))) (let ((.cse586 (select (select .cse585 .cse592) .cse593)) (.cse587 (+ 4 .cse584))) (let ((.cse583 (select (select .cse591 .cse586) .cse587))) (or (= .cse583 .cse584) (= (select (select .cse585 .cse586) .cse587) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse588)) (= .cse583 0) (= .cse584 0) (not (= (select .cse589 .cse590) 0)) (not (<= 0 .cse590)) (not (<= 0 .cse584)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse617 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse614 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse618 (select (select .cse614 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse619 (+ (select (select .cse617 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse616 (select (select .cse617 .cse618) .cse619))) (let ((.cse606 (+ .cse616 4)) (.cse607 (select (select .cse614 .cse618) .cse619))) (let ((.cse605 (select .cse614 .cse607)) (.cse609 (let ((.cse615 (store .cse617 .cse607 (store (select .cse617 .cse607) .cse606 0)))) (store .cse615 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse615 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse616))))) (let ((.cse604 (select (select .cse609 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse612 (let ((.cse613 (store .cse614 .cse607 (store .cse605 .cse606 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse613 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse613 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse607))))) (let ((.cse610 (select (select .cse612 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse611 (+ .cse604 4))) (let ((.cse608 (select (select .cse612 .cse610) .cse611)) (.cse603 (select (select .cse609 .cse610) .cse611))) (let ((.cse602 (select (select .cse609 .cse608) (+ 4 .cse603)))) (or (= .cse602 .cse603) (not (<= 0 .cse604)) (= .cse602 0) (not (= (select .cse605 .cse606) 0)) (not (<= 0 .cse606)) (not (= .cse606 .cse603)) (not (= .cse607 .cse608))))))))))))))) (or (forall ((v_ArrVal_8525 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8524 (Array Int Int))) (let ((.cse634 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse631 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse635 (select (select .cse631 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse636 (+ (select (select .cse634 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse633 (select (select .cse634 .cse635) .cse636))) (let ((.cse625 (+ .cse633 4)) (.cse626 (select (select .cse631 .cse635) .cse636))) (let ((.cse624 (select .cse631 .cse626)) (.cse620 (let ((.cse632 (store .cse634 .cse626 (store (select .cse634 .cse626) .cse625 0)))) (store .cse632 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse632 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse633))))) (let ((.cse623 (select (select .cse620 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse627 (let ((.cse630 (store .cse631 .cse626 (store .cse624 .cse625 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse630 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse630 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse626))))) (let ((.cse628 (select (select .cse627 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse629 (+ .cse623 4))) (let ((.cse622 (select (select .cse620 .cse628) .cse629)) (.cse621 (select (select .cse627 .cse628) .cse629))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (= (select (select .cse620 .cse621) (+ 4 .cse622)) .cse622) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (not (<= 0 .cse623)) (not (= (select .cse624 .cse625) 0)) (not (<= 0 .cse625)) (not (= .cse625 .cse622)) (not (= .cse626 .cse621)))))))))))) .cse21) .cse277 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse653 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse650 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse654 (select (select .cse650 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse655 (+ (select (select .cse653 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse652 (select (select .cse653 .cse654) .cse655))) (let ((.cse642 (+ .cse652 4)) (.cse645 (select (select .cse650 .cse654) .cse655))) (let ((.cse641 (select .cse650 .cse645)) (.cse646 (let ((.cse651 (store .cse653 .cse645 (store (select .cse653 .cse645) .cse642 0)))) (store .cse651 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse651 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse652))))) (let ((.cse640 (select (select .cse646 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse643 (let ((.cse649 (store .cse650 .cse645 (store .cse641 .cse642 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse649 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse649 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse645))))) (let ((.cse647 (select (select .cse643 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse648 (+ .cse640 4))) (let ((.cse638 (select (select .cse646 .cse647) .cse648))) (let ((.cse639 (select (select .cse643 .cse647) .cse648)) (.cse644 (+ 4 .cse638))) (let ((.cse637 (select (select .cse646 .cse639) .cse644))) (or (= .cse637 8) (= .cse637 .cse638) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse639) (not (<= 0 .cse640)) (not (= (select .cse641 .cse642) 0)) (not (= .cse637 .cse642)) (not (<= 0 .cse642)) (not (<= 0 .cse638)) (not (= (select (select .cse643 .cse639) .cse644) .cse645)))))))))))))))) .cse368 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse671 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse668 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse672 (select (select .cse668 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse673 (+ (select (select .cse671 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse670 (select (select .cse671 .cse672) .cse673))) (let ((.cse661 (+ .cse670 4)) (.cse662 (select (select .cse668 .cse672) .cse673))) (let ((.cse660 (select .cse668 .cse662)) (.cse664 (let ((.cse669 (store .cse671 .cse662 (store (select .cse671 .cse662) .cse661 0)))) (store .cse669 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse669 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse670))))) (let ((.cse658 (select (select .cse664 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse663 (let ((.cse667 (store .cse668 .cse662 (store .cse660 .cse661 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse667 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse667 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse662))))) (let ((.cse665 (select (select .cse663 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse666 (+ .cse658 4))) (let ((.cse659 (select (select .cse663 .cse665) .cse666)) (.cse656 (select (select .cse664 .cse665) .cse666))) (let ((.cse657 (select (select .cse663 .cse659) (+ 4 .cse656)))) (or (= 8 .cse656) (= .cse657 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse658)) (= .cse657 .cse659) (not (= (select .cse660 .cse661) 0)) (not (<= 0 .cse661)) (not (= .cse661 .cse656)) (not (= .cse662 .cse659))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse691 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse688 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse692 (select (select .cse688 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse693 (+ (select (select .cse691 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse690 (select (select .cse691 .cse692) .cse693))) (let ((.cse679 (+ .cse690 4)) (.cse681 (select (select .cse688 .cse692) .cse693))) (let ((.cse678 (select .cse688 .cse681)) (.cse684 (let ((.cse689 (store .cse691 .cse681 (store (select .cse691 .cse681) .cse679 0)))) (store .cse689 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse689 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse690))))) (let ((.cse676 (select (select .cse684 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse682 (let ((.cse687 (store .cse688 .cse681 (store .cse678 .cse679 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse687 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse687 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse681))))) (let ((.cse685 (select (select .cse682 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse686 (+ .cse676 4))) (let ((.cse680 (select (select .cse684 .cse685) .cse686))) (let ((.cse675 (select (select .cse682 .cse685) .cse686)) (.cse683 (+ 4 .cse680))) (let ((.cse674 (select (select .cse684 .cse675) .cse683)) (.cse677 (select (select .cse682 .cse675) .cse683))) (or (= .cse674 8) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse675) (not (<= 0 .cse676)) (= .cse677 .cse675) (not (= (select .cse678 .cse679) 0)) (not (= .cse674 .cse679)) (not (<= 0 .cse679)) (not (<= 0 .cse680)) (not (= .cse677 .cse681)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse710 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse707 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse711 (select (select .cse707 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse712 (+ (select (select .cse710 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse709 (select (select .cse710 .cse711) .cse712))) (let ((.cse701 (+ .cse709 4)) (.cse706 (select (select .cse707 .cse711) .cse712))) (let ((.cse700 (select .cse707 .cse706)) (.cse702 (let ((.cse708 (store .cse710 .cse706 (store (select .cse710 .cse706) .cse701 0)))) (store .cse708 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse708 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse709))))) (let ((.cse695 (select (select .cse702 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse696 (let ((.cse705 (store .cse707 .cse706 (store .cse700 .cse701 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse705 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse705 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse706))))) (let ((.cse703 (select (select .cse696 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse704 (+ .cse695 4))) (let ((.cse699 (select (select .cse702 .cse703) .cse704))) (let ((.cse697 (select (select .cse696 .cse703) .cse704)) (.cse698 (+ 4 .cse699))) (let ((.cse694 (select (select .cse702 .cse697) .cse698))) (or (= .cse694 8) (not (<= 0 .cse695)) (= .cse694 0) (= (select (select .cse696 .cse697) .cse698) .cse697) (= .cse699 0) (not (= (select .cse700 .cse701) 0)) (not (<= 0 .cse701)) (not (<= 0 .cse699)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse729 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse726 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse730 (select (select .cse726 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse731 (+ (select (select .cse729 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse728 (select (select .cse729 .cse730) .cse731))) (let ((.cse718 (+ .cse728 4)) (.cse721 (select (select .cse726 .cse730) .cse731))) (let ((.cse717 (select .cse726 .cse721)) (.cse722 (let ((.cse727 (store .cse729 .cse721 (store (select .cse729 .cse721) .cse718 0)))) (store .cse727 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse727 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse728))))) (let ((.cse716 (select (select .cse722 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse719 (let ((.cse725 (store .cse726 .cse721 (store .cse717 .cse718 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse725 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse725 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse721))))) (let ((.cse723 (select (select .cse719 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse724 (+ .cse716 4))) (let ((.cse714 (select (select .cse722 .cse723) .cse724))) (let ((.cse715 (select (select .cse719 .cse723) .cse724)) (.cse720 (+ 4 .cse714))) (let ((.cse713 (select (select .cse722 .cse715) .cse720))) (or (= .cse713 .cse714) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse715) (not (<= 0 .cse716)) (not (= (select .cse717 .cse718) 0)) (not (= .cse713 .cse718)) (not (<= 0 .cse718)) (not (<= 0 .cse714)) (not (= (select (select .cse719 .cse715) .cse720) .cse721)))))))))))))))) (or (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse747 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse744 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse748 (select (select .cse744 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse749 (+ (select (select .cse747 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse746 (select (select .cse747 .cse748) .cse749))) (let ((.cse733 (+ .cse746 4)) (.cse743 (select (select .cse744 .cse748) .cse749))) (let ((.cse735 (select .cse744 .cse743)) (.cse739 (let ((.cse745 (store .cse747 .cse743 (store (select .cse747 .cse743) .cse733 0)))) (store .cse745 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse745 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse746))))) (let ((.cse736 (select (select .cse739 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse738 (let ((.cse742 (store .cse744 .cse743 (store .cse735 .cse733 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse742 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse742 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse743))))) (let ((.cse740 (select (select .cse738 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse741 (+ .cse736 4))) (let ((.cse734 (select (select .cse738 .cse740) .cse741)) (.cse737 (select (select .cse739 .cse740) .cse741))) (let ((.cse732 (select (select .cse738 .cse734) (+ 4 .cse737)))) (or (= .cse732 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (< .cse733 0) (= .cse732 .cse734) (not (= (select .cse735 .cse733) 0)) (< .cse736 0) (not (= .cse737 0))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse766 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse763 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse767 (select (select .cse763 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse768 (+ (select (select .cse766 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse765 (select (select .cse766 .cse767) .cse768))) (let ((.cse750 (+ .cse765 4)) (.cse757 (select (select .cse763 .cse767) .cse768))) (let ((.cse753 (select .cse763 .cse757)) (.cse754 (let ((.cse764 (store .cse766 .cse757 (store (select .cse766 .cse757) .cse750 0)))) (store .cse764 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse764 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse765))))) (let ((.cse756 (select (select .cse754 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse759 (let ((.cse762 (store .cse763 .cse757 (store .cse753 .cse750 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse762 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse762 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse757))))) (let ((.cse760 (select (select .cse759 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse761 (+ .cse756 4))) (let ((.cse758 (select (select .cse754 .cse760) .cse761))) (let ((.cse752 (select (select .cse759 .cse760) .cse761)) (.cse755 (+ 4 .cse758))) (let ((.cse751 (select (select .cse759 .cse752) .cse755))) (or (< .cse750 0) (= .cse751 .cse752) (not (= (select .cse753 .cse750) 0)) (not (= (select (select .cse754 .cse752) .cse755) .cse750)) (< .cse756 0) (not (= .cse751 .cse757)) (not (= .cse758 0)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse784 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse781 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse785 (select (select .cse781 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse786 (+ (select (select .cse784 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse783 (select (select .cse784 .cse785) .cse786))) (let ((.cse769 (+ .cse783 4)) (.cse780 (select (select .cse781 .cse785) .cse786))) (let ((.cse774 (select .cse781 .cse780)) (.cse770 (let ((.cse782 (store .cse784 .cse780 (store (select .cse784 .cse780) .cse769 0)))) (store .cse782 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse782 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse783))))) (let ((.cse775 (select (select .cse770 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse773 (let ((.cse779 (store .cse781 .cse780 (store .cse774 .cse769 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse779 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse779 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse780))))) (let ((.cse777 (select (select .cse773 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse778 (+ .cse775 4))) (let ((.cse776 (select (select .cse770 .cse777) .cse778))) (let ((.cse772 (+ 4 .cse776)) (.cse771 (select (select .cse773 .cse777) .cse778))) (or (< .cse769 0) (= (select (select .cse770 .cse771) .cse772) 0) (= (select (select .cse773 .cse771) .cse772) .cse771) (not (= (select .cse774 .cse769) 0)) (< .cse775 0) (not (= .cse776 0)))))))))))))))) .cse787) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse804 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse801 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse805 (select (select .cse801 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse806 (+ (select (select .cse804 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse803 (select (select .cse804 .cse805) .cse806))) (let ((.cse795 (+ .cse803 4)) (.cse800 (select (select .cse801 .cse805) .cse806))) (let ((.cse794 (select .cse801 .cse800)) (.cse790 (let ((.cse802 (store .cse804 .cse800 (store (select .cse804 .cse800) .cse795 0)))) (store .cse802 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse802 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse803))))) (let ((.cse789 (select (select .cse790 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse796 (let ((.cse799 (store .cse801 .cse800 (store .cse794 .cse795 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse799 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse799 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse800))))) (let ((.cse797 (select (select .cse796 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse798 (+ .cse789 4))) (let ((.cse793 (select (select .cse790 .cse797) .cse798))) (let ((.cse791 (select (select .cse796 .cse797) .cse798)) (.cse792 (+ 4 .cse793))) (let ((.cse788 (select (select .cse796 .cse791) .cse792))) (or (= .cse788 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse789)) (= (select (select .cse790 .cse791) .cse792) 0) (= .cse788 .cse791) (= .cse793 0) (not (= (select .cse794 .cse795) 0)) (not (<= 0 .cse795)) (not (<= 0 .cse793)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse822 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse819 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse823 (select (select .cse819 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse824 (+ (select (select .cse822 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse821 (select (select .cse822 .cse823) .cse824))) (let ((.cse811 (+ .cse821 4)) (.cse813 (select (select .cse819 .cse823) .cse824))) (let ((.cse810 (select .cse819 .cse813)) (.cse815 (let ((.cse820 (store .cse822 .cse813 (store (select .cse822 .cse813) .cse811 0)))) (store .cse820 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse820 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse821))))) (let ((.cse809 (select (select .cse815 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse814 (let ((.cse818 (store .cse819 .cse813 (store .cse810 .cse811 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse818 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse818 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse813))))) (let ((.cse816 (select (select .cse814 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse817 (+ .cse809 4))) (let ((.cse807 (select (select .cse814 .cse816) .cse817)) (.cse812 (select (select .cse815 .cse816) .cse817))) (let ((.cse808 (select (select .cse814 .cse807) (+ 4 .cse812)))) (or (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse807) (= .cse808 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse809)) (= .cse808 .cse807) (not (= (select .cse810 .cse811) 0)) (not (<= 0 .cse811)) (not (= .cse811 .cse812)) (not (= .cse813 .cse807))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (or .cse21 (forall ((v_ArrVal_8525 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8524 (Array Int Int))) (let ((.cse839 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse836 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse840 (select (select .cse836 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse841 (+ (select (select .cse839 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse838 (select (select .cse839 .cse840) .cse841))) (let ((.cse830 (+ .cse838 4)) (.cse831 (select (select .cse836 .cse840) .cse841))) (let ((.cse829 (select .cse836 .cse831)) (.cse834 (let ((.cse837 (store .cse839 .cse831 (store (select .cse839 .cse831) .cse830 0)))) (store .cse837 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse837 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse838))))) (let ((.cse826 (select (select .cse834 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse827 (let ((.cse835 (store .cse836 .cse831 (store .cse829 .cse830 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse835 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse835 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse831))))) (let ((.cse832 (select (select .cse827 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse833 (+ .cse826 4))) (let ((.cse825 (select (select .cse834 .cse832) .cse833)) (.cse828 (select (select .cse827 .cse832) .cse833))) (or (= 8 .cse825) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (not (<= 0 .cse826)) (= (select (select .cse827 .cse828) (+ 4 .cse825)) .cse828) (not (= (select .cse829 .cse830) 0)) (not (<= 0 .cse830)) (not (= .cse830 .cse825)) (not (= .cse831 .cse828))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse857 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse854 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse858 (select (select .cse854 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse859 (+ (select (select .cse857 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse856 (select (select .cse857 .cse858) .cse859))) (let ((.cse847 (+ .cse856 4)) (.cse848 (select (select .cse854 .cse858) .cse859))) (let ((.cse846 (select .cse854 .cse848)) (.cse849 (let ((.cse855 (store .cse857 .cse848 (store (select .cse857 .cse848) .cse847 0)))) (store .cse855 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse855 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse856))))) (let ((.cse845 (select (select .cse849 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse852 (let ((.cse853 (store .cse854 .cse848 (store .cse846 .cse847 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse853 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse853 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse848))))) (let ((.cse850 (select (select .cse852 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse851 (+ .cse845 4))) (let ((.cse844 (select (select .cse852 .cse850) .cse851)) (.cse843 (select (select .cse849 .cse850) .cse851))) (let ((.cse842 (select (select .cse849 .cse844) (+ 4 .cse843)))) (or (= .cse842 .cse843) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse844) (not (<= 0 .cse845)) (= .cse842 0) (not (= (select .cse846 .cse847) 0)) (not (<= 0 .cse847)) (not (= .cse847 .cse843)) (not (= .cse848 .cse844))))))))))))))) (or (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse873 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse870 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse874 (select (select .cse870 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse875 (+ (select (select .cse873 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse872 (select (select .cse873 .cse874) .cse875))) (let ((.cse865 (+ .cse872 4)) (.cse869 (select (select .cse870 .cse874) .cse875))) (let ((.cse866 (select .cse870 .cse869)) (.cse860 (let ((.cse871 (store .cse873 .cse869 (store (select .cse873 .cse869) .cse865 0)))) (store .cse871 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse871 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse872))))) (let ((.cse867 (select (select .cse860 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse861 (let ((.cse868 (store .cse870 .cse869 (store .cse866 .cse865 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse868 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse868 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse869))))) (let ((.cse862 (select (select .cse861 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse863 (+ .cse867 4))) (let ((.cse864 (select (select .cse860 .cse862) .cse863))) (or (= (select (select .cse860 (select (select .cse861 .cse862) .cse863)) (+ 4 .cse864)) .cse864) (< .cse865 0) (not (= (select .cse866 .cse865) 0)) (< .cse867 0) (not (= .cse864 0)))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse891 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse888 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse892 (select (select .cse888 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse893 (+ (select (select .cse891 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse890 (select (select .cse891 .cse892) .cse893))) (let ((.cse881 (+ .cse890 4)) (.cse887 (select (select .cse888 .cse892) .cse893))) (let ((.cse882 (select .cse888 .cse887)) (.cse876 (let ((.cse889 (store .cse891 .cse887 (store (select .cse891 .cse887) .cse881 0)))) (store .cse889 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse889 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse890))))) (let ((.cse883 (select (select .cse876 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse880 (let ((.cse886 (store .cse888 .cse887 (store .cse882 .cse881 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse886 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse886 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse887))))) (let ((.cse884 (select (select .cse880 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse885 (+ .cse883 4))) (let ((.cse879 (select (select .cse876 .cse884) .cse885))) (let ((.cse877 (select (select .cse880 .cse884) .cse885)) (.cse878 (+ 4 .cse879))) (or (= (select (select .cse876 .cse877) .cse878) .cse879) (= (select (select .cse880 .cse877) .cse878) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (< .cse881 0) (not (= (select .cse882 .cse881) 0)) (< .cse883 0) (not (= .cse879 0))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse910 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse907 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse911 (select (select .cse907 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse912 (+ (select (select .cse910 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse909 (select (select .cse910 .cse911) .cse912))) (let ((.cse896 (+ .cse909 4)) (.cse902 (select (select .cse907 .cse911) .cse912))) (let ((.cse897 (select .cse907 .cse902)) (.cse903 (let ((.cse908 (store .cse910 .cse902 (store (select .cse910 .cse902) .cse896 0)))) (store .cse908 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse908 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse909))))) (let ((.cse898 (select (select .cse903 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse899 (let ((.cse906 (store .cse907 .cse902 (store .cse897 .cse896 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse906 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse906 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse902))))) (let ((.cse904 (select (select .cse899 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse905 (+ .cse898 4))) (let ((.cse895 (select (select .cse903 .cse904) .cse905))) (let ((.cse900 (select (select .cse899 .cse904) .cse905)) (.cse901 (+ 4 .cse895))) (let ((.cse894 (select (select .cse903 .cse900) .cse901))) (or (= .cse894 .cse895) (< .cse896 0) (not (= (select .cse897 .cse896) 0)) (not (= .cse894 .cse896)) (< .cse898 0) (not (= (select (select .cse899 .cse900) .cse901) .cse902)) (not (= .cse895 0))))))))))))))))) .cse787) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse929 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse926 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse930 (select (select .cse926 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse931 (+ (select (select .cse929 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse928 (select (select .cse929 .cse930) .cse931))) (let ((.cse920 (+ .cse928 4)) (.cse925 (select (select .cse926 .cse930) .cse931))) (let ((.cse919 (select .cse926 .cse925)) (.cse921 (let ((.cse927 (store .cse929 .cse925 (store (select .cse929 .cse925) .cse920 0)))) (store .cse927 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse927 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse928))))) (let ((.cse918 (select (select .cse921 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse916 (let ((.cse924 (store .cse926 .cse925 (store .cse919 .cse920 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse924 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse924 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse925))))) (let ((.cse922 (select (select .cse916 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse923 (+ .cse918 4))) (let ((.cse914 (select (select .cse921 .cse922) .cse923))) (let ((.cse915 (select (select .cse916 .cse922) .cse923)) (.cse917 (+ 4 .cse914))) (let ((.cse913 (select (select .cse921 .cse915) .cse917))) (or (= .cse913 .cse914) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse915) (= (select (select .cse916 .cse915) .cse917) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse918)) (= .cse913 0) (not (= (select .cse919 .cse920) 0)) (not (<= 0 .cse920)) (not (<= 0 .cse914)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse948 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse945 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse949 (select (select .cse945 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse950 (+ (select (select .cse948 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse947 (select (select .cse948 .cse949) .cse950))) (let ((.cse936 (+ .cse947 4)) (.cse940 (select (select .cse945 .cse949) .cse950))) (let ((.cse935 (select .cse945 .cse940)) (.cse937 (let ((.cse946 (store .cse948 .cse940 (store (select .cse948 .cse940) .cse936 0)))) (store .cse946 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse946 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse947))))) (let ((.cse933 (select (select .cse937 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse941 (let ((.cse944 (store .cse945 .cse940 (store .cse935 .cse936 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse944 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse944 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse940))))) (let ((.cse942 (select (select .cse941 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse943 (+ .cse933 4))) (let ((.cse939 (select (select .cse937 .cse942) .cse943))) (let ((.cse932 (select (select .cse941 .cse942) .cse943)) (.cse938 (+ 4 .cse939))) (let ((.cse934 (select (select .cse941 .cse932) .cse938))) (or (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse932) (not (<= 0 .cse933)) (= .cse934 .cse932) (not (= (select .cse935 .cse936) 0)) (not (= (select (select .cse937 .cse932) .cse938) .cse936)) (not (<= 0 .cse936)) (not (<= 0 .cse939)) (not (= .cse934 .cse940)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse966 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse963 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse967 (select (select .cse963 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse968 (+ (select (select .cse966 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse965 (select (select .cse966 .cse967) .cse968))) (let ((.cse957 (+ .cse965 4)) (.cse962 (select (select .cse963 .cse967) .cse968))) (let ((.cse956 (select .cse963 .cse962)) (.cse953 (let ((.cse964 (store .cse966 .cse962 (store (select .cse966 .cse962) .cse957 0)))) (store .cse964 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse964 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse965))))) (let ((.cse952 (select (select .cse953 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse955 (let ((.cse961 (store .cse963 .cse962 (store .cse956 .cse957 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse961 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse961 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse962))))) (let ((.cse959 (select (select .cse955 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse960 (+ .cse952 4))) (let ((.cse958 (select (select .cse953 .cse959) .cse960))) (let ((.cse954 (+ 4 .cse958)) (.cse951 (select (select .cse955 .cse959) .cse960))) (or (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse951) (not (<= 0 .cse952)) (= (select (select .cse953 .cse951) .cse954) 0) (= (select (select .cse955 .cse951) .cse954) .cse951) (not (= (select .cse956 .cse957) 0)) (not (<= 0 .cse957)) (not (<= 0 .cse958))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse984 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse981 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse985 (select (select .cse981 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse986 (+ (select (select .cse984 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse983 (select (select .cse984 .cse985) .cse986))) (let ((.cse973 (+ .cse983 4)) (.cse974 (select (select .cse981 .cse985) .cse986))) (let ((.cse972 (select .cse981 .cse974)) (.cse976 (let ((.cse982 (store .cse984 .cse974 (store (select .cse984 .cse974) .cse973 0)))) (store .cse982 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse982 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse983))))) (let ((.cse971 (select (select .cse976 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse979 (let ((.cse980 (store .cse981 .cse974 (store .cse972 .cse973 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse980 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse980 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse974))))) (let ((.cse977 (select (select .cse979 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse978 (+ .cse971 4))) (let ((.cse975 (select (select .cse979 .cse977) .cse978)) (.cse969 (select (select .cse976 .cse977) .cse978))) (let ((.cse970 (select (select .cse976 .cse975) (+ 4 .cse969)))) (or (= 8 .cse969) (= .cse970 .cse969) (not (<= 0 .cse971)) (= .cse970 0) (not (= (select .cse972 .cse973) 0)) (not (<= 0 .cse973)) (not (= .cse973 .cse969)) (not (= .cse974 .cse975))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0))))))) is different from true [2022-11-20 11:26:07,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932863618] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:26:07,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:26:07,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 35] total 70 [2022-11-20 11:26:07,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604055614] [2022-11-20 11:26:07,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:26:07,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-20 11:26:07,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:26:07,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-20 11:26:07,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=7228, Unknown=1, NotChecked=170, Total=7656 [2022-11-20 11:26:07,860 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 70 states, 68 states have (on average 1.9264705882352942) internal successors, (131), 63 states have internal predecessors, (131), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 11:26:31,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:31,014 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-11-20 11:26:31,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-20 11:26:31,015 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 68 states have (on average 1.9264705882352942) internal successors, (131), 63 states have internal predecessors, (131), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 75 [2022-11-20 11:26:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:31,016 INFO L225 Difference]: With dead ends: 85 [2022-11-20 11:26:31,016 INFO L226 Difference]: Without dead ends: 85 [2022-11-20 11:26:31,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 118 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2063 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=649, Invalid=13396, Unknown=1, NotChecked=234, Total=14280 [2022-11-20 11:26:31,017 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 125 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 2219 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 2494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:26:31,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1451 Invalid, 2494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2219 Invalid, 0 Unknown, 250 Unchecked, 6.1s Time] [2022-11-20 11:26:31,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-20 11:26:31,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-11-20 11:26:31,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 80 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-20 11:26:31,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2022-11-20 11:26:31,019 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 75 [2022-11-20 11:26:31,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:31,019 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2022-11-20 11:26:31,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 68 states have (on average 1.9264705882352942) internal successors, (131), 63 states have internal predecessors, (131), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 11:26:31,020 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-11-20 11:26:31,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-20 11:26:31,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:31,023 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:31,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-20 11:26:31,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-20 11:26:31,233 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:26:31,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:31,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1310476580, now seen corresponding path program 1 times [2022-11-20 11:26:31,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:26:31,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72967189] [2022-11-20 11:26:31,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:31,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:26:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:38,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:26:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:39,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:26:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:41,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:26:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 41 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:26:44,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:26:44,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72967189] [2022-11-20 11:26:44,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72967189] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:26:44,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999227885] [2022-11-20 11:26:44,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:44,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:44,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:26:44,237 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:26:44,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-20 11:26:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:44,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 165 conjunts are in the unsatisfiable core [2022-11-20 11:26:44,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:26:44,936 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-20 11:26:45,191 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-20 11:26:46,067 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:26:46,067 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-20 11:26:47,100 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-20 11:26:47,868 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 11:26:47,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-20 11:26:48,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:26:48,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-20 11:26:49,224 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:26:49,225 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-11-20 11:26:49,251 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 22 treesize of output 24 [2022-11-20 11:26:51,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:26:51,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 37 [2022-11-20 11:26:51,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-20 11:26:51,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 11:26:52,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:52,995 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:26:52,996 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 84 treesize of output 70 [2022-11-20 11:26:53,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:53,058 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 11:26:53,058 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 1 case distinctions, treesize of input 25 treesize of output 38 [2022-11-20 11:26:53,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:53,137 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:26:53,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-20 11:26:57,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:57,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:26:57,390 INFO L321 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2022-11-20 11:26:57,391 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 207 treesize of output 99 [2022-11-20 11:26:57,470 INFO L321 Elim1Store]: treesize reduction 120, result has 11.1 percent of original size [2022-11-20 11:26:57,470 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 70 [2022-11-20 11:26:58,087 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-20 11:26:58,087 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 168 treesize of output 109 [2022-11-20 11:26:58,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:58,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:58,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 76 [2022-11-20 11:27:02,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:27:02,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:27:02,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:27:02,402 INFO L321 Elim1Store]: treesize reduction 49, result has 18.3 percent of original size [2022-11-20 11:27:02,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 195 treesize of output 88 [2022-11-20 11:27:02,460 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-20 11:27:02,461 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 6 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 31 [2022-11-20 11:27:03,517 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:27:03,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:27:08,964 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:27:08,964 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 80 treesize of output 84 [2022-11-20 11:27:22,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999227885] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:27:22,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:27:22,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39] total 78 [2022-11-20 11:27:22,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120097316] [2022-11-20 11:27:22,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:27:22,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-20 11:27:22,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:27:22,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-20 11:27:22,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=9342, Unknown=75, NotChecked=0, Total=9702 [2022-11-20 11:27:22,640 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 79 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 70 states have internal predecessors, (137), 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-20 11:27:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:27:47,499 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-11-20 11:27:47,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-20 11:27:47,500 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 70 states have internal predecessors, (137), 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 75 [2022-11-20 11:27:47,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:27:47,501 INFO L225 Difference]: With dead ends: 89 [2022-11-20 11:27:47,501 INFO L226 Difference]: Without dead ends: 89 [2022-11-20 11:27:47,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2873 ImplicationChecksByTransitivity, 55.6s TimeCoverageRelationStatistics Valid=581, Invalid=15596, Unknown=79, NotChecked=0, Total=16256 [2022-11-20 11:27:47,503 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 123 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 2704 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 3068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 335 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:27:47,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1690 Invalid, 3068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2704 Invalid, 0 Unknown, 335 Unchecked, 7.7s Time] [2022-11-20 11:27:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-20 11:27:47,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2022-11-20 11:27:47,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 81 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-20 11:27:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-11-20 11:27:47,507 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 75 [2022-11-20 11:27:47,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:27:47,508 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-11-20 11:27:47,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 70 states have internal predecessors, (137), 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-20 11:27:47,509 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-11-20 11:27:47,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-20 11:27:47,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:27:47,509 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:27:47,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-20 11:27:47,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-11-20 11:27:47,715 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:27:47,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:27:47,715 INFO L85 PathProgramCache]: Analyzing trace with hash 844969168, now seen corresponding path program 3 times [2022-11-20 11:27:47,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:27:47,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451543536] [2022-11-20 11:27:47,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:27:47,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:27:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:57,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:27:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:57,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:27:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:58,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:27:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:28:01,900 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:28:01,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:28:01,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451543536] [2022-11-20 11:28:01,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451543536] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:28:01,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803706538] [2022-11-20 11:28:01,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:28:01,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:28:01,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:28:01,902 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:28:01,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-20 11:28:05,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 11:28:05,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:28:05,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 207 conjunts are in the unsatisfiable core [2022-11-20 11:28:05,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:28:07,278 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-20 11:28:07,726 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-20 11:28:07,986 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 23 treesize of output 22 [2022-11-20 11:28:08,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:28:08,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 11:28:08,325 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:28:08,326 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-20 11:28:08,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-20 11:28:09,314 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:28:09,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 11:28:09,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:28:09,752 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:28:09,753 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 55 treesize of output 52 [2022-11-20 11:28:09,762 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 22 treesize of output 24 [2022-11-20 11:28:11,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:28:11,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 28 [2022-11-20 11:28:11,360 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-20 11:28:11,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:28:11,371 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 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:28:13,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:28:13,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:28:13,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:28:13,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:28:13,738 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 11:28:13,738 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 69 [2022-11-20 11:28:13,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:28:13,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:28:13,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:28:13,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:28:13,810 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-20 11:28:13,810 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 2 case distinctions, treesize of input 40 treesize of output 50 [2022-11-20 11:28:13,901 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:28:13,901 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-20 11:28:18,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:28:18,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:28:18,428 INFO L321 Elim1Store]: treesize reduction 143, result has 14.9 percent of original size [2022-11-20 11:28:18,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 115 treesize of output 80 [2022-11-20 11:28:18,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:28:18,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:28:18,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:28:18,494 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-20 11:28:18,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 66 [2022-11-20 11:28:19,323 INFO L321 Elim1Store]: treesize reduction 132, result has 18.0 percent of original size [2022-11-20 11:28:19,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 386 treesize of output 149 [2022-11-20 11:28:19,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:28:19,495 INFO L321 Elim1Store]: treesize reduction 180, result has 18.6 percent of original size [2022-11-20 11:28:19,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 341 treesize of output 206 [2022-11-20 11:28:25,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:28:25,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:28:25,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:28:25,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:28:25,711 INFO L321 Elim1Store]: treesize reduction 186, result has 7.0 percent of original size [2022-11-20 11:28:25,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 321 treesize of output 132 [2022-11-20 11:28:25,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:28:25,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:28:25,803 INFO L321 Elim1Store]: treesize reduction 35, result has 22.2 percent of original size [2022-11-20 11:28:25,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 41 [2022-11-20 11:28:26,596 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 23 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:28:26,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:28:36,085 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:28:36,085 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 1648 treesize of output 2226 [2022-11-20 11:28:45,944 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_73| Int)) (or (forall ((v_ArrVal_9144 Int) (v_ArrVal_9145 Int) (v_ArrVal_9146 Int) (v_ArrVal_9147 Int)) (let ((.cse15 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73| (store (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73|) 4 0) 8 v_ArrVal_9147) 0 v_ArrVal_9146))) (.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73| (store (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73|) 4 0) 8 v_ArrVal_9145) 0 v_ArrVal_9144)))) (let ((.cse16 (select (select .cse10 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse17 (+ (select (select .cse15 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse14 (select (select .cse15 .cse16) .cse17)) (.cse0 (select (select .cse10 .cse16) .cse17))) (let ((.cse12 (select .cse15 .cse0)) (.cse11 (+ 4 .cse14))) (let ((.cse2 (let ((.cse13 (store .cse15 .cse0 (store .cse12 .cse11 0)))) (store .cse13 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73| (store (select .cse13 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73|) 8 .cse14))))) (let ((.cse8 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_41| Int)) (let ((.cse5 (let ((.cse9 (store .cse10 .cse0 (store (select .cse10 .cse0) .cse11 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73|)))) (store .cse9 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73| (store (select .cse9 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73|) 8 .cse0))))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ .cse8 4))) (let ((.cse3 (select (select .cse5 .cse6) .cse7)) (.cse4 (+ (select (select .cse2 .cse6) .cse7) 4))) (let ((.cse1 (select (select .cse5 (select (select .cse5 .cse3) .cse4)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 4)))) (or (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_41|)) (= .cse0 .cse1) (= .cse1 0) (< (select (select .cse2 .cse3) .cse4) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|))))))) (not (<= 0 .cse8)) (not (= (select .cse12 .cse11) 0)))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_73| Int)) (or (forall ((v_ArrVal_9144 Int) (v_ArrVal_9145 Int) (v_ArrVal_9146 Int) (v_ArrVal_9147 Int)) (let ((.cse34 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73| (store (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73|) 4 0) 8 v_ArrVal_9147) 0 v_ArrVal_9146))) (.cse29 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73| (store (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73|) 4 0) 8 v_ArrVal_9145) 0 v_ArrVal_9144)))) (let ((.cse35 (select (select .cse29 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse36 (+ (select (select .cse34 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse33 (select (select .cse34 .cse35) .cse36)) (.cse18 (select (select .cse29 .cse35) .cse36))) (let ((.cse31 (select .cse34 .cse18)) (.cse30 (+ 4 .cse33))) (let ((.cse22 (let ((.cse32 (store .cse34 .cse18 (store .cse31 .cse30 0)))) (store .cse32 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73| (store (select .cse32 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73|) 8 .cse33))))) (let ((.cse27 (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_278 Int)) (let ((.cse19 (let ((.cse28 (store .cse29 .cse18 (store (select .cse29 .cse18) .cse30 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73|)))) (store .cse28 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73| (store (select .cse28 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73|) 8 .cse18))))) (let ((.cse25 (select (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse26 (+ .cse27 4))) (let ((.cse23 (select (select .cse19 .cse25) .cse26)) (.cse24 (+ (select (select .cse22 .cse25) .cse26) 4))) (let ((.cse20 (select (select .cse19 .cse23) .cse24)) (.cse21 (+ v_prenex_278 4))) (or (= .cse18 (select (select .cse19 .cse20) .cse21)) (not (<= 0 v_prenex_278)) (< (select (select .cse22 .cse23) .cse24) v_prenex_278) (= (select (select .cse22 .cse20) .cse21) 0))))))) (not (<= 0 .cse27)) (not (= (select .cse31 .cse30) 0)))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_73|) 0))))) is different from false [2022-11-20 11:28:45,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803706538] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:28:45,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:28:45,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 46] total 89 [2022-11-20 11:28:45,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577174497] [2022-11-20 11:28:45,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:28:45,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-11-20 11:28:45,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:28:45,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-11-20 11:28:45,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=10961, Unknown=5, NotChecked=210, Total=11556 [2022-11-20 11:28:45,968 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 89 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 80 states have internal predecessors, (143), 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-20 11:29:06,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:29:06,162 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2022-11-20 11:29:06,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-20 11:29:06,163 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 80 states have internal predecessors, (143), 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 78 [2022-11-20 11:29:06,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:29:06,163 INFO L225 Difference]: With dead ends: 80 [2022-11-20 11:29:06,164 INFO L226 Difference]: Without dead ends: 80 [2022-11-20 11:29:06,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 134 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4876 ImplicationChecksByTransitivity, 52.9s TimeCoverageRelationStatistics Valid=725, Invalid=17364, Unknown=5, NotChecked=266, Total=18360 [2022-11-20 11:29:06,165 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 80 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 2422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:29:06,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1551 Invalid, 2422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2142 Invalid, 0 Unknown, 257 Unchecked, 6.1s Time] [2022-11-20 11:29:06,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-20 11:29:06,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-20 11:29:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 75 states have internal predecessors, (76), 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-20 11:29:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2022-11-20 11:29:06,168 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 78 [2022-11-20 11:29:06,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:29:06,169 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2022-11-20 11:29:06,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 80 states have internal predecessors, (143), 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-20 11:29:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2022-11-20 11:29:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-20 11:29:06,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:29:06,170 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:29:06,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-20 11:29:06,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:29:06,383 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:29:06,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:29:06,383 INFO L85 PathProgramCache]: Analyzing trace with hash 424239147, now seen corresponding path program 3 times [2022-11-20 11:29:06,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:29:06,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690696427] [2022-11-20 11:29:06,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:29:06,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:29:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:06,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:29:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:06,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:29:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:06,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:29:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 11:29:06,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:29:06,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690696427] [2022-11-20 11:29:06,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690696427] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:29:06,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500649934] [2022-11-20 11:29:06,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:29:06,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:29:06,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:29:06,838 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:29:06,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-20 11:29:10,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 11:29:10,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:29:10,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 11:29:10,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:29:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-20 11:29:11,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:29:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-20 11:29:12,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500649934] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:29:12,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:29:12,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-11-20 11:29:12,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997597655] [2022-11-20 11:29:12,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:29:12,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 11:29:12,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:29:12,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 11:29:12,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:29:12,065 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 11:29:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:29:12,386 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-11-20 11:29:12,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:29:12,387 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 79 [2022-11-20 11:29:12,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:29:12,387 INFO L225 Difference]: With dead ends: 78 [2022-11-20 11:29:12,387 INFO L226 Difference]: Without dead ends: 78 [2022-11-20 11:29:12,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 156 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:29:12,388 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 34 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:29:12,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 467 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:29:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-20 11:29:12,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-20 11:29:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.088235294117647) internal successors, (74), 73 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 11:29:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2022-11-20 11:29:12,392 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 79 [2022-11-20 11:29:12,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:29:12,392 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2022-11-20 11:29:12,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 11:29:12,393 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-11-20 11:29:12,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-20 11:29:12,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:29:12,394 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:29:12,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-11-20 11:29:12,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:29:12,599 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:29:12,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:29:12,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1579195478, now seen corresponding path program 1 times [2022-11-20 11:29:12,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:29:12,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142369669] [2022-11-20 11:29:12,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:29:12,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:29:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:13,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:29:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:13,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:29:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:13,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:29:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-20 11:29:13,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:29:13,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142369669] [2022-11-20 11:29:13,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142369669] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:29:13,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665911020] [2022-11-20 11:29:13,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:29:13,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:29:13,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:29:13,101 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:29:13,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-20 11:29:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:13,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-20 11:29:13,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:29:14,052 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-20 11:29:14,058 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-20 11:29:14,092 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-20 11:29:14,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:29:14,454 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:29:14,454 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 34 treesize of output 38 [2022-11-20 11:29:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-20 11:29:14,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665911020] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:29:14,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:29:14,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-11-20 11:29:14,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954054964] [2022-11-20 11:29:14,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:29:14,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 11:29:14,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:29:14,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 11:29:14,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-20 11:29:14,796 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 11:29:15,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:29:15,725 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-11-20 11:29:15,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:29:15,726 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2022-11-20 11:29:15,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:29:15,727 INFO L225 Difference]: With dead ends: 87 [2022-11-20 11:29:15,727 INFO L226 Difference]: Without dead ends: 87 [2022-11-20 11:29:15,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-20 11:29:15,728 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 102 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:29:15,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 268 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 11:29:15,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-20 11:29:15,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2022-11-20 11:29:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 75 states have internal predecessors, (78), 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-20 11:29:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-20 11:29:15,740 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 82 [2022-11-20 11:29:15,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:29:15,741 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-20 11:29:15,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 11:29:15,741 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-20 11:29:15,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-20 11:29:15,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:29:15,742 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:29:15,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-20 11:29:15,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:29:15,947 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:29:15,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:29:15,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1579195479, now seen corresponding path program 1 times [2022-11-20 11:29:15,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:29:15,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535180841] [2022-11-20 11:29:15,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:29:15,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:29:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:16,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:29:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:16,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:29:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:16,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:29:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-20 11:29:16,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:29:16,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535180841] [2022-11-20 11:29:16,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535180841] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:29:16,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894847582] [2022-11-20 11:29:16,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:29:16,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:29:16,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:29:16,284 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:29:16,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-20 11:29:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:17,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 11:29:17,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:29:17,185 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-20 11:29:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-20 11:29:17,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:29:17,326 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-20 11:29:17,326 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-20 11:29:17,357 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-20 11:29:17,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894847582] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:29:17,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:29:17,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2022-11-20 11:29:17,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761245893] [2022-11-20 11:29:17,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:29:17,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:29:17,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:29:17,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:29:17,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:29:17,360 INFO L87 Difference]: Start difference. First operand 80 states and 84 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 11:29:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:29:17,964 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-11-20 11:29:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:29:17,964 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2022-11-20 11:29:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:29:17,966 INFO L225 Difference]: With dead ends: 86 [2022-11-20 11:29:17,966 INFO L226 Difference]: Without dead ends: 86 [2022-11-20 11:29:17,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 168 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-20 11:29:17,967 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 35 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:29:17,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 225 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:29:17,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-20 11:29:17,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2022-11-20 11:29:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 74 states have internal predecessors, (76), 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-20 11:29:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-11-20 11:29:17,975 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 82 [2022-11-20 11:29:17,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:29:17,975 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-11-20 11:29:17,976 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 11:29:17,976 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-11-20 11:29:17,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-20 11:29:17,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:29:17,978 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:29:17,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-20 11:29:18,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:29:18,187 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:29:18,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:29:18,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1710420999, now seen corresponding path program 1 times [2022-11-20 11:29:18,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:29:18,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399664872] [2022-11-20 11:29:18,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:29:18,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:29:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:18,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:29:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:18,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:29:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:18,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:29:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-20 11:29:18,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:29:18,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399664872] [2022-11-20 11:29:18,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399664872] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:29:18,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634729478] [2022-11-20 11:29:18,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:29:18,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:29:18,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:29:18,589 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:29:18,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-20 11:29:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:19,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-20 11:29:19,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:29:19,552 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-20 11:29:19,557 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 21 treesize of output 13 [2022-11-20 11:29:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-20 11:29:19,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:29:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-20 11:29:19,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634729478] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 11:29:19,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:29:19,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 10 [2022-11-20 11:29:19,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827910302] [2022-11-20 11:29:19,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:29:19,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:29:19,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:29:19,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:29:19,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:29:19,947 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 11:29:20,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:29:20,229 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-11-20 11:29:20,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:29:20,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2022-11-20 11:29:20,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:29:20,230 INFO L225 Difference]: With dead ends: 79 [2022-11-20 11:29:20,230 INFO L226 Difference]: Without dead ends: 79 [2022-11-20 11:29:20,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:29:20,231 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 77 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:29:20,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 184 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:29:20,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-20 11:29:20,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-20 11:29:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.0714285714285714) internal successors, (75), 74 states have internal predecessors, (75), 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-20 11:29:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2022-11-20 11:29:20,235 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 83 [2022-11-20 11:29:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:29:20,235 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2022-11-20 11:29:20,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 11:29:20,236 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-11-20 11:29:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-20 11:29:20,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:29:20,237 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:29:20,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-20 11:29:20,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-11-20 11:29:20,447 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:29:20,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:29:20,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1483396663, now seen corresponding path program 1 times [2022-11-20 11:29:20,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:29:20,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938093515] [2022-11-20 11:29:20,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:29:20,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:29:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:21,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:29:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:21,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:29:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:22,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:29:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 11:29:22,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:29:22,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938093515] [2022-11-20 11:29:22,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938093515] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:29:22,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70124394] [2022-11-20 11:29:22,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:29:22,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:29:22,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:29:22,540 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:29:22,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-20 11:29:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:23,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-20 11:29:23,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:29:24,277 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-20 11:29:24,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-20 11:29:24,524 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_10491 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_10491))) (exists ((v_ArrVal_10490 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_10490)))) is different from true [2022-11-20 11:29:24,546 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_10492 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_10492) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_10493 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_10493)))) is different from true [2022-11-20 11:29:24,570 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_10495 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_10495) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_10494 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_10494)))) is different from true [2022-11-20 11:29:24,594 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_10495 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_10495))) (exists ((v_ArrVal_10494 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_10494) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-20 11:29:24,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:29:24,624 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 15 treesize of output 17 [2022-11-20 11:29:24,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:29:24,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:29:25,055 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:29:25,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-11-20 11:29:25,417 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-20 11:29:25,418 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 21 treesize of output 20 [2022-11-20 11:29:25,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:29:25,549 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-20 11:29:25,769 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-20 11:29:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 5 not checked. [2022-11-20 11:29:25,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:29:27,176 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10507 (Array Int Int)) (v_ArrVal_10497 Int) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_10498 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_82| Int) (v_ArrVal_10508 (Array Int Int))) (let ((.cse0 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_82| v_ArrVal_10507) |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_82| |c_#StackHeapBarrier|)) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_82| v_ArrVal_10508))) (store .cse1 |ULTIMATE.start_dll_append_~last~0#1.base| (store (select .cse1 |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_10497))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_82| v_ArrVal_10498) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2022-11-20 11:29:27,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70124394] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:29:27,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:29:27,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 40 [2022-11-20 11:29:27,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593147993] [2022-11-20 11:29:27,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:29:27,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-20 11:29:27,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:29:27,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-20 11:29:27,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1556, Unknown=31, NotChecked=420, Total=2162 [2022-11-20 11:29:27,181 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 41 states, 38 states have (on average 2.789473684210526) internal successors, (106), 35 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-20 11:29:30,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:29:30,377 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2022-11-20 11:29:30,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 11:29:30,378 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 2.789473684210526) internal successors, (106), 35 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 84 [2022-11-20 11:29:30,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:29:30,379 INFO L225 Difference]: With dead ends: 81 [2022-11-20 11:29:30,379 INFO L226 Difference]: Without dead ends: 81 [2022-11-20 11:29:30,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=320, Invalid=2748, Unknown=32, NotChecked=560, Total=3660 [2022-11-20 11:29:30,379 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 142 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:29:30,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 444 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 547 Invalid, 0 Unknown, 236 Unchecked, 1.3s Time] [2022-11-20 11:29:30,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-20 11:29:30,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-20 11:29:30,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 76 states have internal predecessors, (77), 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-20 11:29:30,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2022-11-20 11:29:30,383 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 84 [2022-11-20 11:29:30,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:29:30,383 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2022-11-20 11:29:30,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 2.789473684210526) internal successors, (106), 35 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-20 11:29:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2022-11-20 11:29:30,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-20 11:29:30,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:29:30,385 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:29:30,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-20 11:29:30,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-11-20 11:29:30,594 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:29:30,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:29:30,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1259343866, now seen corresponding path program 1 times [2022-11-20 11:29:30,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:29:30,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44564364] [2022-11-20 11:29:30,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:29:30,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:29:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:32,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:29:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:32,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:29:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:32,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:29:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:33,246 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 11:29:33,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:29:33,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44564364] [2022-11-20 11:29:33,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44564364] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:29:33,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875732888] [2022-11-20 11:29:33,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:29:33,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:29:33,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:29:33,248 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:29:33,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-20 11:29:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:34,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-20 11:29:34,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:29:35,227 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-20 11:29:35,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:29:35,935 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 26 treesize of output 19 [2022-11-20 11:29:37,068 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-11-20 11:29:37,069 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2022-11-20 11:29:37,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:29:37,109 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-20 11:29:37,613 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-20 11:29:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-20 11:29:38,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:29:53,049 WARN L233 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 58 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:29:53,543 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_node_create_~temp~0#1.base_150| Int)) (or (forall ((v_ArrVal_10787 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_150| v_ArrVal_10787))) (or (<= (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 1) |c_#StackHeapBarrier|) (not (= (select (select .cse0 |ULTIMATE.start_dll_append_~last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) (not (< |v_node_create_~temp~0#1.base_150| |c_#StackHeapBarrier|)))) (forall ((|v_node_create_~temp~0#1.base_150| Int)) (or (forall ((v_ArrVal_10787 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_150| v_ArrVal_10787) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) (not (< |v_node_create_~temp~0#1.base_150| |c_#StackHeapBarrier|)))) (forall ((|v_node_create_~temp~0#1.base_150| Int)) (or (forall ((v_ArrVal_10787 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_150| v_ArrVal_10787))) (let ((.cse1 (select .cse2 |ULTIMATE.start_dll_append_~last~0#1.base|))) (or (<= (+ (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 1) |c_#StackHeapBarrier|) (<= (+ (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 1) |c_#StackHeapBarrier|) (not (= (select .cse1 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0)))))) (not (< |v_node_create_~temp~0#1.base_150| |c_#StackHeapBarrier|)))) (forall ((|v_node_create_~temp~0#1.base_150| Int)) (or (forall ((v_ArrVal_10787 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_150| v_ArrVal_10787))) (or (= |ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 1) |c_#StackHeapBarrier|) (not (= (select (select .cse3 |ULTIMATE.start_dll_append_~last~0#1.base|) (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0))))) (not (< |v_node_create_~temp~0#1.base_150| |c_#StackHeapBarrier|)))) (forall ((|v_node_create_~temp~0#1.base_150| Int)) (or (< |v_node_create_~temp~0#1.base_150| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_10787 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.base| Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_150| v_ArrVal_10787) |ULTIMATE.start_dll_append_~last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) (not (< |v_node_create_~temp~0#1.base_150| |c_#StackHeapBarrier|)))) (forall ((|v_node_create_~temp~0#1.base_150| Int)) (or (forall ((v_ArrVal_10787 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_150| v_ArrVal_10787) |c_ULTIMATE.start_main_~#s~0#1.base|) (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0))) (< |v_node_create_~temp~0#1.base_150| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (< |v_node_create_~temp~0#1.base_150| |c_#StackHeapBarrier|)))) (forall ((|v_node_create_~temp~0#1.base_150| Int)) (or (< |v_node_create_~temp~0#1.base_150| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_10787 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.base| Int)) (or (= |ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((|ULTIMATE.start_dll_append_~last~0#1.offset| Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_150| v_ArrVal_10787) |ULTIMATE.start_dll_append_~last~0#1.base|) (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0))))) (not (< |v_node_create_~temp~0#1.base_150| |c_#StackHeapBarrier|))))) is different from false [2022-11-20 11:29:53,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875732888] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:29:53,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:29:53,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 37 [2022-11-20 11:29:53,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668775113] [2022-11-20 11:29:53,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:29:53,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-20 11:29:53,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:29:53,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-20 11:29:53,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1533, Unknown=21, NotChecked=80, Total=1806 [2022-11-20 11:29:53,551 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 38 states, 36 states have (on average 3.3055555555555554) internal successors, (119), 32 states have internal predecessors, (119), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 11:29:58,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:29:58,401 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2022-11-20 11:29:58,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 11:29:58,402 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 3.3055555555555554) internal successors, (119), 32 states have internal predecessors, (119), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 85 [2022-11-20 11:29:58,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:29:58,402 INFO L225 Difference]: With dead ends: 83 [2022-11-20 11:29:58,402 INFO L226 Difference]: Without dead ends: 83 [2022-11-20 11:29:58,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 103 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=374, Invalid=2689, Unknown=21, NotChecked=108, Total=3192 [2022-11-20 11:29:58,403 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 275 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:29:58,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 494 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 814 Invalid, 0 Unknown, 3 Unchecked, 2.1s Time] [2022-11-20 11:29:58,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-20 11:29:58,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2022-11-20 11:29:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 77 states have internal predecessors, (78), 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-20 11:29:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2022-11-20 11:29:58,407 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 85 [2022-11-20 11:29:58,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:29:58,408 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2022-11-20 11:29:58,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 3.3055555555555554) internal successors, (119), 32 states have internal predecessors, (119), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 11:29:58,408 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-11-20 11:29:58,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-20 11:29:58,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:29:58,409 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:29:58,418 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-11-20 11:29:58,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-11-20 11:29:58,610 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:29:58,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:29:58,610 INFO L85 PathProgramCache]: Analyzing trace with hash 573944975, now seen corresponding path program 1 times [2022-11-20 11:29:58,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:29:58,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108453713] [2022-11-20 11:29:58,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:29:58,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:29:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:05,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:30:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:06,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:30:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:07,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:30:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:30:10,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:10,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108453713] [2022-11-20 11:30:10,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108453713] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:30:10,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445659548] [2022-11-20 11:30:10,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:10,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:30:10,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:30:10,376 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:30:10,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-20 11:30:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:11,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-20 11:30:11,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:30:14,395 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:30:14,461 INFO L321 Elim1Store]: treesize reduction 18, result has 50.0 percent of original size [2022-11-20 11:30:14,461 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 79 treesize of output 63 [2022-11-20 11:30:14,545 INFO L321 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-11-20 11:30:14,546 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 54 treesize of output 40 [2022-11-20 11:30:15,737 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-20 11:30:15,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:30:18,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:30:18,125 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 46 treesize of output 50 [2022-11-20 11:30:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-20 11:30:20,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445659548] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:30:20,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:30:20,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 14, 14] total 68 [2022-11-20 11:30:20,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408258165] [2022-11-20 11:30:20,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:30:20,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-11-20 11:30:20,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:20,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-11-20 11:30:20,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=4472, Unknown=0, NotChecked=0, Total=4692 [2022-11-20 11:30:20,627 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand has 69 states, 67 states have (on average 2.4477611940298507) internal successors, (164), 65 states have internal predecessors, (164), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-20 11:30:37,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:30:37,944 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-11-20 11:30:37,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-20 11:30:37,945 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 67 states have (on average 2.4477611940298507) internal successors, (164), 65 states have internal predecessors, (164), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 88 [2022-11-20 11:30:37,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:30:37,945 INFO L225 Difference]: With dead ends: 94 [2022-11-20 11:30:37,946 INFO L226 Difference]: Without dead ends: 94 [2022-11-20 11:30:37,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=494, Invalid=9012, Unknown=0, NotChecked=0, Total=9506 [2022-11-20 11:30:37,947 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 178 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 2740 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 2897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:30:37,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 702 Invalid, 2897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2740 Invalid, 0 Unknown, 126 Unchecked, 7.5s Time] [2022-11-20 11:30:37,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-20 11:30:37,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2022-11-20 11:30:37,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 78 states have (on average 1.0897435897435896) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 11:30:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2022-11-20 11:30:37,951 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 88 [2022-11-20 11:30:37,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:30:37,951 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2022-11-20 11:30:37,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 67 states have (on average 2.4477611940298507) internal successors, (164), 65 states have internal predecessors, (164), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-20 11:30:37,952 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-11-20 11:30:37,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-20 11:30:37,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:30:37,953 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:30:37,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-20 11:30:38,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-11-20 11:30:38,162 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-20 11:30:38,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:38,163 INFO L85 PathProgramCache]: Analyzing trace with hash 573944974, now seen corresponding path program 1 times [2022-11-20 11:30:38,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:38,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085316929] [2022-11-20 11:30:38,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:38,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:30:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:43,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:30:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:43,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:30:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:45,211 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 41 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:30:45,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:45,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085316929] [2022-11-20 11:30:45,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085316929] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:30:45,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141242804] [2022-11-20 11:30:45,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:45,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:30:45,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:30:45,213 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:30:45,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe708b-c871-4242-9302-aaf0b6f443d1/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-20 11:30:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:46,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 148 conjunts are in the unsatisfiable core [2022-11-20 11:30:46,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:30:46,235 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-20 11:30:48,068 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:30:48,068 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 17 treesize of output 21 [2022-11-20 11:30:48,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:30:49,036 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:30:49,036 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 34 treesize of output 35 [2022-11-20 11:30:50,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:30:50,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 22 [2022-11-20 11:30:50,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 11:30:51,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:30:51,600 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-20 11:30:51,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:30:51,641 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-20 11:30:51,642 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 44 [2022-11-20 11:30:51,704 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:30:51,704 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-20 11:30:52,568 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