./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0102-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 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_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0102-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a --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 fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f --- 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-b5237d8 [2022-11-21 16:26:24,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:26:24,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:26:24,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:26:24,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:26:24,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:26:24,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:26:24,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:26:24,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:26:24,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:26:24,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:26:24,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:26:24,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:26:24,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:26:24,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:26:24,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:26:24,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:26:24,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:26:24,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:26:24,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:26:24,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:26:24,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:26:24,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:26:24,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:26:24,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:26:24,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:26:24,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:26:24,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:26:24,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:26:24,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:26:24,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:26:24,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:26:24,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:26:24,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:26:24,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:26:24,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:26:24,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:26:24,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:26:24,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:26:24,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:26:24,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:26:24,446 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 16:26:24,483 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:26:24,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:26:24,484 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:26:24,484 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:26:24,485 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:26:24,485 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:26:24,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:26:24,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:26:24,486 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:26:24,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:26:24,488 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:26:24,488 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:26:24,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:26:24,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:26:24,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:26:24,489 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 16:26:24,489 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 16:26:24,489 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 16:26:24,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:26:24,490 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:26:24,490 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:26:24,490 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:26:24,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:26:24,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:26:24,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:26:24,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:26:24,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:26:24,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:26:24,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:26:24,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:26:24,493 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_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/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_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a 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 -> fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f [2022-11-21 16:26:24,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:26:24,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:26:24,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:26:24,813 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:26:24,813 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:26:24,815 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/memsafety/test-0102-1.i [2022-11-21 16:26:27,899 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:26:28,190 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:26:28,200 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/sv-benchmarks/c/memsafety/test-0102-1.i [2022-11-21 16:26:28,227 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/data/c5e1d069d/577903c356984d1ea848d8ff67720761/FLAGa56267730 [2022-11-21 16:26:28,242 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/data/c5e1d069d/577903c356984d1ea848d8ff67720761 [2022-11-21 16:26:28,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:26:28,250 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:26:28,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:26:28,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:26:28,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:26:28,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:26:28" (1/1) ... [2022-11-21 16:26:28,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6224ea22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:26:28, skipping insertion in model container [2022-11-21 16:26:28,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:26:28" (1/1) ... [2022-11-21 16:26:28,265 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:26:28,301 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:26:28,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:26:28,627 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-11-21 16:26:28,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4f1ac7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:26:28, skipping insertion in model container [2022-11-21 16:26:28,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:26:28,629 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-21 16:26:28,631 INFO L158 Benchmark]: Toolchain (without parser) took 380.20ms. Allocated memory is still 207.6MB. Free memory was 174.5MB in the beginning and 162.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-21 16:26:28,631 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 142.6MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:26:28,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.44ms. Allocated memory is still 207.6MB. Free memory was 174.5MB in the beginning and 162.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-21 16:26:28,634 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 142.6MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.44ms. Allocated memory is still 207.6MB. Free memory was 174.5MB in the beginning and 162.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 551]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0102-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a --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 fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f --- 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-b5237d8 [2022-11-21 16:26:30,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:26:30,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:26:31,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:26:31,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:26:31,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:26:31,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:26:31,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:26:31,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:26:31,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:26:31,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:26:31,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:26:31,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:26:31,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:26:31,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:26:31,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:26:31,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:26:31,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:26:31,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:26:31,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:26:31,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:26:31,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:26:31,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:26:31,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:26:31,064 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:26:31,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:26:31,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:26:31,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:26:31,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:26:31,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:26:31,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:26:31,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:26:31,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:26:31,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:26:31,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:26:31,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:26:31,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:26:31,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:26:31,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:26:31,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:26:31,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:26:31,105 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-21 16:26:31,145 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:26:31,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:26:31,147 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:26:31,147 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:26:31,148 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:26:31,148 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:26:31,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:26:31,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:26:31,150 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:26:31,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:26:31,151 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:26:31,152 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:26:31,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:26:31,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:26:31,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:26:31,153 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 16:26:31,153 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 16:26:31,153 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 16:26:31,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:26:31,154 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:26:31,154 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-21 16:26:31,154 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-21 16:26:31,155 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:26:31,155 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:26:31,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:26:31,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:26:31,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:26:31,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:26:31,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:26:31,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:26:31,157 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-21 16:26:31,157 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-21 16:26:31,158 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-21 16:26:31,158 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/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_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a 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 -> fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f [2022-11-21 16:26:31,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:26:31,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:26:31,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:26:31,630 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:26:31,632 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:26:31,634 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/memsafety/test-0102-1.i [2022-11-21 16:26:34,773 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:26:35,077 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:26:35,077 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/sv-benchmarks/c/memsafety/test-0102-1.i [2022-11-21 16:26:35,090 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/data/bcdb2d880/17ed2f62e623440a9a6265bc8a9a93e8/FLAG914b286c8 [2022-11-21 16:26:35,106 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/data/bcdb2d880/17ed2f62e623440a9a6265bc8a9a93e8 [2022-11-21 16:26:35,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:26:35,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:26:35,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:26:35,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:26:35,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:26:35,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:26:35" (1/1) ... [2022-11-21 16:26:35,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9f29519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:26:35, skipping insertion in model container [2022-11-21 16:26:35,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:26:35" (1/1) ... [2022-11-21 16:26:35,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:26:35,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:26:35,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:26:35,502 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-21 16:26:35,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:26:35,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:26:35,594 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:26:35,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:26:35,711 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:26:35,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:26:35 WrapperNode [2022-11-21 16:26:35,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:26:35,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:26:35,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:26:35,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:26:35,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:26:35" (1/1) ... [2022-11-21 16:26:35,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:26:35" (1/1) ... [2022-11-21 16:26:35,807 INFO L138 Inliner]: procedures = 136, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 86 [2022-11-21 16:26:35,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:26:35,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:26:35,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:26:35,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:26:35,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:26:35" (1/1) ... [2022-11-21 16:26:35,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:26:35" (1/1) ... [2022-11-21 16:26:35,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:26:35" (1/1) ... [2022-11-21 16:26:35,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:26:35" (1/1) ... [2022-11-21 16:26:35,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:26:35" (1/1) ... [2022-11-21 16:26:35,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:26:35" (1/1) ... [2022-11-21 16:26:35,872 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:26:35" (1/1) ... [2022-11-21 16:26:35,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:26:35" (1/1) ... [2022-11-21 16:26:35,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:26:35,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:26:35,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:26:35,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:26:35,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:26:35" (1/1) ... [2022-11-21 16:26:35,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:26:35,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:26:35,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:26:35,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:26:35,965 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-11-21 16:26:35,965 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-11-21 16:26:35,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:26:35,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:26:35,966 INFO L130 BoogieDeclarations]: Found specification of procedure create_sub_list [2022-11-21 16:26:35,966 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sub_list [2022-11-21 16:26:35,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:26:35,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 16:26:35,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 16:26:35,967 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_sub [2022-11-21 16:26:35,967 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_sub [2022-11-21 16:26:35,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-21 16:26:35,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:26:35,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 16:26:35,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-21 16:26:35,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:26:35,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:26:36,173 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:26:36,175 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:26:36,671 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:26:36,677 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:26:36,681 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-21 16:26:36,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:26:36 BoogieIcfgContainer [2022-11-21 16:26:36,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:26:36,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:26:36,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:26:36,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:26:36,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:26:35" (1/3) ... [2022-11-21 16:26:36,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320e2a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:26:36, skipping insertion in model container [2022-11-21 16:26:36,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:26:35" (2/3) ... [2022-11-21 16:26:36,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320e2a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:26:36, skipping insertion in model container [2022-11-21 16:26:36,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:26:36" (3/3) ... [2022-11-21 16:26:36,697 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0102-1.i [2022-11-21 16:26:36,716 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:26:36,716 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-11-21 16:26:36,783 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:26:36,791 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;@7efea285, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:26:36,791 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-11-21 16:26:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 46 states have (on average 1.891304347826087) internal successors, (87), 77 states have internal predecessors, (87), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 16:26:36,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 16:26:36,807 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:26:36,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 16:26:36,810 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:26:36,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:26:36,820 INFO L85 PathProgramCache]: Analyzing trace with hash 106012329, now seen corresponding path program 1 times [2022-11-21 16:26:36,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:26:36,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359649605] [2022-11-21 16:26:36,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:26:36,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:36,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:26:36,847 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:26:36,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-21 16:26:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:26:36,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-21 16:26:36,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:26:37,001 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-21 16:26:37,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:26:37,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:26:37,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359649605] [2022-11-21 16:26:37,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359649605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:26:37,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:26:37,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:26:37,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423782061] [2022-11-21 16:26:37,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:26:37,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:26:37,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:26:37,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:26:37,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:26:37,070 INFO L87 Difference]: Start difference. First operand has 87 states, 46 states have (on average 1.891304347826087) internal successors, (87), 77 states have internal predecessors, (87), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:37,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:26:37,105 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2022-11-21 16:26:37,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:26:37,107 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-21 16:26:37,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:26:37,117 INFO L225 Difference]: With dead ends: 87 [2022-11-21 16:26:37,117 INFO L226 Difference]: Without dead ends: 85 [2022-11-21 16:26:37,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:26:37,124 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:26:37,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:26:37,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-21 16:26:37,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-11-21 16:26:37,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 75 states have internal predecessors, (79), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 16:26:37,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2022-11-21 16:26:37,180 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 5 [2022-11-21 16:26:37,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:26:37,180 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2022-11-21 16:26:37,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2022-11-21 16:26:37,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-21 16:26:37,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:26:37,181 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:26:37,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-21 16:26:37,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:37,393 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:26:37,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:26:37,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1219357814, now seen corresponding path program 1 times [2022-11-21 16:26:37,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:26:37,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761928699] [2022-11-21 16:26:37,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:26:37,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:37,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:26:37,400 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:26:37,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-21 16:26:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:26:37,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:26:37,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:26:37,564 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 7 [2022-11-21 16:26:37,630 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-21 16:26:37,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:26:37,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:26:37,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761928699] [2022-11-21 16:26:37,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761928699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:26:37,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:26:37,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:26:37,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581776262] [2022-11-21 16:26:37,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:26:37,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:26:37,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:26:37,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:26:37,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:26:37,641 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-21 16:26:37,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:26:37,963 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-11-21 16:26:37,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:26:37,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-21 16:26:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:26:37,966 INFO L225 Difference]: With dead ends: 91 [2022-11-21 16:26:37,966 INFO L226 Difference]: Without dead ends: 91 [2022-11-21 16:26:37,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:26:37,968 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 39 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:26:37,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 190 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:26:37,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-21 16:26:37,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2022-11-21 16:26:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 45 states have (on average 1.711111111111111) internal successors, (77), 73 states have internal predecessors, (77), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 16:26:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-11-21 16:26:37,979 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 7 [2022-11-21 16:26:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:26:37,979 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-11-21 16:26:37,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-21 16:26:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-11-21 16:26:37,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-21 16:26:37,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:26:37,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:26:37,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:26:38,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:38,200 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:26:38,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:26:38,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1219357813, now seen corresponding path program 1 times [2022-11-21 16:26:38,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:26:38,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082547550] [2022-11-21 16:26:38,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:26:38,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:38,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:26:38,208 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:26:38,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-21 16:26:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:26:38,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-21 16:26:38,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:26:38,361 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-21 16:26:38,441 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-21 16:26:38,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:26:38,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:26:38,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082547550] [2022-11-21 16:26:38,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082547550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:26:38,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:26:38,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:26:38,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999120425] [2022-11-21 16:26:38,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:26:38,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:26:38,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:26:38,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:26:38,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:26:38,453 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-21 16:26:38,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:26:38,755 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2022-11-21 16:26:38,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:26:38,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-21 16:26:38,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:26:38,758 INFO L225 Difference]: With dead ends: 87 [2022-11-21 16:26:38,758 INFO L226 Difference]: Without dead ends: 87 [2022-11-21 16:26:38,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:26:38,759 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 5 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:26:38,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 254 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:26:38,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-21 16:26:38,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2022-11-21 16:26:38,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 16:26:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2022-11-21 16:26:38,774 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 7 [2022-11-21 16:26:38,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:26:38,776 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2022-11-21 16:26:38,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-21 16:26:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-11-21 16:26:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 16:26:38,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:26:38,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:26:38,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:26:38,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:38,979 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting create_sub_listErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:26:38,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:26:38,980 INFO L85 PathProgramCache]: Analyzing trace with hash -778231822, now seen corresponding path program 1 times [2022-11-21 16:26:38,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:26:38,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909263208] [2022-11-21 16:26:38,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:26:38,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:38,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:26:38,982 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:26:38,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-21 16:26:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:26:39,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:26:39,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:26:39,084 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 7 [2022-11-21 16:26:39,093 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-21 16:26:39,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:26:39,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:26:39,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909263208] [2022-11-21 16:26:39,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909263208] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:26:39,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:26:39,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:26:39,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794359065] [2022-11-21 16:26:39,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:26:39,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:26:39,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:26:39,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:26:39,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:26:39,102 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:26:39,227 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2022-11-21 16:26:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:26:39,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-21 16:26:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:26:39,229 INFO L225 Difference]: With dead ends: 86 [2022-11-21 16:26:39,229 INFO L226 Difference]: Without dead ends: 86 [2022-11-21 16:26:39,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-21 16:26:39,230 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:26:39,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 132 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:26:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-21 16:26:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-11-21 16:26:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 74 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 16:26:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2022-11-21 16:26:39,236 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 11 [2022-11-21 16:26:39,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:26:39,237 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2022-11-21 16:26:39,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:39,237 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2022-11-21 16:26:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 16:26:39,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:26:39,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:26:39,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:26:39,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:39,438 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting create_sub_listErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:26:39,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:26:39,439 INFO L85 PathProgramCache]: Analyzing trace with hash -778231821, now seen corresponding path program 1 times [2022-11-21 16:26:39,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:26:39,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590023587] [2022-11-21 16:26:39,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:26:39,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:39,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:26:39,441 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:26:39,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-21 16:26:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:26:39,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 16:26:39,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:26:39,568 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-21 16:26:39,598 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-21 16:26:39,599 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:26:39,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:26:39,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590023587] [2022-11-21 16:26:39,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590023587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:26:39,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:26:39,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:26:39,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156678241] [2022-11-21 16:26:39,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:26:39,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:26:39,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:26:39,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:26:39,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:26:39,602 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:26:39,750 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2022-11-21 16:26:39,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:26:39,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-21 16:26:39,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:26:39,752 INFO L225 Difference]: With dead ends: 85 [2022-11-21 16:26:39,752 INFO L226 Difference]: Without dead ends: 85 [2022-11-21 16:26:39,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-21 16:26:39,754 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 5 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:26:39,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 136 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:26:39,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-21 16:26:39,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2022-11-21 16:26:39,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 48 states have (on average 1.625) internal successors, (78), 73 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 16:26:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-11-21 16:26:39,761 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 11 [2022-11-21 16:26:39,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:26:39,762 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-11-21 16:26:39,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-11-21 16:26:39,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:26:39,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:26:39,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:26:39,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:26:39,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:39,980 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting list_add_tailErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:26:39,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:26:39,980 INFO L85 PathProgramCache]: Analyzing trace with hash -70636768, now seen corresponding path program 1 times [2022-11-21 16:26:39,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:26:39,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351177396] [2022-11-21 16:26:39,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:26:39,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:39,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:26:39,983 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:26:39,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-21 16:26:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:26:40,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-21 16:26:40,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:26:40,177 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-21 16:26:40,184 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 7 [2022-11-21 16:26:40,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:40,348 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-21 16:26:40,365 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:26:40,366 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 13 treesize of output 13 [2022-11-21 16:26:40,451 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-21 16:26:40,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:26:40,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:26:40,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351177396] [2022-11-21 16:26:40,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351177396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:26:40,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:26:40,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:26:40,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64695405] [2022-11-21 16:26:40,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:26:40,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:26:40,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:26:40,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:26:40,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:26:40,453 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:26:41,158 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2022-11-21 16:26:41,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:26:41,159 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 16:26:41,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:26:41,160 INFO L225 Difference]: With dead ends: 112 [2022-11-21 16:26:41,160 INFO L226 Difference]: Without dead ends: 112 [2022-11-21 16:26:41,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:26:41,161 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 54 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:26:41,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 331 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 16:26:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-21 16:26:41,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2022-11-21 16:26:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 89 states have internal predecessors, (103), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-21 16:26:41,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2022-11-21 16:26:41,170 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 14 [2022-11-21 16:26:41,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:26:41,170 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2022-11-21 16:26:41,171 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2022-11-21 16:26:41,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:26:41,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:26:41,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:26:41,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-21 16:26:41,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:41,384 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting list_add_tailErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:26:41,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:26:41,385 INFO L85 PathProgramCache]: Analyzing trace with hash -70636769, now seen corresponding path program 1 times [2022-11-21 16:26:41,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:26:41,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485605493] [2022-11-21 16:26:41,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:26:41,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:41,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:26:41,387 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:26:41,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-21 16:26:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:26:41,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 16:26:41,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:26:41,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 7 [2022-11-21 16:26:41,577 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 16:26:41,578 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 20 [2022-11-21 16:26:41,646 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-21 16:26:41,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:26:41,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:26:41,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485605493] [2022-11-21 16:26:41,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485605493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:26:41,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:26:41,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:26:41,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724884835] [2022-11-21 16:26:41,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:26:41,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:26:41,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:26:41,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:26:41,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:26:41,649 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:26:42,181 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2022-11-21 16:26:42,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:26:42,182 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 16:26:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:26:42,183 INFO L225 Difference]: With dead ends: 131 [2022-11-21 16:26:42,183 INFO L226 Difference]: Without dead ends: 131 [2022-11-21 16:26:42,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 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-21 16:26:42,184 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 87 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:26:42,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 278 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:26:42,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-21 16:26:42,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2022-11-21 16:26:42,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.6666666666666667) internal successors, (120), 98 states have internal predecessors, (120), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-21 16:26:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2022-11-21 16:26:42,190 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 14 [2022-11-21 16:26:42,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:26:42,190 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2022-11-21 16:26:42,190 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2022-11-21 16:26:42,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 16:26:42,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:26:42,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:26:42,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-21 16:26:42,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:42,409 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting list_add_tailErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:26:42,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:26:42,410 INFO L85 PathProgramCache]: Analyzing trace with hash 837542848, now seen corresponding path program 1 times [2022-11-21 16:26:42,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:26:42,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279654565] [2022-11-21 16:26:42,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:26:42,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:42,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:26:42,412 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:26:42,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-21 16:26:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:26:42,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 16:26:42,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:26:42,560 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-21 16:26:42,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:26:42,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:26:42,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279654565] [2022-11-21 16:26:42,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279654565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:26:42,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:26:42,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:26:42,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256199290] [2022-11-21 16:26:42,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:26:42,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:26:42,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:26:42,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:26:42,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:26:42,563 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:26:42,736 INFO L93 Difference]: Finished difference Result 111 states and 131 transitions. [2022-11-21 16:26:42,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:26:42,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 16:26:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:26:42,737 INFO L225 Difference]: With dead ends: 111 [2022-11-21 16:26:42,737 INFO L226 Difference]: Without dead ends: 111 [2022-11-21 16:26:42,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:26:42,738 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 27 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:26:42,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 169 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:26:42,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-21 16:26:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-11-21 16:26:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.625) internal successors, (117), 97 states have internal predecessors, (117), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-21 16:26:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2022-11-21 16:26:42,744 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 16 [2022-11-21 16:26:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:26:42,744 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2022-11-21 16:26:42,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2022-11-21 16:26:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 16:26:42,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:26:42,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:26:42,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-21 16:26:42,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:42,946 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting list_add_tailErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:26:42,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:26:42,946 INFO L85 PathProgramCache]: Analyzing trace with hash 837542849, now seen corresponding path program 1 times [2022-11-21 16:26:42,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:26:42,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330651465] [2022-11-21 16:26:42,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:26:42,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:42,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:26:42,948 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:26:42,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-21 16:26:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:26:43,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 16:26:43,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:26:43,225 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-21 16:26:43,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:26:43,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:26:43,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330651465] [2022-11-21 16:26:43,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330651465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:26:43,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:26:43,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:26:43,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75075695] [2022-11-21 16:26:43,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:26:43,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:26:43,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:26:43,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:26:43,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:26:43,227 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:26:43,684 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2022-11-21 16:26:43,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:26:43,685 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 16:26:43,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:26:43,691 INFO L225 Difference]: With dead ends: 119 [2022-11-21 16:26:43,691 INFO L226 Difference]: Without dead ends: 119 [2022-11-21 16:26:43,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-11-21 16:26:43,692 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 97 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:26:43,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 511 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:26:43,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-21 16:26:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2022-11-21 16:26:43,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.6111111111111112) internal successors, (116), 97 states have internal predecessors, (116), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-21 16:26:43,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2022-11-21 16:26:43,712 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 16 [2022-11-21 16:26:43,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:26:43,712 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2022-11-21 16:26:43,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:43,713 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2022-11-21 16:26:43,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 16:26:43,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:26:43,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:26:43,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-21 16:26:43,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:43,914 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting list_add_tailErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:26:43,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:26:43,915 INFO L85 PathProgramCache]: Analyzing trace with hash 194024551, now seen corresponding path program 1 times [2022-11-21 16:26:43,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:26:43,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099081534] [2022-11-21 16:26:43,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:26:43,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:43,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:26:43,917 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:26:43,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-21 16:26:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:26:44,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:26:44,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:26:44,061 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 7 [2022-11-21 16:26:44,118 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-21 16:26:44,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:26:44,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:26:44,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099081534] [2022-11-21 16:26:44,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099081534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:26:44,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:26:44,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:26:44,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506679010] [2022-11-21 16:26:44,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:26:44,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:26:44,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:26:44,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:26:44,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:26:44,121 INFO L87 Difference]: Start difference. First operand 111 states and 130 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:26:44,484 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-11-21 16:26:44,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:26:44,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 16:26:44,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:26:44,486 INFO L225 Difference]: With dead ends: 118 [2022-11-21 16:26:44,486 INFO L226 Difference]: Without dead ends: 118 [2022-11-21 16:26:44,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:26:44,487 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 49 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:26:44,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 251 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:26:44,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-21 16:26:44,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2022-11-21 16:26:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 96 states have internal predecessors, (111), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-21 16:26:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2022-11-21 16:26:44,493 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 17 [2022-11-21 16:26:44,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:26:44,494 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2022-11-21 16:26:44,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2022-11-21 16:26:44,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 16:26:44,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:26:44,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:26:44,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-21 16:26:44,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:44,707 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting list_add_tailErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:26:44,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:26:44,708 INFO L85 PathProgramCache]: Analyzing trace with hash 194024552, now seen corresponding path program 1 times [2022-11-21 16:26:44,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:26:44,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799983833] [2022-11-21 16:26:44,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:26:44,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:44,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:26:44,709 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:26:44,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-21 16:26:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:26:44,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-21 16:26:44,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:26:44,847 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-21 16:26:44,945 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-21 16:26:44,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:26:44,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:26:44,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799983833] [2022-11-21 16:26:44,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799983833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:26:44,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:26:44,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:26:44,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437022162] [2022-11-21 16:26:44,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:26:44,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:26:44,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:26:44,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:26:44,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:26:44,948 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:45,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:26:45,366 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-11-21 16:26:45,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:26:45,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 16:26:45,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:26:45,370 INFO L225 Difference]: With dead ends: 116 [2022-11-21 16:26:45,370 INFO L226 Difference]: Without dead ends: 116 [2022-11-21 16:26:45,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:26:45,371 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 36 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:26:45,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 271 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:26:45,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-21 16:26:45,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2022-11-21 16:26:45,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 96 states have internal predecessors, (107), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-21 16:26:45,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-11-21 16:26:45,377 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 17 [2022-11-21 16:26:45,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:26:45,378 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-11-21 16:26:45,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:45,378 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-11-21 16:26:45,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:26:45,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:26:45,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:26:45,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-21 16:26:45,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:45,583 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting list_add_tailErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:26:45,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:26:45,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1774001130, now seen corresponding path program 1 times [2022-11-21 16:26:45,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:26:45,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146340632] [2022-11-21 16:26:45,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:26:45,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:45,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:26:45,585 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:26:45,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-21 16:26:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:26:45,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-21 16:26:45,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:26:45,793 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 7 [2022-11-21 16:26:45,829 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-21 16:26:45,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 16:26:45,898 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:26:45,898 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 13 treesize of output 13 [2022-11-21 16:26:45,943 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-21 16:26:46,032 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 7 [2022-11-21 16:26:46,084 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-21 16:26:46,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:26:46,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:26:46,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146340632] [2022-11-21 16:26:46,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146340632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:26:46,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:26:46,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 16:26:46,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790647217] [2022-11-21 16:26:46,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:26:46,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 16:26:46,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:26:46,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 16:26:46,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:26:46,086 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:47,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:26:47,136 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2022-11-21 16:26:47,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 16:26:47,137 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 16:26:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:26:47,138 INFO L225 Difference]: With dead ends: 145 [2022-11-21 16:26:47,138 INFO L226 Difference]: Without dead ends: 145 [2022-11-21 16:26:47,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-11-21 16:26:47,139 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 62 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:26:47,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 435 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 16:26:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-21 16:26:47,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2022-11-21 16:26:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 92 states have (on average 1.423913043478261) internal successors, (131), 116 states have internal predecessors, (131), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-21 16:26:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2022-11-21 16:26:47,145 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 19 [2022-11-21 16:26:47,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:26:47,146 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2022-11-21 16:26:47,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-11-21 16:26:47,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:26:47,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:26:47,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:26:47,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-21 16:26:47,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:47,355 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:26:47,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:26:47,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1774001131, now seen corresponding path program 1 times [2022-11-21 16:26:47,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:26:47,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845415115] [2022-11-21 16:26:47,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:26:47,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:47,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:26:47,357 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:26:47,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-21 16:26:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:26:47,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-21 16:26:47,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:26:47,601 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 7 [2022-11-21 16:26:47,610 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-21 16:26:47,699 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-21 16:26:47,707 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-21 16:26:47,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:47,758 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-21 16:26:47,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:47,786 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-21 16:26:47,829 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:26:47,829 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 13 treesize of output 13 [2022-11-21 16:26:47,843 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-21 16:26:47,930 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-21 16:26:47,952 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-21 16:26:48,103 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-21 16:26:48,109 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-21 16:26:48,194 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-21 16:26:48,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:26:48,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:26:48,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845415115] [2022-11-21 16:26:48,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845415115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:26:48,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:26:48,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 16:26:48,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826609054] [2022-11-21 16:26:48,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:26:48,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 16:26:48,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:26:48,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 16:26:48,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:26:48,196 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:49,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:26:49,595 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2022-11-21 16:26:49,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 16:26:49,596 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 16:26:49,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:26:49,598 INFO L225 Difference]: With dead ends: 135 [2022-11-21 16:26:49,598 INFO L226 Difference]: Without dead ends: 135 [2022-11-21 16:26:49,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-11-21 16:26:49,599 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 35 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:26:49,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 508 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-21 16:26:49,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-21 16:26:49,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-11-21 16:26:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 119 states have internal predecessors, (132), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-21 16:26:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2022-11-21 16:26:49,613 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 19 [2022-11-21 16:26:49,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:26:49,615 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2022-11-21 16:26:49,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:49,616 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2022-11-21 16:26:49,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 16:26:49,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:26:49,620 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:26:49,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-21 16:26:49,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:49,835 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:26:49,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:26:49,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1031850971, now seen corresponding path program 1 times [2022-11-21 16:26:49,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:26:49,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481976619] [2022-11-21 16:26:49,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:26:49,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:26:49,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:26:49,837 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:26:49,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-21 16:26:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:26:50,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-21 16:26:50,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:26:50,098 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 7 [2022-11-21 16:26:50,104 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-21 16:26:50,189 WARN L859 $PredicateComparison]: unable to prove that (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_448 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_448))) (= (_ bv0 1) (select |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base|)))) is different from true [2022-11-21 16:26:50,214 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-21 16:26:50,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:50,269 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-21 16:26:50,280 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:26:50,281 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 13 treesize of output 13 [2022-11-21 16:26:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:26:50,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:26:52,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:26:52,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481976619] [2022-11-21 16:26:52,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481976619] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:26:52,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [786075888] [2022-11-21 16:26:52,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:26:52,796 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 16:26:52,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 16:26:52,801 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 16:26:52,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-11-21 16:26:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:26:53,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-21 16:26:53,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:26:53,245 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 7 [2022-11-21 16:26:53,253 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-21 16:26:53,452 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-21 16:26:53,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:26:53,810 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-21 16:26:53,825 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:26:53,825 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 13 treesize of output 13 [2022-11-21 16:26:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:26:53,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:26:54,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [786075888] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:26:54,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:26:54,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 13 [2022-11-21 16:26:54,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734069913] [2022-11-21 16:26:54,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:26:54,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 16:26:54,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:26:54,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 16:26:54,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=263, Unknown=3, NotChecked=32, Total=342 [2022-11-21 16:26:54,653 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 16:26:57,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 16:27:01,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 16:27:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:27:04,954 INFO L93 Difference]: Finished difference Result 163 states and 184 transitions. [2022-11-21 16:27:04,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:27:04,955 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-11-21 16:27:04,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:27:04,957 INFO L225 Difference]: With dead ends: 163 [2022-11-21 16:27:04,957 INFO L226 Difference]: Without dead ends: 163 [2022-11-21 16:27:04,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=80, Invalid=471, Unknown=5, NotChecked=44, Total=600 [2022-11-21 16:27:04,958 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 83 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:27:04,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 292 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 664 Invalid, 2 Unknown, 88 Unchecked, 5.7s Time] [2022-11-21 16:27:04,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-21 16:27:04,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 143. [2022-11-21 16:27:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.39) internal successors, (139), 124 states have internal predecessors, (139), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-11-21 16:27:04,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 160 transitions. [2022-11-21 16:27:04,965 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 160 transitions. Word has length 29 [2022-11-21 16:27:04,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:27:04,965 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 160 transitions. [2022-11-21 16:27:04,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 16:27:04,966 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 160 transitions. [2022-11-21 16:27:04,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-21 16:27:04,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:27:04,967 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:27:04,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-21 16:27:05,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2022-11-21 16:27:05,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt [2022-11-21 16:27:05,368 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting list_add_tailErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:27:05,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:27:05,368 INFO L85 PathProgramCache]: Analyzing trace with hash 343570640, now seen corresponding path program 1 times [2022-11-21 16:27:05,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:27:05,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165953105] [2022-11-21 16:27:05,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:27:05,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:27:05,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:27:05,370 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:27:05,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-21 16:27:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:27:05,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-21 16:27:05,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:27:06,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:06,436 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 14 treesize of output 16 [2022-11-21 16:27:06,450 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:27:06,450 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 13 treesize of output 13 [2022-11-21 16:27:06,697 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:27:06,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:27:12,870 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 60 treesize of output 54 [2022-11-21 16:27:12,957 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-11-21 16:27:12,958 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 50 treesize of output 67 [2022-11-21 16:27:13,742 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:27:13,742 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 38 treesize of output 32 [2022-11-21 16:27:13,764 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-21 16:27:13,764 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 14 [2022-11-21 16:27:14,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:27:14,381 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 38 treesize of output 40 [2022-11-21 16:27:14,518 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-21 16:27:14,518 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 14 [2022-11-21 16:27:14,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:27:14,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:27:14,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165953105] [2022-11-21 16:27:14,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165953105] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:27:14,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:27:14,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2022-11-21 16:27:14,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754108468] [2022-11-21 16:27:14,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:27:14,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-21 16:27:14,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:27:14,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-21 16:27:14,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=843, Unknown=1, NotChecked=0, Total=930 [2022-11-21 16:27:14,866 INFO L87 Difference]: Start difference. First operand 143 states and 160 transitions. Second operand has 31 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 25 states have internal predecessors, (58), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-21 16:27:20,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:27:20,916 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2022-11-21 16:27:20,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 16:27:20,917 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 25 states have internal predecessors, (58), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-11-21 16:27:20,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:27:20,918 INFO L225 Difference]: With dead ends: 151 [2022-11-21 16:27:20,918 INFO L226 Difference]: Without dead ends: 151 [2022-11-21 16:27:20,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=231, Invalid=1574, Unknown=1, NotChecked=0, Total=1806 [2022-11-21 16:27:20,920 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 250 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:27:20,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 718 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-21 16:27:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-21 16:27:20,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2022-11-21 16:27:20,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 121 states have internal predecessors, (132), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-11-21 16:27:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2022-11-21 16:27:20,927 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 36 [2022-11-21 16:27:20,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:27:20,927 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2022-11-21 16:27:20,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 25 states have internal predecessors, (58), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-21 16:27:20,928 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2022-11-21 16:27:20,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-21 16:27:20,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:27:20,929 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:27:20,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-11-21 16:27:21,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:27:21,135 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting list_add_tailErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:27:21,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:27:21,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2012582842, now seen corresponding path program 1 times [2022-11-21 16:27:21,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:27:21,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846800119] [2022-11-21 16:27:21,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:27:21,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:27:21,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:27:21,137 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:27:21,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-21 16:27:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:27:21,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-21 16:27:21,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:27:21,628 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 7 [2022-11-21 16:27:21,695 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-21 16:27:21,710 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-21 16:27:21,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:21,758 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-21 16:27:21,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:21,772 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-21 16:27:21,823 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 16:27:21,824 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 19 treesize of output 27 [2022-11-21 16:27:21,952 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-21 16:27:21,981 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-21 16:27:22,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:27:22,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:27:23,386 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 0 case distinctions, treesize of input 65 treesize of output 36 [2022-11-21 16:27:23,444 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-21 16:27:23,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 128 [2022-11-21 16:27:23,457 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 132 treesize of output 96 [2022-11-21 16:27:23,467 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 42 treesize of output 24 [2022-11-21 16:27:23,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 30 [2022-11-21 16:27:23,750 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-21 16:27:23,750 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 30 treesize of output 51 [2022-11-21 16:27:23,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-21 16:27:24,407 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 35 treesize of output 19 [2022-11-21 16:27:24,793 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:27:24,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:27:25,361 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_713) |c_create_sub_list_insert_sub_~head#1.base|) (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (_ bv1 1)))) is different from false [2022-11-21 16:27:27,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:27:27,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846800119] [2022-11-21 16:27:27,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846800119] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:27:27,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [469616086] [2022-11-21 16:27:27,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:27:27,377 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 16:27:27,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 16:27:27,378 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 16:27:27,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2022-11-21 16:27:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:27:28,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-21 16:27:28,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:27:28,188 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 7 [2022-11-21 16:27:28,222 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-21 16:27:28,231 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-21 16:27:28,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:28,250 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-21 16:27:28,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:28,265 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-21 16:27:28,311 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 16:27:28,311 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 19 treesize of output 27 [2022-11-21 16:27:28,384 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-21 16:27:28,412 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-21 16:27:28,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:27:28,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:27:29,310 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 0 case distinctions, treesize of input 65 treesize of output 36 [2022-11-21 16:27:29,373 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-21 16:27:29,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 128 [2022-11-21 16:27:29,383 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 44 treesize of output 26 [2022-11-21 16:27:29,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:29,392 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 120 treesize of output 84 [2022-11-21 16:27:29,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 22 [2022-11-21 16:27:29,534 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-21 16:27:29,535 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 30 treesize of output 51 [2022-11-21 16:27:29,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-21 16:27:30,180 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-21 16:27:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:27:30,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:27:32,790 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_24| (_ BitVec 32)) (v_ArrVal_835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_834 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_24| v_ArrVal_834) (select (select (store |c_#memory_$Pointer$.base| |v_create_sub_list_insert_sub_~sub~0#1.base_24| v_ArrVal_835) |c_create_sub_list_~sub#1.base|) (bvadd (_ bv4 32) |c_create_sub_list_~sub#1.offset|))) (_ bv1 1))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_24|) (_ bv0 1))))) is different from false [2022-11-21 16:27:36,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [469616086] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:27:36,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:27:36,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 27 [2022-11-21 16:27:36,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396679891] [2022-11-21 16:27:36,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:27:36,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-21 16:27:36,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:27:36,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-21 16:27:36,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1199, Unknown=30, NotChecked=142, Total=1482 [2022-11-21 16:27:36,070 INFO L87 Difference]: Start difference. First operand 140 states and 153 transitions. Second operand has 28 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:27:46,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:27:46,022 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2022-11-21 16:27:46,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-21 16:27:46,023 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-11-21 16:27:46,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:27:46,024 INFO L225 Difference]: With dead ends: 160 [2022-11-21 16:27:46,024 INFO L226 Difference]: Without dead ends: 160 [2022-11-21 16:27:46,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=301, Invalid=2726, Unknown=61, NotChecked=218, Total=3306 [2022-11-21 16:27:46,026 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 87 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 27 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:27:46,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1052 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1255 Invalid, 10 Unknown, 0 Unchecked, 5.5s Time] [2022-11-21 16:27:46,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-21 16:27:46,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2022-11-21 16:27:46,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 134 states have internal predecessors, (145), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-21 16:27:46,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2022-11-21 16:27:46,033 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 35 [2022-11-21 16:27:46,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:27:46,034 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2022-11-21 16:27:46,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:27:46,034 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2022-11-21 16:27:46,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-21 16:27:46,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:27:46,035 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:27:46,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-21 16:27:46,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2022-11-21 16:27:46,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt [2022-11-21 16:27:46,451 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:27:46,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:27:46,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2012582843, now seen corresponding path program 1 times [2022-11-21 16:27:46,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:27:46,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384276213] [2022-11-21 16:27:46,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:27:46,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:27:46,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:27:46,453 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:27:46,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-21 16:27:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:27:46,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-21 16:27:46,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:27:46,919 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 7 [2022-11-21 16:27:47,009 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-21 16:27:47,016 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-21 16:27:47,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:47,070 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-21 16:27:47,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:47,080 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-21 16:27:47,135 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 16:27:47,135 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 19 treesize of output 27 [2022-11-21 16:27:47,168 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-21 16:27:47,307 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-21 16:27:47,324 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-21 16:27:47,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:27:47,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:27:49,551 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 0 case distinctions, treesize of input 120 treesize of output 91 [2022-11-21 16:27:49,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:49,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-11-21 16:27:49,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 38 [2022-11-21 16:27:49,646 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-11-21 16:27:49,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 125 [2022-11-21 16:27:49,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:49,656 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 129 treesize of output 89 [2022-11-21 16:27:49,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:27:49,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-21 16:27:50,046 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-21 16:27:50,046 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 24 treesize of output 26 [2022-11-21 16:27:50,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 16:27:50,283 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-21 16:27:50,312 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 16:27:50,312 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 74 treesize of output 64 [2022-11-21 16:27:50,767 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-21 16:27:50,775 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-21 16:27:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:27:51,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:27:52,162 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_965) |c_create_sub_list_insert_sub_~head#1.base|) .cse1))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_965) |c_create_sub_list_insert_sub_~head#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_964) |c_create_sub_list_insert_sub_~head#1.base|) .cse1)))))) is different from false [2022-11-21 16:28:04,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:28:04,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384276213] [2022-11-21 16:28:04,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384276213] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:28:04,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [673071990] [2022-11-21 16:28:04,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:04,473 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 16:28:04,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 16:28:04,474 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 16:28:04,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-11-21 16:28:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:05,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-21 16:28:05,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:28:05,809 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 7 [2022-11-21 16:28:05,845 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-21 16:28:05,856 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-21 16:28:05,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:28:05,872 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-21 16:28:05,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:28:05,892 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-21 16:28:05,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 16:28:05,966 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 16:28:05,966 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 19 treesize of output 27 [2022-11-21 16:28:06,069 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-21 16:28:06,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 16:28:06,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:28:06,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:28:11,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 91 [2022-11-21 16:28:11,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:28:11,462 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-11-21 16:28:11,471 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 0 case distinctions, treesize of input 86 treesize of output 45 [2022-11-21 16:28:11,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:28:11,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-21 16:28:11,544 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-11-21 16:28:11,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 125 [2022-11-21 16:28:11,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:28:11,555 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 129 treesize of output 89 [2022-11-21 16:28:12,326 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-21 16:28:12,326 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 24 treesize of output 26 [2022-11-21 16:28:12,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 16:28:12,798 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 16:28:12,798 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 89 [2022-11-21 16:28:12,809 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-21 16:28:12,883 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-21 16:28:12,893 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-21 16:28:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:28:13,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:28:13,336 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_1104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1105 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1104) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1105) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)))) (forall ((v_ArrVal_1104 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1104) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2022-11-21 16:28:25,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [673071990] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:28:25,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:28:25,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2022-11-21 16:28:25,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002963150] [2022-11-21 16:28:25,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:28:25,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-21 16:28:25,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:28:25,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-21 16:28:25,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1415, Unknown=34, NotChecked=154, Total=1722 [2022-11-21 16:28:25,703 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 31 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 28 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 16:28:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:28:39,984 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2022-11-21 16:28:39,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-21 16:28:39,985 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 28 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-21 16:28:39,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:28:39,986 INFO L225 Difference]: With dead ends: 154 [2022-11-21 16:28:39,986 INFO L226 Difference]: Without dead ends: 154 [2022-11-21 16:28:39,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=213, Invalid=2406, Unknown=41, NotChecked=202, Total=2862 [2022-11-21 16:28:39,988 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 55 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 14 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:28:39,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 750 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 980 Invalid, 20 Unknown, 0 Unchecked, 6.3s Time] [2022-11-21 16:28:39,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-21 16:28:39,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2022-11-21 16:28:39,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 134 states have internal predecessors, (144), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-21 16:28:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 167 transitions. [2022-11-21 16:28:39,994 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 167 transitions. Word has length 35 [2022-11-21 16:28:39,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:28:39,994 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 167 transitions. [2022-11-21 16:28:39,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 28 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 16:28:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 167 transitions. [2022-11-21 16:28:39,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-21 16:28:39,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:28:39,996 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:28:40,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-21 16:28:40,218 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2022-11-21 16:28:40,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt [2022-11-21 16:28:40,412 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:28:40,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:40,413 INFO L85 PathProgramCache]: Analyzing trace with hash -796271557, now seen corresponding path program 1 times [2022-11-21 16:28:40,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:28:40,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222110230] [2022-11-21 16:28:40,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:40,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:28:40,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:28:40,414 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:28:40,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-21 16:28:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:40,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-21 16:28:40,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:28:41,075 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-21 16:28:41,088 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-21 16:28:41,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:28:41,154 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-21 16:28:41,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:28:41,169 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-21 16:28:41,221 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:28:41,221 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 13 treesize of output 13 [2022-11-21 16:28:41,324 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-21 16:28:41,334 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-21 16:28:41,564 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-21 16:28:41,573 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-21 16:28:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:28:41,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:28:42,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:28:42,090 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-21 16:28:43,230 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_create_sub_list_~sub#1.offset|))) (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_33| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_33|))) (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |v_create_sub_list_insert_sub_~sub~0#1.base_33| v_ArrVal_1240) |c_create_sub_list_~sub#1.base|) .cse0) |c_create_sub_list_~sub#1.base|)))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_33| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_33|))) (forall ((v_ArrVal_1241 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |v_create_sub_list_insert_sub_~sub~0#1.base_33| v_ArrVal_1241) |c_create_sub_list_~sub#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_33| (_ BitVec 32))) (or (forall ((v_ArrVal_1241 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |v_create_sub_list_insert_sub_~sub~0#1.base_33| v_ArrVal_1241) |c_create_sub_list_~sub#1.base|) .cse0)) (bvadd (_ bv8 32) |c_create_sub_list_~sub#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_33|))))))) is different from false [2022-11-21 16:28:43,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:28:43,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-21 16:28:43,804 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 50 treesize of output 32 [2022-11-21 16:28:43,814 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 17 treesize of output 9 [2022-11-21 16:28:43,843 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-21 16:28:43,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2022-11-21 16:28:43,868 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:28:43,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2022-11-21 16:28:43,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:28:43,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-21 16:28:44,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:28:44,958 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 38 treesize of output 62 [2022-11-21 16:28:45,263 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-21 16:28:45,264 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-21 16:28:45,309 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-21 16:28:45,309 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-21 16:28:45,347 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-21 16:28:45,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:28:45,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222110230] [2022-11-21 16:28:45,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1222110230] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:28:45,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:28:45,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2022-11-21 16:28:45,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184068507] [2022-11-21 16:28:45,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:28:45,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-21 16:28:45,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:28:45,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-21 16:28:45,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=720, Unknown=20, NotChecked=54, Total=870 [2022-11-21 16:28:45,350 INFO L87 Difference]: Start difference. First operand 154 states and 167 transitions. Second operand has 30 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 16:28:48,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:29:03,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:29:03,805 INFO L93 Difference]: Finished difference Result 193 states and 212 transitions. [2022-11-21 16:29:03,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-21 16:29:03,806 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2022-11-21 16:29:03,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:29:03,808 INFO L225 Difference]: With dead ends: 193 [2022-11-21 16:29:03,808 INFO L226 Difference]: Without dead ends: 193 [2022-11-21 16:29:03,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=287, Invalid=2336, Unknown=33, NotChecked=100, Total=2756 [2022-11-21 16:29:03,810 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 114 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 24 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:29:03,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1024 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1097 Invalid, 10 Unknown, 107 Unchecked, 8.0s Time] [2022-11-21 16:29:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-11-21 16:29:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 169. [2022-11-21 16:29:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 124 states have (on average 1.2661290322580645) internal successors, (157), 148 states have internal predecessors, (157), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2022-11-21 16:29:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 182 transitions. [2022-11-21 16:29:03,818 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 182 transitions. Word has length 41 [2022-11-21 16:29:03,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:29:03,819 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 182 transitions. [2022-11-21 16:29:03,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 16:29:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 182 transitions. [2022-11-21 16:29:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-21 16:29:03,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:29:03,820 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2022-11-21 16:29:03,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-21 16:29:04,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:29:04,031 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:29:04,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:29:04,031 INFO L85 PathProgramCache]: Analyzing trace with hash 782352299, now seen corresponding path program 1 times [2022-11-21 16:29:04,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:29:04,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963701607] [2022-11-21 16:29:04,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:04,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:29:04,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:29:04,033 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:29:04,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-21 16:29:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:04,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-21 16:29:04,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:29:04,416 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-21 16:29:04,424 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 7 [2022-11-21 16:29:04,612 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-21 16:29:04,807 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:29:04,807 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 13 treesize of output 13 [2022-11-21 16:29:04,828 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_create_sub_list_insert_sub_~sub~0#1.base_38| (_ BitVec 32)) (|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32)) (v_ArrVal_1343 (_ BitVec 32)) (v_ArrVal_1342 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_create_sub_list_insert_sub_~sub~0#1.base_38|)) (= (store (store |c_old(#length)| |v_create_sub_list_insert_sub_~sub~0#1.base_38| v_ArrVal_1342) |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1343) |c_#length|) (not (= |c_create_sub_list_#in~sub#1.base| |create_sub_list_insert_sub_~sub~0#1.base|)))) is different from true [2022-11-21 16:29:04,903 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:29:04,903 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-21 16:29:04,909 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-21 16:29:05,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:29:05,053 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:29:05,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 23 [2022-11-21 16:29:05,082 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:29:05,082 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 13 treesize of output 13 [2022-11-21 16:29:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2022-11-21 16:29:05,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:29:05,829 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-21 16:29:05,829 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 14 [2022-11-21 16:29:07,901 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_insert_top_~top~0#1.offset| (_ bv24 32)))) (and (or (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_44| (_ BitVec 32))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_44|) (_ bv0 1)))) (bvule (bvadd |c_ULTIMATE.start_insert_top_~top~0#1.offset| (_ bv20 32)) .cse0)) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_44| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_44|) (_ bv0 1))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_43| (_ BitVec 32))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_43| |c_ULTIMATE.start_insert_top_~top~0#1.base|) (forall ((v_ArrVal_1349 (_ BitVec 32)) (v_ArrVal_1348 (_ BitVec 32))) (bvule .cse0 (select (store (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_44| v_ArrVal_1349) |v_create_sub_list_insert_sub_~sub~0#1.base_43| v_ArrVal_1348) |c_ULTIMATE.start_insert_top_~top~0#1.base|))))))))) is different from false [2022-11-21 16:29:07,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:29:07,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963701607] [2022-11-21 16:29:07,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963701607] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:29:07,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [649082827] [2022-11-21 16:29:07,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:07,910 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 16:29:07,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 16:29:07,911 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 16:29:07,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-11-21 16:29:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:08,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-21 16:29:08,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:29:08,689 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 7 [2022-11-21 16:29:08,697 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-21 16:29:08,983 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-21 16:29:09,203 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:29:09,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-21 16:29:09,436 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:29:09,436 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-21 16:29:09,442 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-21 16:29:09,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:29:10,015 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:29:10,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 23 [2022-11-21 16:29:10,037 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:29:10,038 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 13 treesize of output 13 [2022-11-21 16:29:10,063 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:29:10,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:29:10,958 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-21 16:29:10,958 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 14 [2022-11-21 16:29:11,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [649082827] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:29:11,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:29:11,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 21 [2022-11-21 16:29:11,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705166928] [2022-11-21 16:29:11,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:29:11,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-21 16:29:11,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:29:11,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-21 16:29:11,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=539, Unknown=4, NotChecked=94, Total=702 [2022-11-21 16:29:11,812 INFO L87 Difference]: Start difference. First operand 169 states and 182 transitions. Second operand has 22 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 16:29:14,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 16:29:19,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 16:29:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:29:25,008 INFO L93 Difference]: Finished difference Result 253 states and 290 transitions. [2022-11-21 16:29:25,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 16:29:25,009 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-11-21 16:29:25,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:29:25,011 INFO L225 Difference]: With dead ends: 253 [2022-11-21 16:29:25,011 INFO L226 Difference]: Without dead ends: 253 [2022-11-21 16:29:25,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=115, Invalid=879, Unknown=6, NotChecked=122, Total=1122 [2022-11-21 16:29:25,012 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 148 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 26 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:29:25,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 462 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1268 Invalid, 2 Unknown, 137 Unchecked, 8.2s Time] [2022-11-21 16:29:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-21 16:29:25,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 176. [2022-11-21 16:29:25,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 129 states have (on average 1.2635658914728682) internal successors, (163), 152 states have internal predecessors, (163), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (15), 11 states have call predecessors, (15), 13 states have call successors, (15) [2022-11-21 16:29:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 191 transitions. [2022-11-21 16:29:25,020 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 191 transitions. Word has length 45 [2022-11-21 16:29:25,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:29:25,021 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 191 transitions. [2022-11-21 16:29:25,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 16:29:25,021 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 191 transitions. [2022-11-21 16:29:25,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 16:29:25,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:29:25,022 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:29:25,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2022-11-21 16:29:25,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-21 16:29:25,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:29:25,434 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting list_add_tailErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:29:25,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:29:25,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1563009013, now seen corresponding path program 1 times [2022-11-21 16:29:25,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:29:25,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093277466] [2022-11-21 16:29:25,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:25,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:29:25,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:29:25,436 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:29:25,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-21 16:29:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:25,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-21 16:29:25,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:29:25,896 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 7 [2022-11-21 16:29:25,912 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-21 16:29:25,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:29:25,951 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-21 16:29:25,973 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:29:25,974 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 13 treesize of output 13 [2022-11-21 16:29:26,026 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-21 16:29:26,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-21 16:29:26,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:29:26,382 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-21 16:29:26,492 WARN L859 $PredicateComparison]: unable to prove that (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| (_ bv12 32)))) is different from true [2022-11-21 16:29:26,505 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-21 16:29:26,588 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (= (select |c_#length| |create_sub_list_insert_sub_~sub~0#1.base|) (_ bv12 32))) (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| (_ bv12 32))))) is different from true [2022-11-21 16:29:26,652 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:29:26,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-21 16:29:27,029 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-21 16:29:27,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:29:27,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:29:27,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093277466] [2022-11-21 16:29:27,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093277466] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:29:27,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [773078203] [2022-11-21 16:29:27,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:27,631 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 16:29:27,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 16:29:27,636 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 16:29:27,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-21 16:29:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:29,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-21 16:29:29,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:29:29,621 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-21 16:29:29,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:29:29,715 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-21 16:29:29,828 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-21 16:29:30,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-21 16:29:30,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:29:30,217 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-21 16:29:30,252 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-21 16:29:30,367 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-21 16:29:30,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:29:30,535 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-21 16:29:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 16:29:30,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:29:33,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [773078203] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:29:33,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:29:33,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2022-11-21 16:29:33,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393750182] [2022-11-21 16:29:33,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:29:33,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-21 16:29:33,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:29:33,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-21 16:29:33,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=435, Unknown=4, NotChecked=86, Total=600 [2022-11-21 16:29:33,131 INFO L87 Difference]: Start difference. First operand 176 states and 191 transitions. Second operand has 20 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 16:29:38,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:29:38,656 INFO L93 Difference]: Finished difference Result 228 states and 257 transitions. [2022-11-21 16:29:38,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 16:29:38,657 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-11-21 16:29:38,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:29:38,658 INFO L225 Difference]: With dead ends: 228 [2022-11-21 16:29:38,659 INFO L226 Difference]: Without dead ends: 228 [2022-11-21 16:29:38,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=173, Invalid=815, Unknown=12, NotChecked=122, Total=1122 [2022-11-21 16:29:38,660 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 471 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 123 mSolverCounterUnsat, 72 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 72 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:29:38,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 267 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 802 Invalid, 72 Unknown, 282 Unchecked, 4.5s Time] [2022-11-21 16:29:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-21 16:29:38,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 197. [2022-11-21 16:29:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 145 states have (on average 1.289655172413793) internal successors, (187), 168 states have internal predecessors, (187), 16 states have call successors, (16), 13 states have call predecessors, (16), 13 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2022-11-21 16:29:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 227 transitions. [2022-11-21 16:29:38,669 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 227 transitions. Word has length 51 [2022-11-21 16:29:38,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:29:38,670 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 227 transitions. [2022-11-21 16:29:38,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 16:29:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 227 transitions. [2022-11-21 16:29:38,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 16:29:38,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:29:38,671 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:29:38,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-21 16:29:38,892 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2022-11-21 16:29:39,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt [2022-11-21 16:29:39,085 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting list_add_tailErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:29:39,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:29:39,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1563009014, now seen corresponding path program 1 times [2022-11-21 16:29:39,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:29:39,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486809989] [2022-11-21 16:29:39,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:39,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:29:39,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:29:39,088 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:29:39,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-21 16:29:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:39,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-21 16:29:39,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:29:39,579 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 7 [2022-11-21 16:29:39,640 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 16:29:39,641 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 19 treesize of output 27 [2022-11-21 16:29:39,681 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 5 [2022-11-21 16:29:39,816 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 7 [2022-11-21 16:29:40,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:29:40,028 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 14 treesize of output 20 [2022-11-21 16:29:40,150 WARN L859 $PredicateComparison]: unable to prove that (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base| (_ bv1 1)))) is different from true [2022-11-21 16:29:40,163 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 7 [2022-11-21 16:29:40,339 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 16:29:40,340 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 20 [2022-11-21 16:29:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-21 16:29:40,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:29:40,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:29:40,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486809989] [2022-11-21 16:29:40,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486809989] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:29:40,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1748176878] [2022-11-21 16:29:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:40,940 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 16:29:40,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 16:29:40,941 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 16:29:40,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-11-21 16:29:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:42,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-21 16:29:42,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:29:42,891 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 16:29:42,891 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 20 [2022-11-21 16:29:42,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:29:42,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:29:43,013 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-21 16:29:43,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 36 [2022-11-21 16:29:43,176 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:29:43,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2022-11-21 16:29:43,356 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 7 [2022-11-21 16:29:43,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:29:43,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:29:43,582 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-21 16:29:43,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 45 [2022-11-21 16:29:43,661 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:29:43,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2022-11-21 16:29:43,789 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 7 [2022-11-21 16:29:43,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:29:43,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:29:43,990 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-21 16:29:43,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 45 [2022-11-21 16:29:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 16:29:44,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:29:44,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1748176878] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:29:44,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:29:44,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2022-11-21 16:29:44,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808117409] [2022-11-21 16:29:44,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:29:44,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-21 16:29:44,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:29:44,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-21 16:29:44,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=499, Unknown=12, NotChecked=46, Total=650 [2022-11-21 16:29:44,635 INFO L87 Difference]: Start difference. First operand 197 states and 227 transitions. Second operand has 21 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 16:29:49,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 16:29:50,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:29:50,510 INFO L93 Difference]: Finished difference Result 286 states and 324 transitions. [2022-11-21 16:29:50,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 16:29:50,511 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-11-21 16:29:50,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:29:50,512 INFO L225 Difference]: With dead ends: 286 [2022-11-21 16:29:50,513 INFO L226 Difference]: Without dead ends: 286 [2022-11-21 16:29:50,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 83 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=197, Invalid=848, Unknown=15, NotChecked=62, Total=1122 [2022-11-21 16:29:50,514 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 444 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 126 mSolverCounterUnsat, 158 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 158 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:29:50,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 439 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 813 Invalid, 158 Unknown, 177 Unchecked, 5.1s Time] [2022-11-21 16:29:50,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-21 16:29:50,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 197. [2022-11-21 16:29:50,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 145 states have (on average 1.282758620689655) internal successors, (186), 168 states have internal predecessors, (186), 16 states have call successors, (16), 13 states have call predecessors, (16), 13 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2022-11-21 16:29:50,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 226 transitions. [2022-11-21 16:29:50,524 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 226 transitions. Word has length 51 [2022-11-21 16:29:50,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:29:50,525 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 226 transitions. [2022-11-21 16:29:50,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 16:29:50,525 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 226 transitions. [2022-11-21 16:29:50,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 16:29:50,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:29:50,526 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:29:50,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-21 16:29:50,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-11-21 16:29:50,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt [2022-11-21 16:29:50,944 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting list_add_tailErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:29:50,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:29:50,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1771803766, now seen corresponding path program 2 times [2022-11-21 16:29:50,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:29:50,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863908288] [2022-11-21 16:29:50,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:29:50,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:29:50,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:29:50,946 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:29:50,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-21 16:29:51,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:29:51,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:29:51,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-21 16:29:51,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:29:51,783 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 7 [2022-11-21 16:29:51,867 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-21 16:29:51,877 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-21 16:29:51,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:29:51,931 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-21 16:29:51,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:29:51,941 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-21 16:29:52,027 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:29:52,027 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 13 treesize of output 13 [2022-11-21 16:29:52,157 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 23 [2022-11-21 16:29:52,181 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-21 16:29:53,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:29:53,202 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 0 case distinctions, treesize of input 72 treesize of output 46 [2022-11-21 16:29:53,266 INFO L321 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2022-11-21 16:29:53,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 130 [2022-11-21 16:29:53,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:29:53,275 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 0 case distinctions, treesize of input 134 treesize of output 92 [2022-11-21 16:29:53,291 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 205 treesize of output 121 [2022-11-21 16:29:53,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 20 [2022-11-21 16:29:53,495 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 16:29:53,495 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 19 treesize of output 27 [2022-11-21 16:29:53,732 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 28 treesize of output 26 [2022-11-21 16:29:53,763 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 20 treesize of output 8 [2022-11-21 16:29:55,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:29:55,474 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 0 case distinctions, treesize of input 47 treesize of output 33 [2022-11-21 16:29:55,550 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-21 16:29:55,550 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 57 [2022-11-21 16:29:55,884 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-21 16:29:55,980 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-21 16:29:55,980 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 30 treesize of output 51 [2022-11-21 16:29:56,270 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 42 treesize of output 38 [2022-11-21 16:29:56,962 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 43 treesize of output 23 [2022-11-21 16:29:56,973 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-21 16:29:57,358 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:29:57,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:30:00,633 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 24 treesize of output 22 [2022-11-21 16:30:04,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:30:04,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863908288] [2022-11-21 16:30:04,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863908288] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:30:04,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [737881874] [2022-11-21 16:30:04,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:30:04,984 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 16:30:04,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 16:30:04,985 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 16:30:04,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-11-21 16:30:05,784 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 16:30:05,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105734161] [2022-11-21 16:30:05,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:30:05,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:30:05,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:30:05,791 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:30:05,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 1 [2022-11-21 16:30:05,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-21 16:30:07,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:30:07,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:30:07,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-21 16:30:07,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:30:07,172 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-21 16:30:07,179 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 7 [2022-11-21 16:30:07,786 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-21 16:30:07,798 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-21 16:30:08,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:30:08,035 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-21 16:30:08,060 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 13 treesize of output 9 [2022-11-21 16:30:08,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:30:08,075 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-21 16:30:08,125 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:30:08,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 13 treesize of output 13 [2022-11-21 16:30:08,437 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-21 16:30:08,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 16:30:09,572 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 0 case distinctions, treesize of input 65 treesize of output 36 [2022-11-21 16:30:09,635 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-21 16:30:09,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 117 [2022-11-21 16:30:09,642 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 121 treesize of output 89 [2022-11-21 16:30:09,651 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 42 treesize of output 24 [2022-11-21 16:30:10,226 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 16:30:10,226 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 19 treesize of output 27 [2022-11-21 16:30:10,709 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-21 16:30:10,710 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 102 treesize of output 92 [2022-11-21 16:30:11,062 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 8 treesize of output 4 [2022-11-21 16:30:13,764 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 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-21 16:30:13,818 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-21 16:30:13,818 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 2 case distinctions, treesize of input 39 treesize of output 46 [2022-11-21 16:30:14,269 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-21 16:30:14,269 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 30 treesize of output 51 [2022-11-21 16:30:14,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-21 16:30:15,201 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 35 treesize of output 19 [2022-11-21 16:30:15,501 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:30:15,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:30:16,273 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2384) |c_create_sub_list_insert_sub_~head#1.base|) (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-21 16:30:17,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105734161] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:30:17,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:30:17,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 52 [2022-11-21 16:30:17,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124223492] [2022-11-21 16:30:17,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:30:17,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-21 16:30:17,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:30:17,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-21 16:30:17,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3970, Unknown=111, NotChecked=128, Total=4422 [2022-11-21 16:30:17,900 INFO L87 Difference]: Start difference. First operand 197 states and 226 transitions. Second operand has 53 states, 50 states have (on average 1.56) internal successors, (78), 47 states have internal predecessors, (78), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-21 16:30:43,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:30:43,577 INFO L93 Difference]: Finished difference Result 198 states and 225 transitions. [2022-11-21 16:30:43,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-21 16:30:43,578 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 1.56) internal successors, (78), 47 states have internal predecessors, (78), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 51 [2022-11-21 16:30:43,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:30:43,579 INFO L225 Difference]: With dead ends: 198 [2022-11-21 16:30:43,579 INFO L226 Difference]: Without dead ends: 198 [2022-11-21 16:30:43,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2125 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=530, Invalid=7667, Unknown=179, NotChecked=180, Total=8556 [2022-11-21 16:30:43,584 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 128 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 3184 mSolverCounterSat, 49 mSolverCounterUnsat, 90 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 3323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3184 IncrementalHoareTripleChecker+Invalid, 90 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:30:43,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1251 Invalid, 3323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3184 Invalid, 90 Unknown, 0 Unchecked, 17.5s Time] [2022-11-21 16:30:43,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-21 16:30:43,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2022-11-21 16:30:43,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 145 states have (on average 1.2758620689655173) internal successors, (185), 168 states have internal predecessors, (185), 16 states have call successors, (16), 13 states have call predecessors, (16), 13 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2022-11-21 16:30:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 225 transitions. [2022-11-21 16:30:43,592 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 225 transitions. Word has length 51 [2022-11-21 16:30:43,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:30:43,593 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 225 transitions. [2022-11-21 16:30:43,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 1.56) internal successors, (78), 47 states have internal predecessors, (78), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-21 16:30:43,593 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 225 transitions. [2022-11-21 16:30:43,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 16:30:43,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:30:43,594 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:30:43,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-11-21 16:30:43,825 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-21 16:30:44,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:30:44,007 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:30:44,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:30:44,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1771803765, now seen corresponding path program 2 times [2022-11-21 16:30:44,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:30:44,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438661518] [2022-11-21 16:30:44,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:30:44,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:30:44,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:30:44,009 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:30:44,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-11-21 16:30:44,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:30:44,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:30:44,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-21 16:30:44,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:30:44,875 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 7 [2022-11-21 16:30:44,956 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-21 16:30:45,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:30:45,005 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-21 16:30:45,042 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:30:45,042 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 13 treesize of output 13 [2022-11-21 16:30:45,140 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-21 16:30:45,468 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-21 16:30:45,610 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:30:45,611 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 16 treesize of output 22 [2022-11-21 16:30:45,631 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-21 16:30:45,764 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:30:45,764 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 20 treesize of output 26 [2022-11-21 16:30:48,567 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-21 16:30:48,568 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 31 treesize of output 46 [2022-11-21 16:30:48,788 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 3 [2022-11-21 16:30:48,964 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 16:30:48,964 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 19 treesize of output 27 [2022-11-21 16:30:48,998 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-21 16:30:49,190 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 17 treesize of output 19 [2022-11-21 16:30:49,249 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 8 treesize of output 4 [2022-11-21 16:30:50,052 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-21 16:30:50,303 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:30:50,303 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 16 treesize of output 22 [2022-11-21 16:30:50,316 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-21 16:30:50,577 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:30:50,578 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 20 treesize of output 26 [2022-11-21 16:30:50,904 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-21 16:30:50,904 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 26 treesize of output 38 [2022-11-21 16:30:50,926 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-21 16:30:51,335 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 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-21 16:30:51,395 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-21 16:30:51,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 2 case distinctions, treesize of input 50 treesize of output 55 [2022-11-21 16:30:51,755 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-21 16:30:51,755 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 18 [2022-11-21 16:30:51,806 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-21 16:30:51,806 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 24 treesize of output 26 [2022-11-21 16:30:52,066 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-21 16:30:52,077 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-21 16:30:52,769 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 33 treesize of output 17 [2022-11-21 16:30:52,799 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-21 16:30:53,292 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-21 16:30:53,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:30:57,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:30:57,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 75 [2022-11-21 16:30:57,461 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:30:57,462 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 1830 treesize of output 1811 [2022-11-21 16:30:57,485 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 1794 treesize of output 1762 [2022-11-21 16:30:57,525 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 889 treesize of output 873 [2022-11-21 16:30:57,552 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 1746 treesize of output 1682 [2022-11-21 16:31:09,211 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 14 treesize of output 10 [2022-11-21 16:31:09,405 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 43 treesize of output 31 [2022-11-21 16:31:09,566 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 29 treesize of output 21 [2022-11-21 16:31:09,766 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 43 treesize of output 31 [2022-11-21 16:31:09,884 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 29 treesize of output 21 [2022-11-21 16:31:11,121 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 29 treesize of output 21 [2022-11-21 16:31:11,487 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 43 treesize of output 31 [2022-11-21 16:31:11,769 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 43 treesize of output 31 [2022-11-21 16:31:11,821 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 43 treesize of output 31 [2022-11-21 16:31:11,870 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 57 treesize of output 41 [2022-11-21 16:31:11,931 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 57 treesize of output 41 [2022-11-21 16:31:12,236 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 43 treesize of output 31 [2022-11-21 16:31:12,296 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 29 treesize of output 21 [2022-11-21 16:31:12,423 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 29 treesize of output 21 [2022-11-21 16:31:12,481 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 43 treesize of output 31 [2022-11-21 16:31:12,526 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 29 treesize of output 21 [2022-11-21 16:31:12,563 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 29 treesize of output 21 [2022-11-21 16:31:12,622 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 29 treesize of output 21 [2022-11-21 16:31:12,653 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 43 treesize of output 31 [2022-11-21 16:31:12,697 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 14 treesize of output 10 [2022-11-21 16:31:12,716 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 29 treesize of output 21 [2022-11-21 16:31:12,753 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 43 treesize of output 31 [2022-11-21 16:31:12,812 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 43 treesize of output 31 [2022-11-21 16:31:12,880 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 14 treesize of output 10 [2022-11-21 16:31:12,908 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 29 treesize of output 21 [2022-11-21 16:31:12,946 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 43 treesize of output 31 [2022-11-21 16:31:12,999 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 57 treesize of output 41 [2022-11-21 16:31:13,060 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 29 treesize of output 21 [2022-11-21 16:31:13,090 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 57 treesize of output 41 [2022-11-21 16:31:13,151 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 29 treesize of output 21 [2022-11-21 16:31:13,181 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 43 treesize of output 31 [2022-11-21 16:31:13,227 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 14 treesize of output 10 [2022-11-21 16:31:13,247 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 43 treesize of output 31 [2022-11-21 16:31:13,419 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 29 treesize of output 21 [2022-11-21 16:31:24,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:31:24,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 60 [2022-11-21 16:31:24,449 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:31:24,449 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 1722 treesize of output 1631 [2022-11-21 16:31:24,475 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 1614 treesize of output 1550 [2022-11-21 16:31:24,493 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 1550 treesize of output 1422 [2022-11-21 16:31:24,513 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 1422 treesize of output 1166 [2022-11-21 16:31:31,838 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse182 (select |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~head#1.base|)) (.cse183 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (let ((.cse5 (select .cse182 .cse183))) (let ((.cse13 (= |c_create_sub_list_insert_sub_~sub~0#1.base| |c_create_sub_list_~sub#1.base|)) (.cse0 (bvadd (_ bv8 32) |c_create_sub_list_~sub#1.offset|)) (.cse4 (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~head#1.base| (store .cse182 .cse183 |c_create_sub_list_insert_sub_~sub~0#1.base|))) (.cse6 (bvadd (_ bv4 32) |c_create_sub_list_~sub#1.offset|)) (.cse74 (= .cse5 |c_create_sub_list_~sub#1.base|))) (let ((.cse32 (not .cse74)) (.cse167 (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse181 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse181 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) (select .cse181 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6))))))) (.cse22 (not .cse13)) (.cse9 (store |c_#length| |c_create_sub_list_~sub#1.base| (_ bv12 32))) (.cse7 (not (bvule .cse0 (_ bv12 32)))) (.cse20 (not (= (select |c_#valid| |c_create_sub_list_~sub#1.base|) (_ bv0 1))))) (let ((.cse55 (or .cse7 .cse20)) (.cse21 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)) |c_create_sub_list_~sub#1.base|)))))) (.cse40 (or .cse7 (forall ((v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32)) (v_arrayElimCell_287 (_ BitVec 32))) (let ((.cse180 (select .cse9 v_arrayElimCell_287))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse180) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse180)))) .cse20)) (.cse43 (or .cse32 (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse174 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse173 (select .cse174 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (forall ((v_arrayElimCell_273 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse173)) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse173)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse174 |c_create_sub_list_~sub#1.base|)))))) (or .cse13 .cse167) (or (forall ((v_arrayElimCell_307 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse175 (select .cse9 v_arrayElimCell_307))) (or (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse175) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse175)))) .cse7 .cse20) (or .cse22 (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse177 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse176 (select .cse177 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse176) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse177 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse176)))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse178 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse178 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse179 (select .cse178 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse179) (forall ((v_arrayElimCell_271 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse179))))))))))) (.cse59 (or (forall ((v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_282 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse172 (select .cse9 v_arrayElimCell_282))) (or (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse172) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse172) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse172)))) .cse22)) (.cse37 (or .cse22 (forall ((v_arrayElimCell_289 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse171 (select .cse9 v_arrayElimCell_289))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse171) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse171)))))) (.cse56 (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse170 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse169 (select .cse170 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse169) (not (bvule .cse0 (select .cse170 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse169))))) .cse22)) (.cse47 (or (forall ((v_arrayElimCell_291 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse168 (select .cse9 v_arrayElimCell_291))) (or (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse168) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse168)))) .cse22)) (.cse48 (forall ((v_arrayElimCell_293 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) (select .cse9 v_arrayElimCell_293)))) (.cse57 (or .cse32 .cse167)) (.cse75 (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse166 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse165 (select .cse166 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse165) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse165) (not (bvule .cse0 (select .cse166 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse165))))) .cse22)) (.cse76 (or (and (or (forall ((v_arrayElimCell_279 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse162 (select .cse9 v_arrayElimCell_279))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse162) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse162)))) .cse7 .cse20) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse163 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse163 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse164 (select .cse163 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse164)) (forall ((v_arrayElimCell_273 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse164)) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse164)))))))) .cse22)) (.cse79 (or .cse22 (and (or .cse7 .cse20 (forall ((v_arrayElimCell_280 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse157 (select .cse9 v_arrayElimCell_280))) (or (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse157) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse157) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse157))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse158 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse158 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse159 (select .cse158 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse159) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse159) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse159))))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse161 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_272 (_ BitVec 32))) (let ((.cse160 (select .cse161 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse160) (forall ((v_arrayElimCell_273 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse160)) (forall ((v_arrayElimCell_271 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse160))))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse161 |c_create_sub_list_~sub#1.base|))))))))) (.cse14 (or .cse32 (and (or .cse13 (forall ((v_arrayElimCell_273 (_ BitVec 32)) (v_arrayElimCell_297 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) (select .cse9 v_arrayElimCell_297)))) (forall ((v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32)) (v_arrayElimCell_298 (_ BitVec 32))) (let ((.cse156 (select .cse9 v_arrayElimCell_298))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse156) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse156))))))) (.cse10 (forall ((v_arrayElimCell_305 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) (select .cse9 v_arrayElimCell_305)))) (.cse16 (or (forall ((v_arrayElimCell_299 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse155 (select .cse9 v_arrayElimCell_299))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse155) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse155) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse155)))) .cse22)) (.cse18 (forall ((v_arrayElimCell_301 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse154 (select .cse9 v_arrayElimCell_301))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse154) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse154))))) (.cse29 (or (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse149 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse149 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse150 (select .cse149 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse150) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse150))))))) (or .cse7 .cse20 (forall ((v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32)) (v_arrayElimCell_276 (_ BitVec 32))) (let ((.cse151 (select .cse9 v_arrayElimCell_276))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse151) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse151))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse152 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse152 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse153 (select .cse152 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (forall ((v_arrayElimCell_273 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse153)) (forall ((v_arrayElimCell_271 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse153))))))))) .cse22)) (.cse86 (or .cse22 (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse148 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse147 (select .cse148 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse147) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse147) (not (bvule .cse0 (select .cse148 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse147))))))) (.cse66 (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32))) (let ((.cse146 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) (select .cse146 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6))) (not (bvule .cse0 (select .cse146 |c_create_sub_list_~sub#1.base|)))))) .cse22)) (.cse67 (or .cse7 (forall ((v_arrayElimCell_274 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) (select .cse9 v_arrayElimCell_274))) .cse20)) (.cse70 (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse145 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse144 (select .cse145 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse144) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse144) (not (bvule .cse0 (select .cse145 |c_create_sub_list_~sub#1.base|))))))) .cse22)) (.cse3 (bvadd (_ bv8 32) |c_create_sub_list_insert_sub_~sub~0#1.offset|))) (let ((.cse25 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse142 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse142 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse143 (select .cse142 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse143) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse143) (bvule .cse3 .cse143)))))))) (.cse26 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse140 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse140 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse141 (select .cse140 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (forall ((v_arrayElimCell_273 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse141)) (forall ((v_arrayElimCell_271 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse141)) (bvule .cse3 .cse141)))))))) (.cse38 (let ((.cse115 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse139 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse138 (select .cse139 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse138) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse138) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse138)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse139 |c_create_sub_list_~sub#1.base|))))))) (.cse118 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse137 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse136 (select .cse137 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (forall ((v_arrayElimCell_273 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse136)) (forall ((v_arrayElimCell_271 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse136)) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse136)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse137 |c_create_sub_list_~sub#1.base|)))))))) (and (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse87 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse87 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse88 (select .cse87 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse88) (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse88)) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse88) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse88))))))) .cse40 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse90 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse89 (select .cse90 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse89) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse89) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse89) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse89)))) (not (bvule .cse0 (select .cse90 |c_create_sub_list_~sub#1.base|)))))) .cse43 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse92 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse91 (select .cse92 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse91) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse91) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse91) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse91)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse92 |c_create_sub_list_~sub#1.base|)))))) (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse93 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse94 (select .cse93 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse93 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse94) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse94))))) .cse13) (or .cse13 (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse96 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse95 (select .cse96 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse95) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse96 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse95) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse95)))))) (or .cse7 (and (or .cse13 (forall ((v_arrayElimCell_281 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse97 (select .cse9 v_arrayElimCell_281))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse97) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse97) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse97))))) (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_284 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse98 (select .cse9 v_arrayElimCell_284))) (or (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse98) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse98) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse98) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse98)))) (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_283 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse99 (select .cse9 v_arrayElimCell_283))) (or (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse99) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse99) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse99) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse99)))) .cse59) .cse20) (or .cse7 (and (or .cse13 (forall ((v_arrayElimCell_290 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse100 (select .cse9 v_arrayElimCell_290))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse100) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse100))))) .cse37 (forall ((v_arrayElimCell_288 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse101 (select .cse9 v_arrayElimCell_288))) (or (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse101) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse101) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse101))))) .cse20) .cse56 (or .cse7 (and .cse47 .cse48 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_292 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse102 (select .cse9 v_arrayElimCell_292))) (or (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse102) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse102) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse102)))) (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_295 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse103 (select .cse9 v_arrayElimCell_295))) (or (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse103) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse103) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse103)))) (or .cse13 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_294 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse104 (select .cse9 v_arrayElimCell_294))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse104) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse104)))))) .cse20) .cse57 .cse75 .cse76 (or .cse13 (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse106 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse105 (select .cse106 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse105) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse106 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse105) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse105)))))) .cse79 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse107 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse107 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse108 (select .cse107 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse108)) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse108) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse108))))))) (or .cse7 .cse20 (and (forall ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse109 (select .cse9 v_arrayElimCell_300))) (or (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse109) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse109) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse109) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse109)))) (or (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_296 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse110 (select .cse9 v_arrayElimCell_296))) (or (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse110) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse110) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse110)))) .cse13) .cse14 (or .cse13 (and (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse111 (select .cse9 v_arrayElimCell_306))) (or (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse111) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse111) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse111)))) .cse10 (forall ((v_arrayElimCell_303 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse112 (select .cse9 v_arrayElimCell_303))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse112) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse112)))) (forall ((v_arrayElimCell_304 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse113 (select .cse9 v_arrayElimCell_304))) (or (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse113) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse113) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse113)))))) (forall ((v_arrayElimCell_302 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse114 (select .cse9 v_arrayElimCell_302))) (or (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse114) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse114) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse114) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse114)))) .cse16 .cse18)) (or .cse13 (and .cse115 (or .cse7 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32)) (v_arrayElimCell_286 (_ BitVec 32))) (let ((.cse116 (select .cse9 v_arrayElimCell_286))) (or (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse116) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse116)))) .cse20) (or .cse7 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_285 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse117 (select .cse9 v_arrayElimCell_285))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse117) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse117) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse117)))) .cse20) .cse118)) (or (let ((.cse120 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse123 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse123 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse124 (select .cse123 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse124) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse124))))))))) (and (or .cse7 .cse20 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32)) (v_arrayElimCell_275 (_ BitVec 32))) (let ((.cse119 (select .cse9 v_arrayElimCell_275))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse119) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse119) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse119))))) .cse115 (or .cse13 (and .cse120 (or .cse7 .cse20 (forall ((v_arrayElimCell_278 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse121 (select .cse9 v_arrayElimCell_278))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse121) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse121))))) .cse115 (or (forall ((v_arrayElimCell_277 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse122 (select .cse9 v_arrayElimCell_277))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse122) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse122) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse122)))) .cse7 .cse20) .cse118)) (or (and .cse120 .cse115 .cse118) .cse13) .cse29 .cse118)) .cse32) (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse125 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse125 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse126 (select .cse125 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse126) (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse126)) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse126) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse126))))))) .cse86 (or (and (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse128 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse127 (select .cse128 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse127) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse128 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse127))))) .cse13) (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse130 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse129 (select .cse130 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse129) (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse129)) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse129)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse130 |c_create_sub_list_~sub#1.base|)))))) (or .cse13 (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse131 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse131 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) (select .cse131 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6))))))) .cse66 .cse67 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse133 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse132 (select .cse133 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse132)) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse132)))) (not (bvule .cse0 (select .cse133 |c_create_sub_list_~sub#1.base|)))))) .cse70 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse135 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse134 (select .cse135 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse134) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse134) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse134)))) (not (bvule .cse0 (select .cse135 |c_create_sub_list_~sub#1.base|))))))) .cse74)))) (.cse41 (= |c_create_sub_list_insert_sub_~head#1.offset| |c_create_sub_list_~sub#1.offset|)) (.cse42 (and .cse55 .cse21)) (.cse39 (= |c_create_sub_list_insert_sub_~head#1.base| |c_create_sub_list_~sub#1.base|))) (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse1 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse1 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse2 (select .cse1 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse2)) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse2) (bvule .cse3 .cse2))))))) (or .cse7 (and (or (and (forall ((v_arrayElimCell_304 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse8 (select .cse9 v_arrayElimCell_304))) (or (bvule .cse3 .cse8) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse8) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse8)))) .cse10 (forall ((v_arrayElimCell_303 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse11 (select .cse9 v_arrayElimCell_303))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse11) (bvule .cse3 .cse11)))) (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse12 (select .cse9 v_arrayElimCell_306))) (or (bvule .cse3 .cse12) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse12) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse12))))) .cse13) .cse14 (forall ((v_arrayElimCell_302 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse15 (select .cse9 v_arrayElimCell_302))) (or (bvule .cse3 .cse15) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse15) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse15) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse15)))) .cse16 (or .cse13 (forall ((v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_296 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse17 (select .cse9 v_arrayElimCell_296))) (or (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse17) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse17) (bvule .cse3 .cse17))))) .cse18 (forall ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse19 (select .cse9 v_arrayElimCell_300))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse19) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse19) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse19) (bvule .cse3 .cse19))))) .cse20) (or .cse21 .cse22) (or (let ((.cse24 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse31 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse30 (select .cse31 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse30) (bvule .cse3 .cse30)))) (not (bvule .cse0 (select .cse31 |c_create_sub_list_~sub#1.base|)))))))) (and (or .cse13 (and (or .cse7 .cse20 (forall ((v_arrayElimCell_278 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse23 (select .cse9 v_arrayElimCell_278))) (or (bvule .cse3 .cse23) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse23))))) .cse24 .cse25 .cse26 (or .cse7 (forall ((v_arrayElimCell_277 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse27 (select .cse9 v_arrayElimCell_277))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse27) (bvule .cse3 .cse27) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse27)))) .cse20))) (or (forall ((v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32)) (v_arrayElimCell_275 (_ BitVec 32))) (let ((.cse28 (select .cse9 v_arrayElimCell_275))) (or (bvule .cse3 .cse28) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse28) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse28)))) .cse7 .cse20) .cse25 (or .cse13 (and .cse24 .cse25 .cse26)) .cse26 .cse29)) .cse32) (or .cse13 (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse33 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse34 (select .cse33 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse33 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse34) (bvule .cse3 .cse34)))))) (or .cse7 .cse20 (and (or (forall ((v_arrayElimCell_290 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse35 (select .cse9 v_arrayElimCell_290))) (or (bvule .cse3 .cse35) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse35)))) .cse13) (forall ((v_arrayElimCell_288 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse36 (select .cse9 v_arrayElimCell_288))) (or (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse36) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse36) (bvule .cse3 .cse36)))) .cse37)) (or .cse38 .cse39) .cse40 (or .cse41 .cse42) .cse43 (or .cse13 (and (or .cse7 (forall ((v_arrayElimCell_273 (_ BitVec 32)) (v_arrayElimCell_286 (_ BitVec 32))) (let ((.cse44 (select .cse9 v_arrayElimCell_286))) (or (bvule .cse3 .cse44) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse44)))) .cse20) (or .cse7 .cse20 (forall ((v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_285 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse45 (select .cse9 v_arrayElimCell_285))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse45) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse45) (bvule .cse3 .cse45))))) .cse25 .cse26)) (or (and (forall ((v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_295 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse46 (select .cse9 v_arrayElimCell_295))) (or (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse46) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse46) (bvule .cse3 .cse46)))) .cse47 .cse48 (or .cse13 (forall ((v_arrayElimCell_294 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse49 (select .cse9 v_arrayElimCell_294))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse49) (bvule .cse3 .cse49))))) (forall ((v_arrayElimCell_292 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse50 (select .cse9 v_arrayElimCell_292))) (or (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse50) (bvule .cse3 .cse50) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse50))))) .cse7 .cse20) (or .cse38 .cse41) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse51 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse51 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse52 (select .cse51 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse52) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse52) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse52) (bvule .cse3 .cse52))))))) (or .cse13 (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse54 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse53 (select .cse54 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse53) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse54 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse53) (bvule .cse3 .cse53)))))) .cse55 .cse56 .cse57 (or .cse7 (and (forall ((v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_284 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse58 (select .cse9 v_arrayElimCell_284))) (or (bvule .cse3 .cse58) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse58) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse58) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse58)))) .cse59 (or (forall ((v_arrayElimCell_281 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse60 (select .cse9 v_arrayElimCell_281))) (or (bvule .cse3 .cse60) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse60) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse60)))) .cse13) (forall ((v_arrayElimCell_283 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse61 (select .cse9 v_arrayElimCell_283))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse61) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse61) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse61) (bvule .cse3 .cse61))))) .cse20) (or (and (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse63 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse62 (select .cse63 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse62) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse63 |c_create_sub_list_~sub#1.base|))) (bvule .cse3 .cse62))))) .cse13) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse65 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse64 (select .cse65 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse64) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse64) (bvule .cse3 .cse64)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse65 |c_create_sub_list_~sub#1.base|)))))) .cse66 .cse67 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse68 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse68 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (select .cse68 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse69)) (bvule .cse3 .cse69))))))) .cse70 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse72 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse71 (select .cse72 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse71) (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse71)) (bvule .cse3 .cse71)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse72 |c_create_sub_list_~sub#1.base|)))))) (or .cse13 (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse73 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse73 |c_create_sub_list_~sub#1.base|))) (bvule .cse3 (select .cse73 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))))))) .cse74) .cse75 .cse76 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse77 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse77 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse78 (select .cse77 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse78) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse78) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse78) (bvule .cse3 .cse78))))))) .cse79 (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse81 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse80 (select .cse81 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse80) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse81 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse80) (bvule .cse3 .cse80))))) .cse13) (or .cse21 (bvule (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~sub~0#1.offset|) .cse3)) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse82 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse82 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse83 (select .cse82 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse83) (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse83)) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse83) (bvule .cse3 .cse83))))))) (or .cse32 .cse21) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse84 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse84 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse85 (select .cse84 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse85) (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse85)) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse85) (bvule .cse3 .cse85))))))) .cse86 (or .cse42 .cse39)))))))) is different from true [2022-11-21 16:31:31,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:31:31,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438661518] [2022-11-21 16:31:31,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438661518] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:31:31,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [535811130] [2022-11-21 16:31:31,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:31:31,882 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 16:31:31,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 16:31:31,884 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 16:31:31,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-11-21 16:31:35,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:31:35,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:31:35,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 137 conjunts are in the unsatisfiable core [2022-11-21 16:31:35,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:31:35,443 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 7 [2022-11-21 16:31:35,496 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-21 16:31:35,519 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-21 16:31:35,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:31:35,815 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-21 16:31:35,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:31:35,836 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-21 16:31:35,916 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:31:35,917 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 13 treesize of output 13 [2022-11-21 16:31:36,288 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-21 16:31:36,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 16 treesize of output 18 [2022-11-21 16:31:39,614 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 0 case distinctions, treesize of input 78 treesize of output 43 [2022-11-21 16:31:39,690 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-21 16:31:39,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 117 [2022-11-21 16:31:39,700 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 121 treesize of output 89 [2022-11-21 16:31:39,710 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 42 treesize of output 24 [2022-11-21 16:31:40,242 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-21 16:31:40,334 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 16:31:40,334 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 19 treesize of output 27 [2022-11-21 16:31:40,998 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-21 16:31:40,998 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 102 treesize of output 92 [2022-11-21 16:31:41,091 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 8 treesize of output 4 [2022-11-21 16:31:41,535 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-21 16:31:41,649 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:31:41,650 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 16 treesize of output 22 [2022-11-21 16:31:41,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:31:41,988 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:31:41,989 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 20 treesize of output 26 [2022-11-21 16:31:42,275 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-21 16:31:42,276 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 26 treesize of output 38 [2022-11-21 16:31:42,286 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-21 16:31:42,671 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 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-21 16:31:42,752 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-21 16:31:42,752 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 2 case distinctions, treesize of input 50 treesize of output 55 [2022-11-21 16:31:42,982 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-21 16:31:42,982 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 24 treesize of output 26 [2022-11-21 16:31:43,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 16:31:43,482 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-21 16:31:43,513 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-21 16:31:44,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:31:44,358 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-21 16:31:44,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:31:44,373 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2022-11-21 16:31:45,481 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 35 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:31:45,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:31:50,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:31:50,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 75 [2022-11-21 16:31:50,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:31:50,508 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 922 treesize of output 915 [2022-11-21 16:31:50,529 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 898 treesize of output 890 [2022-11-21 16:31:50,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 890 treesize of output 858 [2022-11-21 16:31:50,563 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 858 treesize of output 842 [2022-11-21 16:31:59,583 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 29 treesize of output 21 [2022-11-21 16:31:59,819 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 14 treesize of output 10 [2022-11-21 16:31:59,982 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 14 treesize of output 10 [2022-11-21 16:32:00,254 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 14 treesize of output 10 [2022-11-21 16:32:00,342 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 29 treesize of output 21 [2022-11-21 16:32:00,406 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 14 treesize of output 10 [2022-11-21 16:32:00,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-11-21 16:32:00,463 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 14 treesize of output 10 [2022-11-21 16:32:00,599 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 14 treesize of output 10 [2022-11-21 16:32:00,829 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 14 treesize of output 10 [2022-11-21 16:32:01,105 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 43 treesize of output 31 [2022-11-21 16:32:01,302 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 14 treesize of output 10 [2022-11-21 16:32:01,334 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 29 treesize of output 21 [2022-11-21 16:32:01,493 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 14 treesize of output 10 [2022-11-21 16:32:01,671 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 14 treesize of output 10 [2022-11-21 16:32:01,884 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 14 treesize of output 10 [2022-11-21 16:32:02,136 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 14 treesize of output 10 [2022-11-21 16:32:02,183 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 43 treesize of output 31 [2022-11-21 16:32:02,604 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 14 treesize of output 10 [2022-11-21 16:32:02,642 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 29 treesize of output 21 [2022-11-21 16:32:02,854 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 43 treesize of output 31 [2022-11-21 16:32:03,271 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 29 treesize of output 21 [2022-11-21 16:32:03,464 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 29 treesize of output 21 [2022-11-21 16:32:03,494 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 14 treesize of output 10 [2022-11-21 16:32:03,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 29 treesize of output 21 [2022-11-21 16:32:04,024 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 14 treesize of output 10 [2022-11-21 16:32:04,055 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 29 treesize of output 21 [2022-11-21 16:32:04,217 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 14 treesize of output 10 [2022-11-21 16:32:04,380 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 14 treesize of output 10 [2022-11-21 16:32:04,600 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 14 treesize of output 10 [2022-11-21 16:32:04,831 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 14 treesize of output 10 [2022-11-21 16:32:04,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2022-11-21 16:32:05,307 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 14 treesize of output 10 [2022-11-21 16:32:05,343 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 29 treesize of output 21 [2022-11-21 16:32:05,549 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 43 treesize of output 31 [2022-11-21 16:32:05,966 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 29 treesize of output 21 [2022-11-21 16:32:06,160 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 29 treesize of output 21 [2022-11-21 16:32:06,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 14 treesize of output 10 [2022-11-21 16:32:06,240 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 29 treesize of output 21 [2022-11-21 16:32:06,865 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 43 treesize of output 31 [2022-11-21 16:32:07,085 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 29 treesize of output 21 [2022-11-21 16:32:07,256 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 29 treesize of output 21 [2022-11-21 16:32:07,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:32:07,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 60 [2022-11-21 16:32:07,696 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:32:07,697 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 414 treesize of output 395 [2022-11-21 16:32:07,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 189 treesize of output 173 [2022-11-21 16:32:07,743 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 362 treesize of output 298 [2022-11-21 16:32:07,759 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 298 treesize of output 266 [2022-11-21 16:32:10,688 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse114 (select |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~head#1.base|)) (.cse115 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (let ((.cse19 (= |c_create_sub_list_insert_sub_~sub~0#1.base| |c_create_sub_list_~sub#1.base|)) (.cse8 (select .cse114 .cse115))) (let ((.cse20 (= .cse8 |c_create_sub_list_~sub#1.base|)) (.cse14 (not .cse19)) (.cse7 (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~head#1.base| (store .cse114 .cse115 |c_create_sub_list_insert_sub_~sub~0#1.base|))) (.cse9 (bvadd (_ bv4 32) |c_create_sub_list_~sub#1.offset|)) (.cse10 (bvadd (_ bv8 32) |c_create_sub_list_~sub#1.offset|))) (let ((.cse26 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse113 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse112 (select .cse113 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse112) (forall ((v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse112))))) (not (bvule .cse10 (select .cse113 |c_create_sub_list_~sub#1.base|))))))) (.cse28 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse111 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) (select .cse111 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse111 |c_create_sub_list_~sub#1.base|))))))) (.cse69 (or (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse110 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) (select .cse110 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse110 |c_create_sub_list_~sub#1.base|)))))) .cse14)) (.cse44 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse109 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse108 (select .cse109 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse108) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse108)))) (not (bvule .cse10 (select .cse109 |c_create_sub_list_~sub#1.base|))))))) (.cse25 (not .cse20)) (.cse3 (bvadd (_ bv8 32) |c_create_sub_list_insert_sub_~sub~0#1.offset|))) (let ((.cse17 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse107 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse106 (select .cse107 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (forall ((v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse106)) (bvule .cse3 .cse106)))) (not (bvule .cse10 (select .cse107 |c_create_sub_list_~sub#1.base|))))))) (.cse18 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse105 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule .cse3 (select .cse105 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse105 |c_create_sub_list_~sub#1.base|))))))) (.cse36 (= |c_create_sub_list_insert_sub_~head#1.offset| |c_create_sub_list_~sub#1.offset|)) (.cse32 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (not (bvule .cse10 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)) |c_create_sub_list_~sub#1.base|)))))) (.cse37 (or (and .cse69 .cse44) .cse25)) (.cse35 (or (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse102 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse101 (select .cse102 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse101) (forall ((v_arrayElimCell_345 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse101)) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse101)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (not (bvule .cse10 (select .cse102 |c_create_sub_list_~sub#1.base|)))))) (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse104 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (let ((.cse103 (select .cse104 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse103) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse103) (not (bvule .cse10 (select .cse104 |c_create_sub_list_~sub#1.base|))))))) .cse25)) .cse14)) (.cse42 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse100 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse99 (select .cse100 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse99) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse99) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse99)))) (not (bvule .cse10 (select .cse100 |c_create_sub_list_~sub#1.base|))))))) (.cse40 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse98 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse97 (select .cse98 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse97) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse97) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse97)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse98 |c_create_sub_list_~sub#1.base|))))))) (.cse38 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse96 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse95 (select .cse96 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse95) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse95) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse95) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse95)))) (not (bvule .cse10 (select .cse96 |c_create_sub_list_~sub#1.base|))))))) (.cse27 (or .cse19 (and .cse26 .cse28))) (.cse29 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse93 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (not (bvule .cse10 (select .cse93 |c_create_sub_list_~sub#1.base|))) (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse94 (select .cse93 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (forall ((v_arrayElimCell_347 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse94)) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse94)))))))) (.cse50 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse92 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse91 (select .cse92 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse91) (forall ((v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse91)) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse91)))) (not (bvule .cse10 (select .cse92 |c_create_sub_list_~sub#1.base|))))))) (.cse11 (or (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse90 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse90 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) (select .cse90 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))))) .cse14)) (.cse12 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse89 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) (select .cse89 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse89 |c_create_sub_list_~sub#1.base|))))))) (.cse13 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse88 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse87 (select .cse88 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (forall ((v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse87)) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse87)))) (not (bvule .cse10 (select .cse88 |c_create_sub_list_~sub#1.base|))))))) (.cse48 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse86 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse86 |c_create_sub_list_~sub#1.base|))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) (select .cse86 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))))))) (.cse49 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse85 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (select .cse85 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (forall ((v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse84)) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse84)))) (not (bvule .cse10 (select .cse85 |c_create_sub_list_~sub#1.base|))))))) (.cse53 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse83 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (select .cse83 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (forall ((v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse82)) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse82) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse82)))) (not (bvule .cse10 (select .cse83 |c_create_sub_list_~sub#1.base|))))))) (.cse54 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse81 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (select .cse81 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse80) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse80)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse81 |c_create_sub_list_~sub#1.base|))))))) (.cse33 (= |c_create_sub_list_insert_sub_~head#1.base| |c_create_sub_list_~sub#1.base|)) (.cse30 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse79 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (select .cse79 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse78) (bvule .cse3 .cse78) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse78)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (not (bvule .cse10 (select .cse79 |c_create_sub_list_~sub#1.base|))))))) (.cse0 (not (bvule .cse10 (_ bv12 32)))) (.cse1 (not (= (select |c_#valid| |c_create_sub_list_~sub#1.base|) (_ bv0 1)))) (.cse4 (store |c_#length| |c_create_sub_list_~sub#1.base| (_ bv12 32))) (.cse56 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse76 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (not (bvule .cse10 (select .cse76 |c_create_sub_list_~sub#1.base|))) (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (select .cse76 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse77) (bvule .cse3 .cse77) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse77) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse77)))))))) (.cse41 (or (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (let ((.cse74 (select .cse75 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse74) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse75 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse74))))) .cse14)) (.cse45 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse73 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (let ((.cse72 (select .cse73 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse72) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse72) (not (bvule .cse10 (select .cse73 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse72))))) .cse14)) (.cse22 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse71 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (select .cse71 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse70) (bvule .cse3 .cse70)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse71 |c_create_sub_list_~sub#1.base|)))))))) (and (or (and (or .cse0 .cse1 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_352 (_ BitVec 32))) (let ((.cse2 (select .cse4 v_arrayElimCell_352))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse2) (bvule .cse3 .cse2))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse6 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select .cse6 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule .cse3 .cse5) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse5)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse6 |c_create_sub_list_~sub#1.base|)))))) .cse11 (or .cse0 .cse1 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_353 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_353)))) (or (and .cse12 .cse13 (or .cse0 .cse1 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_351 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_351))))) .cse14) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse16 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select .cse16 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (forall ((v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse15)) (bvule .cse3 .cse15) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse15)))) (not (bvule .cse10 (select .cse16 |c_create_sub_list_~sub#1.base|)))))) (or (and .cse17 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_350 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_350))) .cse0 .cse1) .cse18) .cse19)) .cse20) (or (and (or (and .cse17 (or .cse0 .cse1 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_349 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_349)))) .cse18) .cse20) (or .cse0 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_348 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse21 (select .cse4 v_arrayElimCell_348))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse21) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse21)))) .cse1) .cse22 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse24 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select .cse24 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse23) (forall ((v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse23)) (bvule .cse3 .cse23)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (not (bvule .cse10 (select .cse24 |c_create_sub_list_~sub#1.base|))))))) .cse19) (or .cse25 (and (or .cse0 (forall ((v_arrayElimCell_357 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_357))) .cse1) .cse26 .cse27 .cse28 (or (and .cse29 .cse28 (or .cse0 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_356 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_356))) .cse1)) .cse14))) (or .cse25 (and .cse30 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_389 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse31 (select .cse4 v_arrayElimCell_389))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse31) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse31)))) .cse0 .cse1))) (or .cse0 .cse1) (or .cse32 .cse14) (or .cse32 .cse33) (or .cse0 (and (forall ((v_arrayElimCell_355 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_355))) (forall ((v_arrayElimCell_354 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32))) (let ((.cse34 (select .cse4 v_arrayElimCell_354))) (or (bvule .cse3 .cse34) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse34))))) .cse1) .cse35 (or .cse32 (bvule (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~sub~0#1.offset|) .cse3)) (or .cse36 (and .cse37 (or .cse25 (and (or .cse0 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_364 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_364))) .cse1) .cse26 (or .cse14 (and .cse29 (or .cse0 .cse1 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_363 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_363)))) .cse28)) .cse27 .cse28)) (or (and .cse38 (or .cse0 .cse1 (forall ((v_arrayElimCell_365 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse39 (select .cse4 v_arrayElimCell_365))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse39) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse39) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse39)))))) .cse14) (or .cse20 (and .cse40 .cse38 .cse41 (or .cse19 (and .cse42 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_369 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse43 (select .cse4 v_arrayElimCell_369))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse43) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse43)))) .cse0 .cse1) .cse44)) .cse45 (or .cse0 .cse1 (forall ((v_arrayElimCell_368 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse46 (select .cse4 v_arrayElimCell_368))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse46) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse46) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse46))))))) (or .cse19 (and (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_367 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse47 (select .cse4 v_arrayElimCell_367))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse47) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse47)))) .cse0 .cse1) (or (and .cse48 (or .cse0 .cse1 (forall ((v_arrayElimCell_366 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_366)))) .cse49) .cse20) .cse50 .cse44)) .cse35 (or .cse0 (and (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_371 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_371))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_370 (_ BitVec 32))) (let ((.cse51 (select .cse4 v_arrayElimCell_370))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse51) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse51))))) .cse1) .cse41 (or (and .cse11 (or (and (or .cse0 .cse1 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_359 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_359)))) .cse48 .cse49) .cse19) (or (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_360 (_ BitVec 32))) (let ((.cse52 (select .cse4 v_arrayElimCell_360))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse52) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse52)))) .cse0 .cse1) (or (and .cse12 .cse13 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_361 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_361))) .cse0 .cse1)) .cse14) (or .cse0 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_362 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_362))) .cse1) .cse53 .cse54) .cse20) (or .cse25 (and .cse42 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_arrayElimCell_372 (_ BitVec 32))) (let ((.cse55 (select .cse4 v_arrayElimCell_372))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse55) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse55)))) .cse0 .cse1))))) (or .cse25 .cse32) (or .cse36 .cse32) (or (and .cse56 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_358 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse57 (select .cse4 v_arrayElimCell_358))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse57) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse57) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse57)))) .cse0 .cse1)) .cse14) .cse41 (or (and .cse37 (or .cse25 (and .cse42 (or .cse0 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse58 (select .cse4 v_arrayElimCell_386))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse58) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse58)))) .cse1))) (or .cse0 (and (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_384 (_ BitVec 32))) (let ((.cse59 (select .cse4 v_arrayElimCell_384))) (or (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse59) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse59)))) (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_385)))) .cse1) .cse35 (or (and (or (and .cse42 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (let ((.cse60 (select .cse4 v_arrayElimCell_383))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse60) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse60)))) .cse0 .cse1) .cse44) .cse19) .cse40 .cse38 (or .cse0 .cse1 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (let ((.cse61 (select .cse4 v_arrayElimCell_382))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse61) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse61) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse61))))) .cse41 .cse45) .cse20) .cse41 (or (and .cse38 (or .cse0 (forall ((v_arrayElimCell_379 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse62 (select .cse4 v_arrayElimCell_379))) (or (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse62) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse62) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse62)))) .cse1)) .cse14) (or .cse25 (and .cse26 .cse27 (or (and .cse29 (or (forall ((v_arrayElimCell_377 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_377))) .cse0 .cse1) .cse28) .cse14) (or .cse0 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_378 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_378))) .cse1) .cse28)) (or .cse19 (and (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_arrayElimCell_381 (_ BitVec 32))) (let ((.cse63 (select .cse4 v_arrayElimCell_381))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse63) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse63)))) .cse0 .cse1) .cse50 (or (and .cse48 (or .cse0 .cse1 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_380 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_380)))) .cse49) .cse20) .cse44)) (or .cse20 (and .cse11 (or (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_374 (_ BitVec 32))) (let ((.cse64 (select .cse4 v_arrayElimCell_374))) (or (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse64) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse64)))) .cse0 .cse1) (or (forall ((v_arrayElimCell_376 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_376))) .cse0 .cse1) (or (and .cse12 .cse13 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_375 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_375))) .cse0 .cse1)) .cse14) (or .cse19 (and .cse48 .cse49 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_373 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_373))) .cse0 .cse1))) .cse53 .cse54))) .cse33) (or (and (or (and .cse30 .cse22 (or .cse0 .cse1 (forall ((v_arrayElimCell_388 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse65 (select .cse4 v_arrayElimCell_388))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse65) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse65)))))) .cse19) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse67 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (select .cse67 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse66) (bvule .cse3 .cse66) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse66)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse67 |c_create_sub_list_~sub#1.base|)))))) (or .cse0 .cse1 (forall ((v_arrayElimCell_387 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse68 (select .cse4 v_arrayElimCell_387))) (or (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse68) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse68) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse68))))) .cse56 .cse41 .cse45) .cse20) (or (and .cse69 .cse22) .cse25))))))) is different from true [2022-11-21 16:32:10,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [535811130] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:32:10,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:32:10,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 48 [2022-11-21 16:32:10,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374460784] [2022-11-21 16:32:10,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:32:10,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-21 16:32:10,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:32:10,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-21 16:32:10,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=3329, Unknown=22, NotChecked=234, Total=3782 [2022-11-21 16:32:10,710 INFO L87 Difference]: Start difference. First operand 197 states and 225 transitions. Second operand has 49 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 43 states have internal predecessors, (71), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 16:32:56,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:32:56,133 INFO L93 Difference]: Finished difference Result 198 states and 225 transitions. [2022-11-21 16:32:56,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-21 16:32:56,133 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 43 states have internal predecessors, (71), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-11-21 16:32:56,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:32:56,135 INFO L225 Difference]: With dead ends: 198 [2022-11-21 16:32:56,135 INFO L226 Difference]: Without dead ends: 198 [2022-11-21 16:32:56,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 64 SyntacticMatches, 7 SemanticMatches, 94 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 48.4s TimeCoverageRelationStatistics Valid=659, Invalid=8026, Unknown=65, NotChecked=370, Total=9120 [2022-11-21 16:32:56,138 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 153 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 2698 mSolverCounterSat, 47 mSolverCounterUnsat, 63 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 2808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2698 IncrementalHoareTripleChecker+Invalid, 63 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:32:56,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1276 Invalid, 2808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2698 Invalid, 63 Unknown, 0 Unchecked, 17.6s Time] [2022-11-21 16:32:56,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-21 16:32:56,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2022-11-21 16:32:56,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 145 states have (on average 1.2689655172413794) internal successors, (184), 168 states have internal predecessors, (184), 16 states have call successors, (16), 13 states have call predecessors, (16), 13 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2022-11-21 16:32:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 224 transitions. [2022-11-21 16:32:56,147 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 224 transitions. Word has length 51 [2022-11-21 16:32:56,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:32:56,148 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 224 transitions. [2022-11-21 16:32:56,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 43 states have internal predecessors, (71), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 16:32:56,148 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 224 transitions. [2022-11-21 16:32:56,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-21 16:32:56,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:32:56,150 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:32:56,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2022-11-21 16:32:56,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-11-21 16:32:56,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:32:56,567 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting list_add_tailErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:32:56,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:32:56,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1861045348, now seen corresponding path program 1 times [2022-11-21 16:32:56,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:32:56,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228500539] [2022-11-21 16:32:56,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:32:56,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:32:56,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:32:56,569 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:32:56,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-11-21 16:32:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:32:56,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-21 16:32:56,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:32:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:32:57,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:32:57,677 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-21 16:32:57,678 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-21 16:32:57,746 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-21 16:32:57,747 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-21 16:32:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:32:57,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:32:57,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228500539] [2022-11-21 16:32:57,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228500539] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:32:57,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:32:57,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2022-11-21 16:32:57,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322266555] [2022-11-21 16:32:57,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:32:57,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 16:32:57,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:32:57,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 16:32:57,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:32:57,793 INFO L87 Difference]: Start difference. First operand 197 states and 224 transitions. Second operand has 11 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 16:32:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:32:59,466 INFO L93 Difference]: Finished difference Result 206 states and 232 transitions. [2022-11-21 16:32:59,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:32:59,466 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2022-11-21 16:32:59,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:32:59,468 INFO L225 Difference]: With dead ends: 206 [2022-11-21 16:32:59,468 INFO L226 Difference]: Without dead ends: 206 [2022-11-21 16:32:59,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-11-21 16:32:59,469 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 96 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:32:59,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 415 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-21 16:32:59,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-21 16:32:59,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 196. [2022-11-21 16:32:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 145 states have (on average 1.2551724137931035) internal successors, (182), 167 states have internal predecessors, (182), 16 states have call successors, (16), 13 states have call predecessors, (16), 13 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2022-11-21 16:32:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 222 transitions. [2022-11-21 16:32:59,478 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 222 transitions. Word has length 54 [2022-11-21 16:32:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:32:59,479 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 222 transitions. [2022-11-21 16:32:59,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 16:32:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 222 transitions. [2022-11-21 16:32:59,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-21 16:32:59,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:32:59,481 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:32:59,504 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2022-11-21 16:32:59,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:32:59,699 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting list_add_tailErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:32:59,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:32:59,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1861045347, now seen corresponding path program 1 times [2022-11-21 16:32:59,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:32:59,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091891813] [2022-11-21 16:32:59,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:32:59,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:32:59,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:32:59,701 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:32:59,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-11-21 16:33:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:00,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-21 16:33:00,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:33:00,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:33:01,969 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 22 treesize of output 18 [2022-11-21 16:33:02,712 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:33:02,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-11-21 16:33:03,906 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:33:03,907 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 20 [2022-11-21 16:33:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:33:05,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:33:05,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091891813] [2022-11-21 16:33:05,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091891813] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:33:05,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:33:05,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-11-21 16:33:05,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398135888] [2022-11-21 16:33:05,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:33:05,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-21 16:33:05,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:33:05,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-21 16:33:05,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2022-11-21 16:33:05,013 INFO L87 Difference]: Start difference. First operand 196 states and 222 transitions. Second operand has 22 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 18 states have internal predecessors, (70), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-21 16:33:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:10,399 INFO L93 Difference]: Finished difference Result 197 states and 219 transitions. [2022-11-21 16:33:10,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 16:33:10,402 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 18 states have internal predecessors, (70), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 54 [2022-11-21 16:33:10,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:10,403 INFO L225 Difference]: With dead ends: 197 [2022-11-21 16:33:10,404 INFO L226 Difference]: Without dead ends: 197 [2022-11-21 16:33:10,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2022-11-21 16:33:10,405 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 205 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:10,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 545 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-21 16:33:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-21 16:33:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2022-11-21 16:33:10,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 145 states have (on average 1.2275862068965517) internal successors, (178), 165 states have internal predecessors, (178), 16 states have call successors, (16), 13 states have call predecessors, (16), 13 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2022-11-21 16:33:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 218 transitions. [2022-11-21 16:33:10,413 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 218 transitions. Word has length 54 [2022-11-21 16:33:10,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:10,414 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 218 transitions. [2022-11-21 16:33:10,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 18 states have internal predecessors, (70), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-21 16:33:10,414 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 218 transitions. [2022-11-21 16:33:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-21 16:33:10,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:10,415 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:33:10,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-11-21 16:33:10,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:33:10,632 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting list_add_tailErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:33:10,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:10,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1758182945, now seen corresponding path program 1 times [2022-11-21 16:33:10,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:33:10,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280268954] [2022-11-21 16:33:10,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:10,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:33:10,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:33:10,635 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:33:10,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-11-21 16:33:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:11,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-21 16:33:11,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:11,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:11,426 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 18 [2022-11-21 16:33:11,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:11,607 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-21 16:33:11,607 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 24 treesize of output 41 [2022-11-21 16:33:11,832 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 9 treesize of output 3 [2022-11-21 16:33:11,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:11,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:33: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 1 case distinctions, treesize of input 24 treesize of output 28 [2022-11-21 16:33:12,645 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-21 16:33:14,716 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 0 case distinctions, treesize of input 60 treesize of output 53 [2022-11-21 16:33:14,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:14,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:14,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:14,832 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-21 16:33:14,832 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 4 case distinctions, treesize of input 40 treesize of output 37 [2022-11-21 16:33:14,841 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-21 16:33:14,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:14,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:14,946 INFO L321 Elim1Store]: treesize reduction 16, result has 48.4 percent of original size [2022-11-21 16:33:14,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 35 [2022-11-21 16:33:15,254 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 9 treesize of output 3 [2022-11-21 16:33:15,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2022-11-21 16:33:16,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 16:33:17,924 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3136 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store (store (store |c_old(#memory_$Pointer$.base)| |c_list_add_tail_#in~head#1.base| v_ArrVal_3136) |c_list_add_tail_#in~new#1.base| v_ArrVal_3138) (select (select |c_old(#memory_$Pointer$.base)| |c_list_add_tail_#in~head#1.base|) (bvadd (_ bv4 32) |c_list_add_tail_#in~head#1.offset|)) v_ArrVal_3139))) (not (= |c_#StackHeapBarrier| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-11-21 16:33:18,022 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((|create_sub_list_insert_sub_~head#1.offset| (_ BitVec 32)) (v_ArrVal_3125 (_ BitVec 32)) (v_ArrVal_3138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3136 (Array (_ BitVec 32) (_ BitVec 32))) (|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (let ((.cse1 (bvadd |create_sub_list_insert_sub_~head#1.offset| (_ bv4 32)))) (let ((.cse0 (store (store |c_old(#memory_$Pointer$.base)| |c_create_sub_list_#in~sub#1.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_create_sub_list_#in~sub#1.base|) .cse1 |c_create_sub_list_#in~sub#1.base|) |create_sub_list_insert_sub_~head#1.offset| v_ArrVal_3125)) |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_3126))) (store (store (store .cse0 |c_create_sub_list_#in~sub#1.base| v_ArrVal_3136) |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_3138) (select (select .cse0 |c_create_sub_list_#in~sub#1.base|) .cse1) v_ArrVal_3139)))) (= (_ bv0 1) (select |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base|)) (bvult |create_sub_list_insert_sub_~sub~0#1.base| |c_#StackHeapBarrier|)))) is different from true [2022-11-21 16:33:18,193 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 0 case distinctions, treesize of input 60 treesize of output 53 [2022-11-21 16:33:18,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:18,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:18,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:18,306 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-21 16:33:18,307 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 4 case distinctions, treesize of input 40 treesize of output 37 [2022-11-21 16:33:18,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 28 treesize of output 16 [2022-11-21 16:33:18,385 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:33:18,385 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 13 treesize of output 13 [2022-11-21 16:33:19,137 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 7 [2022-11-21 16:33:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 7 not checked. [2022-11-21 16:33:19,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:33:20,055 INFO L321 Elim1Store]: treesize reduction 7, result has 56.3 percent of original size [2022-11-21 16:33:20,056 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 22 treesize of output 21 [2022-11-21 16:33:22,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:33:22,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280268954] [2022-11-21 16:33:22,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280268954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:33:22,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1086307569] [2022-11-21 16:33:22,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:22,389 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 16:33:22,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 16:33:22,390 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 16:33:22,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2022-11-21 16:33:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:24,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-21 16:33:24,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:25,233 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 16:33:25,233 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 20 [2022-11-21 16:33:25,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:25,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:25,593 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 16:33:25,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 32 [2022-11-21 16:33:26,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:26,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:26,061 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:33:26,061 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 22 treesize of output 16 [2022-11-21 16:33:26,074 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-21 16:33:28,244 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 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 16:33:29,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:29,956 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 0 case distinctions, treesize of input 62 treesize of output 53 [2022-11-21 16:33:29,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:29,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:29,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:29,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:30,078 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-21 16:33:30,078 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 4 case distinctions, treesize of input 38 treesize of output 35 [2022-11-21 16:33:30,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:30,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:30,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:30,221 INFO L321 Elim1Store]: treesize reduction 61, result has 20.8 percent of original size [2022-11-21 16:33:30,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 48 [2022-11-21 16:33:30,282 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-21 16:33:30,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:30,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:30,835 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:33:30,835 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 1 case distinctions, treesize of input 22 treesize of output 16 [2022-11-21 16:33:30,872 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-21 16:33:34,262 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 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 16:33:40,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:40,525 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2022-11-21 16:33:40,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:40,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:40,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:40,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:40,679 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-21 16:33:40,680 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 4 case distinctions, treesize of input 34 treesize of output 31 [2022-11-21 16:33:40,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:40,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:40,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:40,885 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-21 16:33:40,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 55 [2022-11-21 16:33:41,074 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-21 16:33:43,349 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-21 16:33:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:45,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:33:48,167 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_103| (_ BitVec 32)) (v_ArrVal_3343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3346 (_ BitVec 32))) (or (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_103| (_ bv1 1)) (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_insert_top_~top~0#1.offset| (_ bv20 32)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_top_~top~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_top_~top~0#1.base|) .cse1 |c_ULTIMATE.start_insert_top_~top~0#1.base|) (bvadd (_ bv16 32) |c_ULTIMATE.start_insert_top_~top~0#1.offset|) v_ArrVal_3346)) |v_create_sub_list_insert_sub_~sub~0#1.base_103| v_ArrVal_3345))) (store (store (store .cse0 |c_ULTIMATE.start_insert_top_~top~0#1.base| v_ArrVal_3342) |v_create_sub_list_insert_sub_~sub~0#1.base_103| v_ArrVal_3344) (select (select .cse0 |c_ULTIMATE.start_insert_top_~top~0#1.base|) .cse1) v_ArrVal_3343))) |c_ULTIMATE.start_insert_top_~head#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_insert_top_~head#1.offset|)))) (_ bv0 1)) (not (bvult |v_create_sub_list_insert_sub_~sub~0#1.base_103| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_103|) (_ bv0 1))))) is different from false [2022-11-21 16:33:48,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1086307569] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:33:48,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:33:48,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 39] total 65 [2022-11-21 16:33:48,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447240831] [2022-11-21 16:33:48,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:33:48,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-21 16:33:48,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:33:48,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-21 16:33:48,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=5068, Unknown=73, NotChecked=438, Total=5852 [2022-11-21 16:33:48,178 INFO L87 Difference]: Start difference. First operand 194 states and 218 transitions. Second operand has 67 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 55 states have internal predecessors, (82), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-21 16:33:53,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 16:34:47,644 WARN L233 SmtUtils]: Spent 12.87s on a formula simplification. DAG size of input: 130 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:35:01,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:35:01,968 INFO L93 Difference]: Finished difference Result 286 states and 320 transitions. [2022-11-21 16:35:01,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-21 16:35:01,970 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 55 states have internal predecessors, (82), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 56 [2022-11-21 16:35:01,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:35:01,972 INFO L225 Difference]: With dead ends: 286 [2022-11-21 16:35:01,972 INFO L226 Difference]: Without dead ends: 286 [2022-11-21 16:35:01,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 103 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2920 ImplicationChecksByTransitivity, 70.0s TimeCoverageRelationStatistics Valid=667, Invalid=9467, Unknown=180, NotChecked=606, Total=10920 [2022-11-21 16:35:01,976 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 227 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 2623 mSolverCounterSat, 76 mSolverCounterUnsat, 74 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 3034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2623 IncrementalHoareTripleChecker+Invalid, 74 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 26.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:35:01,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1232 Invalid, 3034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2623 Invalid, 74 Unknown, 261 Unchecked, 26.7s Time] [2022-11-21 16:35:01,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-21 16:35:01,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 251. [2022-11-21 16:35:01,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 192 states have (on average 1.1875) internal successors, (228), 213 states have internal predecessors, (228), 21 states have call successors, (21), 18 states have call predecessors, (21), 18 states have return successors, (32), 19 states have call predecessors, (32), 21 states have call successors, (32) [2022-11-21 16:35:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 281 transitions. [2022-11-21 16:35:01,987 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 281 transitions. Word has length 56 [2022-11-21 16:35:01,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:35:01,988 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 281 transitions. [2022-11-21 16:35:01,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 55 states have internal predecessors, (82), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-21 16:35:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 281 transitions. [2022-11-21 16:35:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-21 16:35:01,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:35:01,989 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:35:02,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-11-21 16:35:02,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2022-11-21 16:35:02,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt [2022-11-21 16:35:02,408 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:35:02,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:35:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1758182944, now seen corresponding path program 1 times [2022-11-21 16:35:02,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:35:02,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681027378] [2022-11-21 16:35:02,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:35:02,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:35:02,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:35:02,411 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:35:02,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-11-21 16:35:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:35:03,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 140 conjunts are in the unsatisfiable core [2022-11-21 16:35:03,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:35:03,215 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 7 [2022-11-21 16:35:03,234 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-21 16:35:03,391 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 16:35:03,391 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 19 treesize of output 27 [2022-11-21 16:35:03,431 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-21 16:35:03,670 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 15 treesize of output 11 [2022-11-21 16:35:03,683 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-21 16:35:03,694 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-21 16:35:03,705 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-21 16:35:04,738 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-21 16:35:04,746 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-21 16:35:07,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:07,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:07,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:07,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:35:07,223 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 48 treesize of output 43 [2022-11-21 16:35:07,246 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 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-21 16:35:07,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:07,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:07,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:07,374 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-21 16:35:07,374 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 4 case distinctions, treesize of input 38 treesize of output 35 [2022-11-21 16:35:07,384 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-21 16:35:07,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:07,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 16:35:07,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:07,447 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:35:07,449 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 20 treesize of output 18 [2022-11-21 16:35:07,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:35:07,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2022-11-21 16:35:07,809 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-21 16:35:07,817 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-21 16:35:09,268 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-21 16:35:09,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 16:35:10,937 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_list_add_tail_#in~head#1.base|) (bvadd (_ bv4 32) |c_list_add_tail_#in~head#1.offset|)))) (and (exists ((v_ArrVal_3506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3510 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (store (store |c_old(#memory_$Pointer$.base)| |c_list_add_tail_#in~head#1.base| v_ArrVal_3506) |c_list_add_tail_#in~new#1.base| v_ArrVal_3510) .cse0 v_ArrVal_3512) |c_#memory_$Pointer$.base|)) (not (= |c_#StackHeapBarrier| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((v_ArrVal_3505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3511 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| |c_list_add_tail_#in~head#1.base| v_ArrVal_3505) |c_list_add_tail_#in~new#1.base| v_ArrVal_3509) .cse0 v_ArrVal_3511))))) is different from true [2022-11-21 16:35:11,093 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3511 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3483 (Array (_ BitVec 32) (_ BitVec 32))) (|create_sub_list_insert_sub_~head#1.offset| (_ BitVec 32)) (v_ArrVal_3485 (_ BitVec 32)) (v_ArrVal_3482 (_ BitVec 32)) (v_ArrVal_3509 (Array (_ BitVec 32) (_ BitVec 32))) (|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (let ((.cse2 (bvadd |create_sub_list_insert_sub_~head#1.offset| (_ bv4 32)))) (let ((.cse1 (store (store |c_old(#memory_$Pointer$.base)| |c_create_sub_list_#in~sub#1.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_create_sub_list_#in~sub#1.base|) .cse2 |c_create_sub_list_#in~sub#1.base|) |create_sub_list_insert_sub_~head#1.offset| v_ArrVal_3482)) |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_3486))) (let ((.cse0 (select (select .cse1 |c_create_sub_list_#in~sub#1.base|) .cse2))) (and (= (store (store (store (store (store |c_old(#memory_$Pointer$.offset)| |c_create_sub_list_#in~sub#1.base| v_ArrVal_3483) |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_3487) |c_create_sub_list_#in~sub#1.base| v_ArrVal_3505) |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_3509) .cse0 v_ArrVal_3511) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base|)) (= |c_#memory_$Pointer$.base| (store (store (store .cse1 |c_create_sub_list_#in~sub#1.base| v_ArrVal_3506) |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_3510) .cse0 v_ArrVal_3512)) (bvult |create_sub_list_insert_sub_~sub~0#1.base| |c_#StackHeapBarrier|) (= |c_#length| (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_3485))))))) (not (= |c_#StackHeapBarrier| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-11-21 16:35:11,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:11,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:11,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:11,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:35:11,388 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 48 treesize of output 43 [2022-11-21 16:35:11,414 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 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-21 16:35:11,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:11,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:11,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:11,580 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-21 16:35:11,581 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 4 case distinctions, treesize of input 38 treesize of output 35 [2022-11-21 16:35:11,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:11,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 16:35:11,634 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 28 treesize of output 16 [2022-11-21 16:35:11,679 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:35:11,679 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 13 treesize of output 13 [2022-11-21 16:35:12,564 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-21 16:35:12,576 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-21 16:35:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 7 not checked. [2022-11-21 16:35:13,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:35:18,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:35:18,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681027378] [2022-11-21 16:35:18,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681027378] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:35:18,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1459800036] [2022-11-21 16:35:18,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:35:18,078 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 16:35:18,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 16:35:18,079 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 16:35:18,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2022-11-21 16:35:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:35:21,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 151 conjunts are in the unsatisfiable core [2022-11-21 16:35:21,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:35:21,708 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-21 16:35:22,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:22,069 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-21 16:35:22,088 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 7 [2022-11-21 16:35:22,641 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-21 16:35:22,650 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-21 16:35:22,659 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-21 16:35:22,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 16:35:25,398 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-21 16:35:25,407 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-21 16:35:27,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:27,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:27,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:27,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:27,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:35:27,968 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 50 treesize of output 45 [2022-11-21 16:35:28,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:28,009 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 0 case distinctions, treesize of input 62 treesize of output 53 [2022-11-21 16:35:28,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:28,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:28,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:28,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:28,147 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-21 16:35:28,147 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 4 case distinctions, treesize of input 38 treesize of output 35 [2022-11-21 16:35:28,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:28,174 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-21 16:35:28,233 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:35:28,234 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 13 treesize of output 13 [2022-11-21 16:35:28,271 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-21 16:35:28,785 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 7 treesize of output 5 [2022-11-21 16:35:28,816 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-21 16:35:28,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 7 treesize of output 3 [2022-11-21 16:35:28,834 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-21 16:35:32,635 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-21 16:35:32,643 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-21 16:35:36,852 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_list_add_tail_#in~head#1.base|) (bvadd (_ bv4 32) |c_list_add_tail_#in~head#1.offset|)))) (and (exists ((v_ArrVal_3735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3729 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (store (store |c_old(#memory_$Pointer$.offset)| |c_list_add_tail_#in~head#1.base| v_ArrVal_3729) |c_list_add_tail_#in~new#1.base| v_ArrVal_3732) .cse0 v_ArrVal_3735) |c_#memory_$Pointer$.offset|)) (exists ((|v_create_sub_list_insert_sub_~sub~0#1.base_110| (_ BitVec 32)) (|v_ULTIMATE.start_insert_top_~top~0#1.base_BEFORE_CALL_39| (_ BitVec 32))) (and (bvult |v_create_sub_list_insert_sub_~sub~0#1.base_110| |c_#StackHeapBarrier|) (bvult |v_ULTIMATE.start_insert_top_~top~0#1.base_BEFORE_CALL_39| |c_#StackHeapBarrier|) (not (= |v_create_sub_list_insert_sub_~sub~0#1.base_110| |v_ULTIMATE.start_insert_top_~top~0#1.base_BEFORE_CALL_39|)))) (exists ((v_ArrVal_3736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store (store (store |c_old(#memory_$Pointer$.base)| |c_list_add_tail_#in~head#1.base| v_ArrVal_3728) |c_list_add_tail_#in~new#1.base| v_ArrVal_3734) .cse0 v_ArrVal_3736))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))))) is different from true [2022-11-21 16:35:39,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:39,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:39,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:39,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:39,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:35:39,079 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 44 treesize of output 39 [2022-11-21 16:35:39,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:39,131 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2022-11-21 16:35:39,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:39,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:39,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:39,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:39,313 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-21 16:35:39,313 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 4 case distinctions, treesize of input 34 treesize of output 31 [2022-11-21 16:35:39,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:35:39,356 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-21 16:35:39,426 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:35:39,426 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 13 treesize of output 13 [2022-11-21 16:35:39,557 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-21 16:35:41,717 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-21 16:35:41,728 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-21 16:35:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-21 16:35:43,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:35:49,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1459800036] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:35:49,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:35:49,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 39] total 64 [2022-11-21 16:35:49,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755680356] [2022-11-21 16:35:49,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:35:49,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-21 16:35:49,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:35:49,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-21 16:35:49,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=4375, Unknown=74, NotChecked=408, Total=5112 [2022-11-21 16:35:49,778 INFO L87 Difference]: Start difference. First operand 251 states and 281 transitions. Second operand has 65 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 54 states have internal predecessors, (81), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-21 16:35:54,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 16:36:20,008 WARN L233 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 143 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:37:00,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:37:00,596 INFO L93 Difference]: Finished difference Result 253 states and 282 transitions. [2022-11-21 16:37:00,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-21 16:37:00,599 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 54 states have internal predecessors, (81), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 56 [2022-11-21 16:37:00,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:37:00,601 INFO L225 Difference]: With dead ends: 253 [2022-11-21 16:37:00,601 INFO L226 Difference]: Without dead ends: 253 [2022-11-21 16:37:00,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2291 ImplicationChecksByTransitivity, 68.4s TimeCoverageRelationStatistics Valid=496, Invalid=7172, Unknown=176, NotChecked=528, Total=8372 [2022-11-21 16:37:00,603 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 47 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 22 mSolverCounterUnsat, 49 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 49 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 32.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:37:00,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1043 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1784 Invalid, 49 Unknown, 272 Unchecked, 32.1s Time] [2022-11-21 16:37:00,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-21 16:37:00,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 251. [2022-11-21 16:37:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 192 states have (on average 1.1822916666666667) internal successors, (227), 213 states have internal predecessors, (227), 21 states have call successors, (21), 18 states have call predecessors, (21), 18 states have return successors, (32), 19 states have call predecessors, (32), 21 states have call successors, (32) [2022-11-21 16:37:00,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 280 transitions. [2022-11-21 16:37:00,614 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 280 transitions. Word has length 56 [2022-11-21 16:37:00,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:37:00,614 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 280 transitions. [2022-11-21 16:37:00,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 54 states have internal predecessors, (81), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-21 16:37:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 280 transitions. [2022-11-21 16:37:00,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-21 16:37:00,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:37:00,616 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:37:00,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Ended with exit code 0 [2022-11-21 16:37:00,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2022-11-21 16:37:01,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt [2022-11-21 16:37:01,031 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting list_add_tailErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:37:01,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:37:01,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1649914890, now seen corresponding path program 1 times [2022-11-21 16:37:01,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:37:01,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026550005] [2022-11-21 16:37:01,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:37:01,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:37:01,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:37:01,034 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:37:01,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-11-21 16:37:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:37:01,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-21 16:37:01,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:37:02,942 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-21 16:37:02,968 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-21 16:37:03,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:37:03,198 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-21 16:37:03,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:37:03,255 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-21 16:37:03,439 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 16:37:03,439 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 19 treesize of output 27 [2022-11-21 16:37:03,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 16 treesize of output 18 [2022-11-21 16:37:03,978 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-21 16:37:04,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:37:04,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:37:07,856 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 0 case distinctions, treesize of input 65 treesize of output 36 [2022-11-21 16:37:08,036 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-21 16:37:08,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 128 [2022-11-21 16:37:08,052 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 132 treesize of output 96 [2022-11-21 16:37:08,070 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 42 treesize of output 24 [2022-11-21 16:37:08,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 22 [2022-11-21 16:37:08,976 INFO L321 Elim1Store]: treesize reduction 62, result has 36.1 percent of original size [2022-11-21 16:37:08,977 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 32 treesize of output 55 [2022-11-21 16:37:09,526 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 40 treesize of output 38 [2022-11-21 16:37:10,866 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 35 treesize of output 19 [2022-11-21 16:37:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:37:11,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:37:13,561 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3960 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_3960) |c_create_sub_list_insert_sub_~head#1.base|) (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|)))) (_ bv0 1))) is different from false [2022-11-21 16:37:18,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:37:18,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026550005] [2022-11-21 16:37:18,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026550005] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:37:18,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [264726760] [2022-11-21 16:37:18,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:37:18,596 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 16:37:18,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 16:37:18,600 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 16:37:18,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-11-21 16:37:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:37:22,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-21 16:37:22,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:37:22,381 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-21 16:37:22,408 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-21 16:37:22,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:37:22,458 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-21 16:37:22,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:37:22,503 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-21 16:37:22,552 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-21 16:37:22,769 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 16:37:22,769 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 19 treesize of output 27 [2022-11-21 16:37:23,456 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-21 16:37:23,556 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-21 16:37:23,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:37:23,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:37:30,397 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 0 case distinctions, treesize of input 97 treesize of output 56 [2022-11-21 16:37:30,562 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-21 16:37:30,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 137 [2022-11-21 16:37:30,581 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 141 treesize of output 101 [2022-11-21 16:37:30,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 72 treesize of output 36 [2022-11-21 16:37:31,948 INFO L321 Elim1Store]: treesize reduction 78, result has 31.0 percent of original size [2022-11-21 16:37:31,949 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 32 treesize of output 55 [2022-11-21 16:37:32,081 INFO L321 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-11-21 16:37:32,081 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 19 treesize of output 19 [2022-11-21 16:37:32,913 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 16:37:32,914 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 90 treesize of output 78 [2022-11-21 16:37:34,572 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-21 16:37:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:37:35,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:37:43,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [264726760] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:37:43,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:37:43,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 43 [2022-11-21 16:37:43,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572464683] [2022-11-21 16:37:43,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:37:43,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-21 16:37:43,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:37:43,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-21 16:37:43,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2612, Unknown=64, NotChecked=104, Total=2970 [2022-11-21 16:37:43,809 INFO L87 Difference]: Start difference. First operand 251 states and 280 transitions. Second operand has 44 states, 40 states have (on average 1.825) internal successors, (73), 38 states have internal predecessors, (73), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-21 16:38:20,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:38:20,568 INFO L93 Difference]: Finished difference Result 266 states and 293 transitions. [2022-11-21 16:38:20,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-21 16:38:20,569 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.825) internal successors, (73), 38 states have internal predecessors, (73), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 57 [2022-11-21 16:38:20,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:38:20,571 INFO L225 Difference]: With dead ends: 266 [2022-11-21 16:38:20,571 INFO L226 Difference]: Without dead ends: 266 [2022-11-21 16:38:20,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1684 ImplicationChecksByTransitivity, 39.8s TimeCoverageRelationStatistics Valid=521, Invalid=5856, Unknown=107, NotChecked=158, Total=6642 [2022-11-21 16:38:20,573 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 155 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 39 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:38:20,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1319 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2190 Invalid, 30 Unknown, 0 Unchecked, 21.5s Time] [2022-11-21 16:38:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-21 16:38:20,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2022-11-21 16:38:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 194 states have (on average 1.175257731958763) internal successors, (228), 216 states have internal predecessors, (228), 21 states have call successors, (21), 18 states have call predecessors, (21), 19 states have return successors, (32), 19 states have call predecessors, (32), 21 states have call successors, (32) [2022-11-21 16:38:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 281 transitions. [2022-11-21 16:38:20,583 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 281 transitions. Word has length 57 [2022-11-21 16:38:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:38:20,584 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 281 transitions. [2022-11-21 16:38:20,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.825) internal successors, (73), 38 states have internal predecessors, (73), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-21 16:38:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 281 transitions. [2022-11-21 16:38:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-21 16:38:20,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:38:20,585 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:38:20,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-11-21 16:38:20,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2022-11-21 16:38:21,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt [2022-11-21 16:38:21,006 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:38:21,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:38:21,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1649914891, now seen corresponding path program 1 times [2022-11-21 16:38:21,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:38:21,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216652907] [2022-11-21 16:38:21,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:38:21,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:38:21,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:38:21,008 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:38:21,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-11-21 16:38:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:38:21,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 101 conjunts are in the unsatisfiable core [2022-11-21 16:38:21,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:38:22,936 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-21 16:38:22,962 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-21 16:38:23,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:38:23,185 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-21 16:38:23,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:38:23,231 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-21 16:38:23,392 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:38:23,392 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 13 treesize of output 13 [2022-11-21 16:38:23,423 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-21 16:38:23,865 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-21 16:38:23,895 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-21 16:38:23,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:38:24,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:38:28,622 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 0 case distinctions, treesize of input 120 treesize of output 91 [2022-11-21 16:38:28,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:38:28,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-11-21 16:38:28,669 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 0 case distinctions, treesize of input 73 treesize of output 38 [2022-11-21 16:38:28,838 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-11-21 16:38:28,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 114 [2022-11-21 16:38:28,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:38:28,860 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 118 treesize of output 82 [2022-11-21 16:38:29,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:38:29,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 16 treesize of output 20 [2022-11-21 16:38:29,881 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:38:29,881 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 13 treesize of output 13 [2022-11-21 16:38:30,054 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-11-21 16:38:30,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2022-11-21 16:38:30,832 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-21 16:38:30,832 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 113 treesize of output 101 [2022-11-21 16:38:30,853 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-21 16:38:32,311 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-21 16:38:32,336 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-21 16:38:33,175 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:38:33,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:38:35,987 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_4320 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4320) |c_create_sub_list_insert_sub_~head#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_4321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4320 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4320) |c_create_sub_list_insert_sub_~head#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4321) |c_create_sub_list_insert_sub_~head#1.base|) .cse1)))))) is different from false [2022-11-21 16:38:55,302 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:38:55,303 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 295 treesize of output 319 [2022-11-21 16:39:14,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:39:14,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216652907] [2022-11-21 16:39:14,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216652907] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:39:14,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [399970215] [2022-11-21 16:39:14,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:39:14,361 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 16:39:14,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 16:39:14,362 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 16:39:14,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2022-11-21 16:39:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:39:19,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-21 16:39:19,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:39:20,731 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-21 16:39:20,769 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-21 16:39:20,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:39:20,807 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-21 16:39:20,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:39:20,859 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-21 16:39:21,072 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 16:39:21,072 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 19 treesize of output 27 [2022-11-21 16:39:21,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-21 16:39:22,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 16 treesize of output 18 [2022-11-21 16:39:22,083 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-21 16:39:22,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:39:22,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:39:34,682 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 0 case distinctions, treesize of input 120 treesize of output 91 [2022-11-21 16:39:34,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:39:34,716 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-11-21 16:39:34,736 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 0 case distinctions, treesize of input 86 treesize of output 45 [2022-11-21 16:39:34,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:39:34,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-21 16:39:34,961 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-11-21 16:39:34,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 125 [2022-11-21 16:39:34,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:39:34,988 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 129 treesize of output 89 [2022-11-21 16:39:35,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 22 [2022-11-21 16:39:36,505 INFO L321 Elim1Store]: treesize reduction 12, result has 55.6 percent of original size [2022-11-21 16:39:36,506 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 26 treesize of output 28 [2022-11-21 16:39:36,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-21 16:39:37,565 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 18 [2022-11-21 16:39:37,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-11-21 16:39:38,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:39:38,131 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-21 16:39:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:39:38,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:39:38,637 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_4513 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4514 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4514) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4513) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)))) (forall ((v_ArrVal_4514 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4514) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2022-11-21 16:40:00,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [399970215] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:40:00,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:40:00,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 39 [2022-11-21 16:40:00,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656983646] [2022-11-21 16:40:00,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:40:00,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-21 16:40:00,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:40:00,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-21 16:40:00,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2156, Unknown=53, NotChecked=190, Total=2550 [2022-11-21 16:40:00,373 INFO L87 Difference]: Start difference. First operand 254 states and 281 transitions. Second operand has 40 states, 37 states have (on average 1.837837837837838) internal successors, (68), 35 states have internal predecessors, (68), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-21 16:41:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:41:12,670 INFO L93 Difference]: Finished difference Result 276 states and 304 transitions. [2022-11-21 16:41:12,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-21 16:41:12,671 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.837837837837838) internal successors, (68), 35 states have internal predecessors, (68), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 57 [2022-11-21 16:41:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:41:12,672 INFO L225 Difference]: With dead ends: 276 [2022-11-21 16:41:12,673 INFO L226 Difference]: Without dead ends: 276 [2022-11-21 16:41:12,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 111.8s TimeCoverageRelationStatistics Valid=469, Invalid=4997, Unknown=92, NotChecked=294, Total=5852 [2022-11-21 16:41:12,674 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 148 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 44 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 1793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:41:12,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 996 Invalid, 1793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1709 Invalid, 40 Unknown, 0 Unchecked, 22.4s Time] [2022-11-21 16:41:12,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-11-21 16:41:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 268. [2022-11-21 16:41:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 206 states have (on average 1.1650485436893203) internal successors, (240), 229 states have internal predecessors, (240), 22 states have call successors, (22), 19 states have call predecessors, (22), 20 states have return successors, (33), 19 states have call predecessors, (33), 22 states have call successors, (33) [2022-11-21 16:41:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 295 transitions. [2022-11-21 16:41:12,683 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 295 transitions. Word has length 57 [2022-11-21 16:41:12,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:41:12,684 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 295 transitions. [2022-11-21 16:41:12,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.837837837837838) internal successors, (68), 35 states have internal predecessors, (68), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-21 16:41:12,684 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 295 transitions. [2022-11-21 16:41:12,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-21 16:41:12,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:41:12,685 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:41:12,707 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2022-11-21 16:41:12,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2022-11-21 16:41:13,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt [2022-11-21 16:41:13,105 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 16:41:13,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:41:13,105 INFO L85 PathProgramCache]: Analyzing trace with hash 994809867, now seen corresponding path program 2 times [2022-11-21 16:41:13,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:41:13,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341934285] [2022-11-21 16:41:13,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:41:13,106 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:41:13,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:41:13,126 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:41:13,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77d116f5-2787-4694-8f25-5c1197843f0d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-11-21 16:41:13,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 16:41:13,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:41:13,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-21 16:41:13,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:41:13,692 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-21 16:41:13,727 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-21 16:41:13,978 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-21 16:41:14,066 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-21 16:41:14,382 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 16:41:14,382 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 13 treesize of output 13 [2022-11-21 16:41:14,452 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 14 treesize of output 16 [2022-11-21 16:41:14,814 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-21 16:41:14,851 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