./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-queue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-queue-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 12:02:51,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:02:51,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:02:51,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:02:51,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:02:51,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:02:51,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:02:51,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:02:51,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:02:51,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:02:51,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:02:51,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:02:51,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:02:51,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:02:51,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:02:51,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:02:51,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:02:51,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:02:51,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:02:51,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:02:51,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:02:51,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:02:51,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:02:51,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:02:51,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:02:51,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:02:51,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:02:51,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:02:51,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:02:51,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:02:51,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:02:51,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:02:51,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:02:51,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:02:51,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:02:51,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:02:51,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:02:51,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:02:51,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:02:51,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:02:51,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:02:51,749 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 12:02:51,790 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:02:51,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:02:51,790 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:02:51,791 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:02:51,791 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:02:51,792 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:02:51,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:02:51,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:02:51,793 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:02:51,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:02:51,794 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:02:51,794 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 12:02:51,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:02:51,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:02:51,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:02:51,795 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 12:02:51,795 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 12:02:51,795 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 12:02:51,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:02:51,796 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 12:02:51,796 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:02:51,796 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:02:51,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:02:51,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:02:51,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:02:51,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:02:51,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:02:51,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:02:51,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:02:51,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:02:51,798 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_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 [2022-11-20 12:02:52,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:02:52,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:02:52,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:02:52,249 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:02:52,250 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:02:52,251 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/forester-heap/dll-queue-1.i [2022-11-20 12:02:55,945 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:02:56,356 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:02:56,357 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i [2022-11-20 12:02:56,371 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/data/00d0e7798/e109753b95ce455ba2763e951fee6777/FLAG28e3f9479 [2022-11-20 12:02:56,390 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/data/00d0e7798/e109753b95ce455ba2763e951fee6777 [2022-11-20 12:02:56,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:02:56,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:02:56,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:02:56,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:02:56,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:02:56,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:02:56" (1/1) ... [2022-11-20 12:02:56,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2873be67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:02:56, skipping insertion in model container [2022-11-20 12:02:56,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:02:56" (1/1) ... [2022-11-20 12:02:56,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:02:56,458 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:02:56,787 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[22460,22473] [2022-11-20 12:02:56,796 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[22531,22544] [2022-11-20 12:02:56,797 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[22605,22618] [2022-11-20 12:02:56,799 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[22697,22710] [2022-11-20 12:02:56,803 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[22774,22787] [2022-11-20 12:02:56,805 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[22869,22882] [2022-11-20 12:02:56,806 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[22946,22959] [2022-11-20 12:02:56,807 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[23029,23042] [2022-11-20 12:02:56,809 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[23124,23137] [2022-11-20 12:02:56,810 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[23201,23214] [2022-11-20 12:02:56,811 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[23284,23297] [2022-11-20 12:02:56,813 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[23373,23386] [2022-11-20 12:02:56,814 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[23459,23472] [2022-11-20 12:02:56,826 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[23604,23617] [2022-11-20 12:02:56,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:02:56,853 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:02:56,944 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[22460,22473] [2022-11-20 12:02:56,945 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[22531,22544] [2022-11-20 12:02:56,946 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[22605,22618] [2022-11-20 12:02:56,947 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[22697,22710] [2022-11-20 12:02:56,949 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[22774,22787] [2022-11-20 12:02:56,950 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[22869,22882] [2022-11-20 12:02:56,951 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[22946,22959] [2022-11-20 12:02:56,952 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[23029,23042] [2022-11-20 12:02:56,954 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[23124,23137] [2022-11-20 12:02:56,955 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[23201,23214] [2022-11-20 12:02:56,956 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[23284,23297] [2022-11-20 12:02:56,958 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[23373,23386] [2022-11-20 12:02:56,962 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[23459,23472] [2022-11-20 12:02:56,966 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/sv-benchmarks/c/forester-heap/dll-queue-1.i[23604,23617] [2022-11-20 12:02:56,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:02:57,020 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:02:57,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:02:57 WrapperNode [2022-11-20 12:02:57,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:02:57,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:02:57,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:02:57,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:02:57,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:02:57" (1/1) ... [2022-11-20 12:02:57,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:02:57" (1/1) ... [2022-11-20 12:02:57,097 INFO L138 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 226 [2022-11-20 12:02:57,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:02:57,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:02:57,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:02:57,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:02:57,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:02:57" (1/1) ... [2022-11-20 12:02:57,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:02:57" (1/1) ... [2022-11-20 12:02:57,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:02:57" (1/1) ... [2022-11-20 12:02:57,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:02:57" (1/1) ... [2022-11-20 12:02:57,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:02:57" (1/1) ... [2022-11-20 12:02:57,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:02:57" (1/1) ... [2022-11-20 12:02:57,140 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:02:57" (1/1) ... [2022-11-20 12:02:57,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:02:57" (1/1) ... [2022-11-20 12:02:57,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:02:57,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:02:57,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:02:57,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:02:57,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:02:57" (1/1) ... [2022-11-20 12:02:57,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:02:57,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:02:57,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:02:57,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:02:57,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 12:02:57,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:02:57,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 12:02:57,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:02:57,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 12:02:57,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 12:02:57,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:02:57,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:02:57,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:02:57,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:02:57,498 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:02:57,500 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:02:58,171 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:02:58,183 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:02:58,199 INFO L300 CfgBuilder]: Removed 31 assume(true) statements. [2022-11-20 12:02:58,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:02:58 BoogieIcfgContainer [2022-11-20 12:02:58,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:02:58,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:02:58,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:02:58,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:02:58,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:02:56" (1/3) ... [2022-11-20 12:02:58,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0e679d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:02:58, skipping insertion in model container [2022-11-20 12:02:58,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:02:57" (2/3) ... [2022-11-20 12:02:58,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0e679d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:02:58, skipping insertion in model container [2022-11-20 12:02:58,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:02:58" (3/3) ... [2022-11-20 12:02:58,224 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-queue-1.i [2022-11-20 12:02:58,280 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:02:58,280 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 76 error locations. [2022-11-20 12:02:58,354 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:02:58,365 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;@2de656e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:02:58,366 INFO L358 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2022-11-20 12:02:58,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 104 states have (on average 2.269230769230769) internal successors, (236), 180 states have internal predecessors, (236), 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-20 12:02:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 12:02:58,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:02:58,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 12:02:58,382 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:02:58,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:02:58,390 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-20 12:02:58,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:02:58,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637973732] [2022-11-20 12:02:58,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:02:58,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:02:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:58,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:02:58,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:02:58,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637973732] [2022-11-20 12:02:58,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637973732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:02:58,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:02:58,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:02:58,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602202864] [2022-11-20 12:02:58,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:02:58,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:02:58,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:02:58,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:02:58,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:02:58,752 INFO L87 Difference]: Start difference. First operand has 181 states, 104 states have (on average 2.269230769230769) internal successors, (236), 180 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:02:59,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:02:59,096 INFO L93 Difference]: Finished difference Result 178 states and 188 transitions. [2022-11-20 12:02:59,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:02:59,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 12:02:59,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:02:59,113 INFO L225 Difference]: With dead ends: 178 [2022-11-20 12:02:59,113 INFO L226 Difference]: Without dead ends: 174 [2022-11-20 12:02:59,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:02:59,120 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 169 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:02:59,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 112 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:02:59,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-20 12:02:59,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2022-11-20 12:02:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 105 states have (on average 1.7333333333333334) internal successors, (182), 169 states have internal predecessors, (182), 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-20 12:02:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 182 transitions. [2022-11-20 12:02:59,174 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 182 transitions. Word has length 3 [2022-11-20 12:02:59,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:02:59,175 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 182 transitions. [2022-11-20 12:02:59,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:02:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 182 transitions. [2022-11-20 12:02:59,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 12:02:59,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:02:59,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 12:02:59,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:02:59,176 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:02:59,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:02:59,177 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-20 12:02:59,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:02:59,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950260691] [2022-11-20 12:02:59,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:02:59,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:02:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:59,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:02:59,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:02:59,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950260691] [2022-11-20 12:02:59,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950260691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:02:59,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:02:59,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:02:59,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162259351] [2022-11-20 12:02:59,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:02:59,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:02:59,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:02:59,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:02:59,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:02:59,340 INFO L87 Difference]: Start difference. First operand 170 states and 182 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:02:59,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:02:59,536 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2022-11-20 12:02:59,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:02:59,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 12:02:59,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:02:59,546 INFO L225 Difference]: With dead ends: 163 [2022-11-20 12:02:59,546 INFO L226 Difference]: Without dead ends: 163 [2022-11-20 12:02:59,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:02:59,548 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 155 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:02:59,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 115 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:02:59,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-20 12:02:59,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2022-11-20 12:02:59,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 105 states have (on average 1.619047619047619) internal successors, (170), 158 states have internal predecessors, (170), 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-20 12:02:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2022-11-20 12:02:59,579 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 3 [2022-11-20 12:02:59,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:02:59,579 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2022-11-20 12:02:59,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:02:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2022-11-20 12:02:59,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 12:02:59,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:02:59,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:02:59,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:02:59,581 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:02:59,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:02:59,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2022-11-20 12:02:59,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:02:59,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764230702] [2022-11-20 12:02:59,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:02:59,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:02:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:02:59,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:02:59,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764230702] [2022-11-20 12:02:59,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764230702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:02:59,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:02:59,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:02:59,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642421759] [2022-11-20 12:02:59,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:02:59,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:02:59,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:02:59,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:02:59,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:02:59,912 INFO L87 Difference]: Start difference. First operand 159 states and 170 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:00,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:00,163 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2022-11-20 12:03:00,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:03:00,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 12:03:00,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:00,170 INFO L225 Difference]: With dead ends: 168 [2022-11-20 12:03:00,170 INFO L226 Difference]: Without dead ends: 168 [2022-11-20 12:03:00,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-20 12:03:00,176 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 272 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:00,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 118 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:03:00,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-20 12:03:00,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2022-11-20 12:03:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 112 states have (on average 1.5625) internal successors, (175), 159 states have internal predecessors, (175), 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-20 12:03:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 175 transitions. [2022-11-20 12:03:00,205 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 175 transitions. Word has length 9 [2022-11-20 12:03:00,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:00,205 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 175 transitions. [2022-11-20 12:03:00,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 175 transitions. [2022-11-20 12:03:00,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 12:03:00,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:00,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:00,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:03:00,209 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:03:00,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:00,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2022-11-20 12:03:00,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:00,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485874711] [2022-11-20 12:03:00,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:00,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:00,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:00,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485874711] [2022-11-20 12:03:00,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485874711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:00,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:00,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:03:00,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017343701] [2022-11-20 12:03:00,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:00,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:03:00,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:00,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:03:00,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:03:00,686 INFO L87 Difference]: Start difference. First operand 160 states and 175 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:01,171 INFO L93 Difference]: Finished difference Result 256 states and 272 transitions. [2022-11-20 12:03:01,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:03:01,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 12:03:01,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:01,173 INFO L225 Difference]: With dead ends: 256 [2022-11-20 12:03:01,173 INFO L226 Difference]: Without dead ends: 256 [2022-11-20 12:03:01,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:03:01,175 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 338 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:01,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 244 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:03:01,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-20 12:03:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 168. [2022-11-20 12:03:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 120 states have (on average 1.5416666666666667) internal successors, (185), 167 states have internal predecessors, (185), 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-20 12:03:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2022-11-20 12:03:01,203 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 185 transitions. Word has length 9 [2022-11-20 12:03:01,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:01,204 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 185 transitions. [2022-11-20 12:03:01,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:01,204 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 185 transitions. [2022-11-20 12:03:01,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 12:03:01,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:01,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:01,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:03:01,206 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:03:01,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:01,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1115899309, now seen corresponding path program 1 times [2022-11-20 12:03:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:01,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380207189] [2022-11-20 12:03:01,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:01,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:01,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:01,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:01,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380207189] [2022-11-20 12:03:01,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380207189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:01,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:01,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:03:01,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554971280] [2022-11-20 12:03:01,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:01,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:03:01,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:01,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:03:01,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:03:01,297 INFO L87 Difference]: Start difference. First operand 168 states and 185 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:01,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:01,349 INFO L93 Difference]: Finished difference Result 158 states and 174 transitions. [2022-11-20 12:03:01,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:03:01,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 12:03:01,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:01,351 INFO L225 Difference]: With dead ends: 158 [2022-11-20 12:03:01,351 INFO L226 Difference]: Without dead ends: 158 [2022-11-20 12:03:01,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:03:01,354 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 131 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:01,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 141 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:03:01,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-20 12:03:01,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2022-11-20 12:03:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 115 states have (on average 1.5130434782608695) internal successors, (174), 157 states have internal predecessors, (174), 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-20 12:03:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2022-11-20 12:03:01,377 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 10 [2022-11-20 12:03:01,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:01,378 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2022-11-20 12:03:01,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2022-11-20 12:03:01,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 12:03:01,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:01,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:01,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:03:01,380 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:03:01,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:01,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-11-20 12:03:01,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:01,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075922790] [2022-11-20 12:03:01,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:01,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:01,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:01,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075922790] [2022-11-20 12:03:01,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075922790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:01,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:01,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:03:01,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886419134] [2022-11-20 12:03:01,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:01,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:03:01,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:01,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:03:01,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:03:01,726 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-20 12:03:01,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:01,979 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2022-11-20 12:03:01,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:03:01,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-11-20 12:03:01,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:01,981 INFO L225 Difference]: With dead ends: 157 [2022-11-20 12:03:01,982 INFO L226 Difference]: Without dead ends: 157 [2022-11-20 12:03:01,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:03:01,989 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 7 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:01,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 424 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:03:01,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-20 12:03:02,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-11-20 12:03:02,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 156 states have internal predecessors, (172), 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-20 12:03:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 172 transitions. [2022-11-20 12:03:02,002 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 172 transitions. Word has length 12 [2022-11-20 12:03:02,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:02,003 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 172 transitions. [2022-11-20 12:03:02,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-20 12:03:02,004 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 172 transitions. [2022-11-20 12:03:02,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 12:03:02,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:02,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:02,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:03:02,007 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:03:02,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:02,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-11-20 12:03:02,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:02,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384370524] [2022-11-20 12:03:02,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:02,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:02,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:02,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:02,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384370524] [2022-11-20 12:03:02,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384370524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:02,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:02,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:03:02,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601671397] [2022-11-20 12:03:02,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:02,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:03:02,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:02,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:03:02,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:03:02,198 INFO L87 Difference]: Start difference. First operand 157 states and 172 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-20 12:03:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:02,398 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2022-11-20 12:03:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:03:02,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-11-20 12:03:02,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:02,400 INFO L225 Difference]: With dead ends: 156 [2022-11-20 12:03:02,400 INFO L226 Difference]: Without dead ends: 156 [2022-11-20 12:03:02,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:03:02,403 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 8 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:02,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 422 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:03:02,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-20 12:03:02,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-11-20 12:03:02,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 115 states have (on average 1.4782608695652173) internal successors, (170), 155 states have internal predecessors, (170), 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-20 12:03:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2022-11-20 12:03:02,410 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 12 [2022-11-20 12:03:02,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:02,410 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2022-11-20 12:03:02,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-20 12:03:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2022-11-20 12:03:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 12:03:02,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:02,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:02,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:03:02,413 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:03:02,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:02,414 INFO L85 PathProgramCache]: Analyzing trace with hash -794856606, now seen corresponding path program 1 times [2022-11-20 12:03:02,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:02,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706906256] [2022-11-20 12:03:02,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:02,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:02,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:02,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:02,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706906256] [2022-11-20 12:03:02,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706906256] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:02,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:02,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:03:02,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572037125] [2022-11-20 12:03:02,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:02,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:03:02,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:02,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:03:02,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:03:02,503 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:02,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:02,546 INFO L93 Difference]: Finished difference Result 208 states and 228 transitions. [2022-11-20 12:03:02,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:03:02,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 12:03:02,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:02,548 INFO L225 Difference]: With dead ends: 208 [2022-11-20 12:03:02,549 INFO L226 Difference]: Without dead ends: 208 [2022-11-20 12:03:02,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:03:02,551 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 53 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:02,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 273 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:03:02,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-11-20 12:03:02,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 164. [2022-11-20 12:03:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 123 states have (on average 1.4634146341463414) internal successors, (180), 163 states have internal predecessors, (180), 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-20 12:03:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 180 transitions. [2022-11-20 12:03:02,556 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 180 transitions. Word has length 16 [2022-11-20 12:03:02,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:02,557 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 180 transitions. [2022-11-20 12:03:02,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 180 transitions. [2022-11-20 12:03:02,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 12:03:02,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:02,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:02,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:03:02,560 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:03:02,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:02,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-11-20 12:03:02,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:02,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183702187] [2022-11-20 12:03:02,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:02,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:02,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:02,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183702187] [2022-11-20 12:03:02,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183702187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:02,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:02,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:03:02,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810957312] [2022-11-20 12:03:02,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:02,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:03:02,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:02,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:03:02,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:03:02,888 INFO L87 Difference]: Start difference. First operand 164 states and 180 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:03,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:03,402 INFO L93 Difference]: Finished difference Result 167 states and 179 transitions. [2022-11-20 12:03:03,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:03:03,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 12:03:03,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:03,404 INFO L225 Difference]: With dead ends: 167 [2022-11-20 12:03:03,405 INFO L226 Difference]: Without dead ends: 167 [2022-11-20 12:03:03,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-20 12:03:03,406 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 253 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:03,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 521 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:03:03,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-20 12:03:03,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2022-11-20 12:03:03,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 123 states have (on average 1.4471544715447155) internal successors, (178), 162 states have internal predecessors, (178), 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-20 12:03:03,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2022-11-20 12:03:03,411 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 16 [2022-11-20 12:03:03,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:03,412 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2022-11-20 12:03:03,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:03,413 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2022-11-20 12:03:03,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 12:03:03,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:03,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:03,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:03:03,414 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:03:03,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:03,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-11-20 12:03:03,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:03,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682759499] [2022-11-20 12:03:03,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:03,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:03,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:03,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682759499] [2022-11-20 12:03:03,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682759499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:03,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:03,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:03:03,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121097446] [2022-11-20 12:03:03,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:03,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:03:03,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:03,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:03:03,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:03:03,958 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:04,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:04,693 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2022-11-20 12:03:04,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 12:03:04,694 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 12:03:04,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:04,695 INFO L225 Difference]: With dead ends: 162 [2022-11-20 12:03:04,695 INFO L226 Difference]: Without dead ends: 162 [2022-11-20 12:03:04,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-11-20 12:03:04,696 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 335 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:04,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 398 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:03:04,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-20 12:03:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2022-11-20 12:03:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 155 states have internal predecessors, (170), 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-20 12:03:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2022-11-20 12:03:04,703 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 16 [2022-11-20 12:03:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:04,703 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2022-11-20 12:03:04,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:04,704 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2022-11-20 12:03:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 12:03:04,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:04,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:04,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:03:04,708 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:03:04,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:04,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1461793571, now seen corresponding path program 1 times [2022-11-20 12:03:04,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:04,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534841683] [2022-11-20 12:03:04,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:04,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:04,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:04,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:04,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534841683] [2022-11-20 12:03:04,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534841683] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:04,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:04,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:03:04,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354630787] [2022-11-20 12:03:04,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:04,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:03:04,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:04,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:03:04,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:03:04,757 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-20 12:03:04,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:04,769 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2022-11-20 12:03:04,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:03:04,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-11-20 12:03:04,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:04,771 INFO L225 Difference]: With dead ends: 157 [2022-11-20 12:03:04,771 INFO L226 Difference]: Without dead ends: 157 [2022-11-20 12:03:04,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:03:04,773 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:04,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:03:04,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-20 12:03:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-11-20 12:03:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 156 states have internal predecessors, (171), 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-20 12:03:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2022-11-20 12:03:04,781 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 21 [2022-11-20 12:03:04,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:04,781 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2022-11-20 12:03:04,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-20 12:03:04,782 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2022-11-20 12:03:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 12:03:04,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:04,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:04,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:03:04,788 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:03:04,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:04,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1463640613, now seen corresponding path program 1 times [2022-11-20 12:03:04,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:04,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445525592] [2022-11-20 12:03:04,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:04,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:05,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:05,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445525592] [2022-11-20 12:03:05,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445525592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:05,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:05,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:03:05,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12377912] [2022-11-20 12:03:05,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:05,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:03:05,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:05,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:03:05,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:03:05,150 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-20 12:03:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:05,355 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-11-20 12:03:05,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:03:05,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 21 [2022-11-20 12:03:05,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:05,357 INFO L225 Difference]: With dead ends: 165 [2022-11-20 12:03:05,357 INFO L226 Difference]: Without dead ends: 165 [2022-11-20 12:03:05,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:03:05,359 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 13 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:05,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 589 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:03:05,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-20 12:03:05,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2022-11-20 12:03:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 128 states have (on average 1.3671875) internal successors, (175), 160 states have internal predecessors, (175), 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-20 12:03:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 175 transitions. [2022-11-20 12:03:05,366 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 175 transitions. Word has length 21 [2022-11-20 12:03:05,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:05,367 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 175 transitions. [2022-11-20 12:03:05,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-20 12:03:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 175 transitions. [2022-11-20 12:03:05,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 12:03:05,368 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:05,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:05,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:03:05,370 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:03:05,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:05,372 INFO L85 PathProgramCache]: Analyzing trace with hash -348511767, now seen corresponding path program 1 times [2022-11-20 12:03:05,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:05,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51436124] [2022-11-20 12:03:05,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:05,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:05,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:05,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51436124] [2022-11-20 12:03:05,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51436124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:05,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:05,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:03:05,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643793087] [2022-11-20 12:03:05,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:05,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:03:05,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:05,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:03:05,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:03:05,506 INFO L87 Difference]: Start difference. First operand 161 states and 175 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:05,635 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2022-11-20 12:03:05,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:03:05,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 12:03:05,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:05,637 INFO L225 Difference]: With dead ends: 161 [2022-11-20 12:03:05,637 INFO L226 Difference]: Without dead ends: 161 [2022-11-20 12:03:05,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:03:05,639 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 156 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:05,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 212 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:03:05,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-11-20 12:03:05,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-11-20 12:03:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 128 states have (on average 1.359375) internal successors, (174), 160 states have internal predecessors, (174), 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-20 12:03:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2022-11-20 12:03:05,645 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 23 [2022-11-20 12:03:05,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:05,645 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2022-11-20 12:03:05,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:05,646 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2022-11-20 12:03:05,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 12:03:05,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:05,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:05,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 12:03:05,649 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:03:05,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:05,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1959765219, now seen corresponding path program 1 times [2022-11-20 12:03:05,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:05,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749296211] [2022-11-20 12:03:05,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:05,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:05,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:05,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749296211] [2022-11-20 12:03:05,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749296211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:05,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:05,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:03:05,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112773144] [2022-11-20 12:03:05,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:05,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:03:05,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:05,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:03:05,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:03:05,794 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:05,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:05,966 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2022-11-20 12:03:05,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:03:05,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 12:03:05,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:05,968 INFO L225 Difference]: With dead ends: 162 [2022-11-20 12:03:05,968 INFO L226 Difference]: Without dead ends: 162 [2022-11-20 12:03:05,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:03:05,969 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 268 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:05,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 235 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:03:05,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-20 12:03:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2022-11-20 12:03:05,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 127 states have (on average 1.3543307086614174) internal successors, (172), 158 states have internal predecessors, (172), 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-20 12:03:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 172 transitions. [2022-11-20 12:03:05,976 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 172 transitions. Word has length 23 [2022-11-20 12:03:05,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:05,976 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 172 transitions. [2022-11-20 12:03:05,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2022-11-20 12:03:05,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 12:03:05,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:05,980 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] [2022-11-20 12:03:05,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 12:03:05,981 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:03:05,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:05,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1577640795, now seen corresponding path program 1 times [2022-11-20 12:03:05,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:05,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985867548] [2022-11-20 12:03:05,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:05,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:06,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:06,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985867548] [2022-11-20 12:03:06,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985867548] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:03:06,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273955629] [2022-11-20 12:03:06,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:06,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:03:06,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:03:06,259 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:03:06,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:03:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:06,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-20 12:03:06,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:03:06,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 12:03:06,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 12:03:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:06,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:03:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:06,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273955629] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:03:06,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:03:06,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 11 [2022-11-20 12:03:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096305691] [2022-11-20 12:03:06,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:03:06,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:03:06,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:06,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:03:06,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:03:06,937 INFO L87 Difference]: Start difference. First operand 159 states and 172 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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-20 12:03:07,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:07,520 INFO L93 Difference]: Finished difference Result 188 states and 206 transitions. [2022-11-20 12:03:07,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:03:07,522 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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 26 [2022-11-20 12:03:07,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:07,523 INFO L225 Difference]: With dead ends: 188 [2022-11-20 12:03:07,523 INFO L226 Difference]: Without dead ends: 188 [2022-11-20 12:03:07,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-11-20 12:03:07,524 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 143 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:07,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 753 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:03:07,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-11-20 12:03:07,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 169. [2022-11-20 12:03:07,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 137 states have (on average 1.3357664233576643) internal successors, (183), 168 states have internal predecessors, (183), 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-20 12:03:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 183 transitions. [2022-11-20 12:03:07,530 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 183 transitions. Word has length 26 [2022-11-20 12:03:07,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:07,530 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 183 transitions. [2022-11-20 12:03:07,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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-20 12:03:07,530 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 183 transitions. [2022-11-20 12:03:07,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 12:03:07,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:07,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:07,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:03:07,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 12:03:07,738 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:03:07,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:07,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1662225504, now seen corresponding path program 1 times [2022-11-20 12:03:07,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:07,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053508180] [2022-11-20 12:03:07,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:07,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:07,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:07,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053508180] [2022-11-20 12:03:07,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053508180] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:03:07,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499871454] [2022-11-20 12:03:07,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:07,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:03:07,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:03:07,910 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:03:07,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:03:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:08,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 12:03:08,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:03:08,170 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 13 treesize of output 9 [2022-11-20 12:03:08,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:08,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:03:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:08,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499871454] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:03:08,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:03:08,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-20 12:03:08,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308849923] [2022-11-20 12:03:08,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:03:08,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:03:08,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:08,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:03:08,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:03:08,290 INFO L87 Difference]: Start difference. First operand 169 states and 183 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:08,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:08,525 INFO L93 Difference]: Finished difference Result 179 states and 192 transitions. [2022-11-20 12:03:08,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:03:08,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 12:03:08,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:08,527 INFO L225 Difference]: With dead ends: 179 [2022-11-20 12:03:08,527 INFO L226 Difference]: Without dead ends: 160 [2022-11-20 12:03:08,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:03:08,528 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:08,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 384 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:03:08,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-20 12:03:08,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-11-20 12:03:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 128 states have (on average 1.3515625) internal successors, (173), 159 states have internal predecessors, (173), 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-20 12:03:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2022-11-20 12:03:08,533 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 27 [2022-11-20 12:03:08,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:08,533 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2022-11-20 12:03:08,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:03:08,533 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2022-11-20 12:03:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 12:03:08,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:08,534 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, 1, 1, 1, 1] [2022-11-20 12:03:08,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:03:08,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 12:03:08,735 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:03:08,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:08,736 INFO L85 PathProgramCache]: Analyzing trace with hash -112828615, now seen corresponding path program 1 times [2022-11-20 12:03:08,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:08,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008015738] [2022-11-20 12:03:08,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:08,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:09,297 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-20 12:03:09,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:09,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008015738] [2022-11-20 12:03:09,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008015738] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:03:09,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688188705] [2022-11-20 12:03:09,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:09,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:03:09,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:03:09,300 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:03:09,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:03:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:09,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 12:03:09,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:03:09,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 12:03:09,667 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:03:09,667 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 11 treesize of output 11 [2022-11-20 12:03:09,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:03:09,882 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:03:09,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-20 12:03:10,028 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:03:10,029 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 30 treesize of output 28 [2022-11-20 12:03:10,082 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:03:10,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-20 12:03:10,238 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-20 12:03:10,243 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-20 12:03:10,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:03:10,403 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_502) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-20 12:03:10,419 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_500))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_502)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-20 12:03:10,511 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:03:10,511 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 37 treesize of output 30 [2022-11-20 12:03:10,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:03:10,529 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 245 treesize of output 220 [2022-11-20 12:03:10,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 196 [2022-11-20 12:03:10,559 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:03:10,560 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 196 treesize of output 189 [2022-11-20 12:03:10,955 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-20 12:03:10,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688188705] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:03:10,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:03:10,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 28 [2022-11-20 12:03:10,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299710656] [2022-11-20 12:03:10,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:03:10,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 12:03:10,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:10,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 12:03:10,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=553, Unknown=23, NotChecked=98, Total=756 [2022-11-20 12:03:10,958 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand has 28 states, 28 states have (on average 3.0) internal successors, (84), 28 states have internal predecessors, (84), 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-20 12:03:12,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:12,385 INFO L93 Difference]: Finished difference Result 291 states and 318 transitions. [2022-11-20 12:03:12,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 12:03:12,386 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0) internal successors, (84), 28 states have internal predecessors, (84), 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 33 [2022-11-20 12:03:12,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:12,388 INFO L225 Difference]: With dead ends: 291 [2022-11-20 12:03:12,388 INFO L226 Difference]: Without dead ends: 291 [2022-11-20 12:03:12,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=219, Invalid=1097, Unknown=24, NotChecked=142, Total=1482 [2022-11-20 12:03:12,389 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 604 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 1825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 837 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:12,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1535 Invalid, 1825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 953 Invalid, 0 Unknown, 837 Unchecked, 0.8s Time] [2022-11-20 12:03:12,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-11-20 12:03:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 175. [2022-11-20 12:03:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 143 states have (on average 1.3286713286713288) internal successors, (190), 174 states have internal predecessors, (190), 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-20 12:03:12,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 190 transitions. [2022-11-20 12:03:12,400 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 190 transitions. Word has length 33 [2022-11-20 12:03:12,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:12,401 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 190 transitions. [2022-11-20 12:03:12,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0) internal successors, (84), 28 states have internal predecessors, (84), 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-20 12:03:12,401 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 190 transitions. [2022-11-20 12:03:12,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 12:03:12,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:12,402 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, 1, 1, 1, 1, 1] [2022-11-20 12:03:12,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:03:12,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 12:03:12,609 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:03:12,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:12,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1345804944, now seen corresponding path program 1 times [2022-11-20 12:03:12,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:12,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383536772] [2022-11-20 12:03:12,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:12,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:03:12,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:12,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383536772] [2022-11-20 12:03:12,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383536772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:12,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:12,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:03:12,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695897221] [2022-11-20 12:03:12,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:12,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:03:12,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:12,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:03:12,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:03:12,672 INFO L87 Difference]: Start difference. First operand 175 states and 190 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-20 12:03:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:12,704 INFO L93 Difference]: Finished difference Result 249 states and 270 transitions. [2022-11-20 12:03:12,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:03:12,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2022-11-20 12:03:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:12,706 INFO L225 Difference]: With dead ends: 249 [2022-11-20 12:03:12,706 INFO L226 Difference]: Without dead ends: 249 [2022-11-20 12:03:12,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:03:12,707 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 58 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:12,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 256 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:03:12,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-11-20 12:03:12,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 196. [2022-11-20 12:03:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 164 states have (on average 1.2865853658536586) internal successors, (211), 195 states have internal predecessors, (211), 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-20 12:03:12,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 211 transitions. [2022-11-20 12:03:12,714 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 211 transitions. Word has length 34 [2022-11-20 12:03:12,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:12,716 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 211 transitions. [2022-11-20 12:03:12,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-20 12:03:12,717 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 211 transitions. [2022-11-20 12:03:12,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 12:03:12,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:12,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:12,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 12:03:12,735 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:03:12,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:12,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1598443618, now seen corresponding path program 1 times [2022-11-20 12:03:12,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:12,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143289959] [2022-11-20 12:03:12,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:12,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:13,386 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-20 12:03:13,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:13,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143289959] [2022-11-20 12:03:13,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143289959] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:03:13,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3439646] [2022-11-20 12:03:13,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:13,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:03:13,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:03:13,389 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:03:13,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:03:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:13,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-20 12:03:13,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:03:13,816 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 12:03:13,817 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 19 treesize of output 26 [2022-11-20 12:03:13,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:03:13,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:03:13,980 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 12:03:13,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2022-11-20 12:03:13,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 12:03:14,632 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:03:14,633 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 59 treesize of output 59 [2022-11-20 12:03:15,247 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-20 12:03:15,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 60 [2022-11-20 12:03:15,348 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-20 12:03:15,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:03:15,813 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 230 treesize of output 222 [2022-11-20 12:03:16,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:03:16,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:03:16,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 49 [2022-11-20 12:03:16,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:03:16,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 53 treesize of output 207 [2022-11-20 12:03:19,610 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-20 12:03:19,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3439646] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:03:19,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:03:19,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 32 [2022-11-20 12:03:19,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078743479] [2022-11-20 12:03:19,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:03:19,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 12:03:19,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:19,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 12:03:19,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=908, Unknown=3, NotChecked=0, Total=1056 [2022-11-20 12:03:19,615 INFO L87 Difference]: Start difference. First operand 196 states and 211 transitions. Second operand has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 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-20 12:03:21,338 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse1 (= (select |c_#valid| .cse0) 1)) (.cse3 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse4 (= .cse0 |c_ULTIMATE.start_main_~item~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_#t~mem20#1.base|) 1) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse0))) (or (and (not (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)) .cse1 (exists ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (and (<= 0 |ULTIMATE.start_main_~item~0#1.offset|) (= (select .cse2 |ULTIMATE.start_main_~item~0#1.offset|) 0)))) (and (exists ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (and (not (= |c_ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~item~0#1.offset|)) (<= 0 |ULTIMATE.start_main_~item~0#1.offset|) (= (select .cse2 |ULTIMATE.start_main_~item~0#1.offset|) 0))) .cse1))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (or (and (= |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) .cse3) .cse4) (<= 0 |c_ULTIMATE.start_main_~item~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1) .cse1 (not .cse3) .cse4))) is different from true [2022-11-20 12:03:22,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:22,467 INFO L93 Difference]: Finished difference Result 347 states and 376 transitions. [2022-11-20 12:03:22,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 12:03:22,468 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 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 43 [2022-11-20 12:03:22,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:22,469 INFO L225 Difference]: With dead ends: 347 [2022-11-20 12:03:22,469 INFO L226 Difference]: Without dead ends: 347 [2022-11-20 12:03:22,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=542, Invalid=2110, Unknown=4, NotChecked=100, Total=2756 [2022-11-20 12:03:22,471 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 441 mSDsluCounter, 2118 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 394 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:22,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 2281 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1426 Invalid, 0 Unknown, 394 Unchecked, 1.2s Time] [2022-11-20 12:03:22,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-11-20 12:03:22,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 207. [2022-11-20 12:03:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 175 states have (on average 1.2914285714285714) internal successors, (226), 206 states have internal predecessors, (226), 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-20 12:03:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 226 transitions. [2022-11-20 12:03:22,478 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 226 transitions. Word has length 43 [2022-11-20 12:03:22,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:22,478 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 226 transitions. [2022-11-20 12:03:22,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 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-20 12:03:22,479 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 226 transitions. [2022-11-20 12:03:22,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 12:03:22,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:22,480 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:22,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:03:22,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:03:22,687 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:03:22,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:22,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1598443619, now seen corresponding path program 1 times [2022-11-20 12:03:22,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:22,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550041515] [2022-11-20 12:03:22,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:22,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:23,657 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-20 12:03:23,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:23,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550041515] [2022-11-20 12:03:23,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550041515] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:03:23,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645363695] [2022-11-20 12:03:23,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:23,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:03:23,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:03:23,663 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:03:23,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 12:03:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:23,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-20 12:03:23,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:03:23,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 12:03:23,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 12:03:23,980 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:03:23,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 12:03:24,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:03:24,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:03:24,224 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:03:24,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-20 12:03:24,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 18 treesize of output 20 [2022-11-20 12:03:24,400 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 12:03:24,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 12:03:24,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 12:03:24,431 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:03:24,432 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 29 [2022-11-20 12:03:24,518 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:03:24,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-20 12:03:24,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 12:03:24,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 12:03:24,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 12:03:24,901 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-20 12:03:24,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:03:25,351 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_751 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-11-20 12:03:25,367 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_752) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_751 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))))) is different from false [2022-11-20 12:03:25,399 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_751 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_747) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_748) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_748))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_747) .cse0 v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_752) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2022-11-20 12:03:25,421 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_751 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_747) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_748) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_748))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_747) .cse1 v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_752) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2022-11-20 12:03:25,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:03:25,448 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 38 treesize of output 39 [2022-11-20 12:03:25,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:03:25,457 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 30 treesize of output 31 [2022-11-20 12:03:25,464 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 54 treesize of output 46 [2022-11-20 12:03:25,476 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:03:25,477 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 112 treesize of output 111 [2022-11-20 12:03:25,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 68 treesize of output 60 [2022-11-20 12:03:25,491 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 88 treesize of output 82 [2022-11-20 12:03:25,498 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 56 treesize of output 54 [2022-11-20 12:03:25,573 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:03:25,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2022-11-20 12:03:25,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:03:25,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2022-11-20 12:03:25,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:03:25,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:03:25,594 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 74 treesize of output 50 [2022-11-20 12:03:25,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:03:25,601 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 42 treesize of output 30 [2022-11-20 12:03:25,840 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-20 12:03:25,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645363695] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:03:25,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:03:25,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 35 [2022-11-20 12:03:25,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176286963] [2022-11-20 12:03:25,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:03:25,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 12:03:25,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:25,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 12:03:25,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=881, Unknown=11, NotChecked=252, Total=1260 [2022-11-20 12:03:25,843 INFO L87 Difference]: Start difference. First operand 207 states and 226 transitions. Second operand has 36 states, 35 states have (on average 3.6285714285714286) internal successors, (127), 36 states have internal predecessors, (127), 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-20 12:03:37,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:37,701 INFO L93 Difference]: Finished difference Result 341 states and 368 transitions. [2022-11-20 12:03:37,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-20 12:03:37,702 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.6285714285714286) internal successors, (127), 36 states have internal predecessors, (127), 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 43 [2022-11-20 12:03:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:37,704 INFO L225 Difference]: With dead ends: 341 [2022-11-20 12:03:37,705 INFO L226 Difference]: Without dead ends: 341 [2022-11-20 12:03:37,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=463, Invalid=2844, Unknown=15, NotChecked=460, Total=3782 [2022-11-20 12:03:37,707 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 517 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 994 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:37,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1505 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1349 Invalid, 0 Unknown, 994 Unchecked, 3.5s Time] [2022-11-20 12:03:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-11-20 12:03:37,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 211. [2022-11-20 12:03:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 179 states have (on average 1.2849162011173185) internal successors, (230), 210 states have internal predecessors, (230), 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-20 12:03:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 230 transitions. [2022-11-20 12:03:37,714 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 230 transitions. Word has length 43 [2022-11-20 12:03:37,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:37,715 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 230 transitions. [2022-11-20 12:03:37,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.6285714285714286) internal successors, (127), 36 states have internal predecessors, (127), 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-20 12:03:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 230 transitions. [2022-11-20 12:03:37,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-20 12:03:37,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:37,716 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:37,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 12:03:37,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:03:37,923 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:03:37,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:37,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1987856737, now seen corresponding path program 1 times [2022-11-20 12:03:37,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:37,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781989469] [2022-11-20 12:03:37,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:37,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:03:38,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:38,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781989469] [2022-11-20 12:03:38,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781989469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:38,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:38,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:03:38,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500846747] [2022-11-20 12:03:38,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:38,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:03:38,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:38,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:03:38,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:03:38,014 INFO L87 Difference]: Start difference. First operand 211 states and 230 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-20 12:03:38,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:38,040 INFO L93 Difference]: Finished difference Result 212 states and 230 transitions. [2022-11-20 12:03:38,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:03:38,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 44 [2022-11-20 12:03:38,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:38,042 INFO L225 Difference]: With dead ends: 212 [2022-11-20 12:03:38,042 INFO L226 Difference]: Without dead ends: 212 [2022-11-20 12:03:38,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:03:38,044 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:38,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:03:38,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-20 12:03:38,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-11-20 12:03:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 180 states have (on average 1.2777777777777777) internal successors, (230), 211 states have internal predecessors, (230), 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-20 12:03:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 230 transitions. [2022-11-20 12:03:38,051 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 230 transitions. Word has length 44 [2022-11-20 12:03:38,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:38,051 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 230 transitions. [2022-11-20 12:03:38,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-20 12:03:38,054 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 230 transitions. [2022-11-20 12:03:38,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 12:03:38,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:38,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:38,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 12:03:38,055 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:03:38,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:38,056 INFO L85 PathProgramCache]: Analyzing trace with hash 931768708, now seen corresponding path program 1 times [2022-11-20 12:03:38,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:38,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960744676] [2022-11-20 12:03:38,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:38,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:41,312 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-20 12:03:41,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:41,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960744676] [2022-11-20 12:03:41,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960744676] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:03:41,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710152932] [2022-11-20 12:03:41,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:41,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:03:41,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:03:41,316 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:03:41,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 12:03:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:41,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-20 12:03:41,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:03:42,165 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 12:03:42,165 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 19 treesize of output 26 [2022-11-20 12:03:42,249 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 12:03:42,250 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 19 treesize of output 18 [2022-11-20 12:03:42,623 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-20 12:03:42,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 84 [2022-11-20 12:03:42,646 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 17 treesize of output 13 [2022-11-20 12:03:42,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:03:42,679 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-20 12:03:42,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 50 [2022-11-20 12:03:44,474 INFO L321 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-11-20 12:03:44,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 60 [2022-11-20 12:03:44,486 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 12:03:44,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 40 [2022-11-20 12:03:44,969 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-20 12:03:45,085 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-20 12:03:45,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:03:46,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 114 treesize of output 80 [2022-11-20 12:03:47,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:03:47,734 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 679 treesize of output 515 [2022-11-20 12:03:47,812 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:03:47,812 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 1097 treesize of output 768 [2022-11-20 12:03:48,901 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-20 12:03:48,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710152932] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:03:48,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:03:48,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 14] total 42 [2022-11-20 12:03:48,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646424489] [2022-11-20 12:03:48,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:03:48,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-20 12:03:48,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:48,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-20 12:03:48,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1547, Unknown=0, NotChecked=0, Total=1722 [2022-11-20 12:03:48,904 INFO L87 Difference]: Start difference. First operand 212 states and 230 transitions. Second operand has 42 states, 42 states have (on average 3.119047619047619) internal successors, (131), 42 states have internal predecessors, (131), 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-20 12:04:02,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:02,994 INFO L93 Difference]: Finished difference Result 343 states and 368 transitions. [2022-11-20 12:04:02,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-20 12:04:02,995 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.119047619047619) internal successors, (131), 42 states have internal predecessors, (131), 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 46 [2022-11-20 12:04:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:02,997 INFO L225 Difference]: With dead ends: 343 [2022-11-20 12:04:02,997 INFO L226 Difference]: Without dead ends: 343 [2022-11-20 12:04:03,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=879, Invalid=4671, Unknown=0, NotChecked=0, Total=5550 [2022-11-20 12:04:03,002 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1230 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 2211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:04:03,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 1533 Invalid, 2211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1894 Invalid, 0 Unknown, 220 Unchecked, 5.0s Time] [2022-11-20 12:04:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-11-20 12:04:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 211. [2022-11-20 12:04:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 179 states have (on average 1.2737430167597765) internal successors, (228), 210 states have internal predecessors, (228), 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-20 12:04:03,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 228 transitions. [2022-11-20 12:04:03,009 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 228 transitions. Word has length 46 [2022-11-20 12:04:03,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:03,009 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 228 transitions. [2022-11-20 12:04:03,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.119047619047619) internal successors, (131), 42 states have internal predecessors, (131), 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-20 12:04:03,010 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 228 transitions. [2022-11-20 12:04:03,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 12:04:03,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:03,011 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:04:03,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-20 12:04:03,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:04:03,218 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:04:03,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:03,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1102971968, now seen corresponding path program 1 times [2022-11-20 12:04:03,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:03,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22534483] [2022-11-20 12:04:03,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:03,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:04:04,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:04,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22534483] [2022-11-20 12:04:04,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22534483] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:04:04,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302117466] [2022-11-20 12:04:04,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:04,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:04:04,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:04:04,537 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:04:04,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 12:04:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:04,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-20 12:04:04,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:04:04,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 12:04:05,129 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 12:04:05,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 12:04:05,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:04:05,782 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:04:05,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-20 12:04:06,191 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:04:06,192 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 29 [2022-11-20 12:04:06,294 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:04:06,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-20 12:04:07,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 12:04:07,329 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 17 treesize of output 17 [2022-11-20 12:04:07,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:04:07,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:04:07,803 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1001 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1001) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_1001 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1001) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) is different from false [2022-11-20 12:04:07,854 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1001 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1001) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (forall ((v_ArrVal_1001 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1001) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-11-20 12:04:08,079 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_1001 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_999))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1001)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_1001 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_999))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1001)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-11-20 12:04:08,369 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:08,370 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 38 treesize of output 31 [2022-11-20 12:04:08,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:08,397 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 252 treesize of output 227 [2022-11-20 12:04:08,408 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 212 treesize of output 204 [2022-11-20 12:04:08,437 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:08,438 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 204 treesize of output 196 [2022-11-20 12:04:09,656 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:09,657 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 37 treesize of output 30 [2022-11-20 12:04:09,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:09,700 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 141 treesize of output 128 [2022-11-20 12:04:09,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:09,732 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 112 treesize of output 111 [2022-11-20 12:04:09,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 102 treesize of output 98 [2022-11-20 12:04:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:04:10,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302117466] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:04:10,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:04:10,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 31 [2022-11-20 12:04:10,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118738023] [2022-11-20 12:04:10,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:04:10,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-20 12:04:10,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:10,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 12:04:10,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=646, Unknown=22, NotChecked=168, Total=992 [2022-11-20 12:04:10,326 INFO L87 Difference]: Start difference. First operand 211 states and 228 transitions. Second operand has 32 states, 31 states have (on average 3.5483870967741935) internal successors, (110), 32 states have internal predecessors, (110), 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-20 12:04:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:12,691 INFO L93 Difference]: Finished difference Result 260 states and 281 transitions. [2022-11-20 12:04:12,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 12:04:12,692 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.5483870967741935) internal successors, (110), 32 states have internal predecessors, (110), 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 48 [2022-11-20 12:04:12,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:12,693 INFO L225 Difference]: With dead ends: 260 [2022-11-20 12:04:12,694 INFO L226 Difference]: Without dead ends: 260 [2022-11-20 12:04:12,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=223, Invalid=889, Unknown=22, NotChecked=198, Total=1332 [2022-11-20 12:04:12,700 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 447 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 703 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 12:04:12,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 895 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 708 Invalid, 0 Unknown, 703 Unchecked, 1.8s Time] [2022-11-20 12:04:12,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-20 12:04:12,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2022-11-20 12:04:12,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 202 states have (on average 1.297029702970297) internal successors, (262), 233 states have internal predecessors, (262), 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-20 12:04:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 262 transitions. [2022-11-20 12:04:12,711 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 262 transitions. Word has length 48 [2022-11-20 12:04:12,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:12,711 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 262 transitions. [2022-11-20 12:04:12,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.5483870967741935) internal successors, (110), 32 states have internal predecessors, (110), 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-20 12:04:12,715 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 262 transitions. [2022-11-20 12:04:12,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 12:04:12,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:12,716 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:04:12,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 12:04:12,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-20 12:04:12,924 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:04:12,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:12,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1102971969, now seen corresponding path program 1 times [2022-11-20 12:04:12,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:12,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154316066] [2022-11-20 12:04:12,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:12,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:14,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:04:14,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:14,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154316066] [2022-11-20 12:04:14,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154316066] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:04:14,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688192849] [2022-11-20 12:04:14,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:14,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:04:14,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:04:14,191 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:04:14,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 12:04:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:14,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-20 12:04:14,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:04:14,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 12:04:14,666 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:04:14,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 12:04:14,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 12:04:14,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:04:14,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:04:15,157 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:04:15,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-20 12:04:15,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 12:04:15,553 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 12:04:15,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 12:04:15,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 12:04:15,607 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:04:15,607 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 29 [2022-11-20 12:04:15,778 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:04:15,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-20 12:04:15,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 12:04:16,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 12:04:16,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 12:04:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:04:16,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:04:17,394 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1108) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1107 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-11-20 12:04:17,454 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1108) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1107 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-11-20 12:04:17,482 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1108) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1107 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-11-20 12:04:17,531 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1104))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1103) .cse0 v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1108) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1103) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-11-20 12:04:17,565 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1104))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1103) .cse1 v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1108) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1103) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1104) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-11-20 12:04:17,637 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:17,637 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 73 treesize of output 74 [2022-11-20 12:04:17,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:17,654 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 65 treesize of output 50 [2022-11-20 12:04:17,695 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:17,695 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 632 treesize of output 567 [2022-11-20 12:04:17,757 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:17,758 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 1872 treesize of output 1783 [2022-11-20 12:04:17,799 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 1768 treesize of output 1736 [2022-11-20 12:04:17,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1736 treesize of output 1656 [2022-11-20 12:04:17,847 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 1656 treesize of output 1576 [2022-11-20 12:04:17,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:17,890 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 1576 treesize of output 1436 [2022-11-20 12:04:25,138 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:25,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-20 12:04:25,157 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:25,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-20 12:04:25,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:04:25,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-11-20 12:04:25,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:04:25,178 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 16 treesize of output 8 [2022-11-20 12:04:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:04:25,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688192849] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:04:25,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:04:25,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-11-20 12:04:25,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494437108] [2022-11-20 12:04:25,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:04:25,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 12:04:25,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:25,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 12:04:25,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=668, Unknown=5, NotChecked=280, Total=1056 [2022-11-20 12:04:25,629 INFO L87 Difference]: Start difference. First operand 234 states and 262 transitions. Second operand has 33 states, 32 states have (on average 4.4375) internal successors, (142), 33 states have internal predecessors, (142), 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-20 12:04:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:29,773 INFO L93 Difference]: Finished difference Result 258 states and 280 transitions. [2022-11-20 12:04:29,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 12:04:29,774 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.4375) internal successors, (142), 33 states have internal predecessors, (142), 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 48 [2022-11-20 12:04:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:29,775 INFO L225 Difference]: With dead ends: 258 [2022-11-20 12:04:29,775 INFO L226 Difference]: Without dead ends: 258 [2022-11-20 12:04:29,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=321, Invalid=1416, Unknown=5, NotChecked=420, Total=2162 [2022-11-20 12:04:29,777 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 435 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 761 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:04:29,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1283 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 897 Invalid, 0 Unknown, 761 Unchecked, 2.1s Time] [2022-11-20 12:04:29,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-20 12:04:29,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 234. [2022-11-20 12:04:29,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 202 states have (on average 1.2920792079207921) internal successors, (261), 233 states have internal predecessors, (261), 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-20 12:04:29,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 261 transitions. [2022-11-20 12:04:29,784 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 261 transitions. Word has length 48 [2022-11-20 12:04:29,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:29,784 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 261 transitions. [2022-11-20 12:04:29,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.4375) internal successors, (142), 33 states have internal predecessors, (142), 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-20 12:04:29,785 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 261 transitions. [2022-11-20 12:04:29,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-20 12:04:29,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:29,786 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:04:29,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-20 12:04:29,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-20 12:04:29,992 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:04:29,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:29,993 INFO L85 PathProgramCache]: Analyzing trace with hash 533456103, now seen corresponding path program 1 times [2022-11-20 12:04:29,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:29,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44262948] [2022-11-20 12:04:29,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:29,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:04:30,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:30,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44262948] [2022-11-20 12:04:30,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44262948] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:04:30,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374210194] [2022-11-20 12:04:30,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:30,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:04:30,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:04:30,279 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:04:30,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 12:04:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:30,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 12:04:30,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:04:30,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-11-20 12:04:30,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 21 treesize of output 13 [2022-11-20 12:04:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:04:30,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:04:30,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374210194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:04:30,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:04:30,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 9 [2022-11-20 12:04:30,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094633016] [2022-11-20 12:04:30,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:04:30,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:04:30,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:30,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:04:30,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:04:30,759 INFO L87 Difference]: Start difference. First operand 234 states and 261 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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-20 12:04:31,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:31,525 INFO L93 Difference]: Finished difference Result 283 states and 316 transitions. [2022-11-20 12:04:31,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:04:31,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 49 [2022-11-20 12:04:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:31,527 INFO L225 Difference]: With dead ends: 283 [2022-11-20 12:04:31,528 INFO L226 Difference]: Without dead ends: 283 [2022-11-20 12:04:31,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:04:31,528 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 155 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:04:31,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 607 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:04:31,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-11-20 12:04:31,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 238. [2022-11-20 12:04:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 206 states have (on average 1.2815533980582525) internal successors, (264), 237 states have internal predecessors, (264), 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-20 12:04:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 264 transitions. [2022-11-20 12:04:31,538 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 264 transitions. Word has length 49 [2022-11-20 12:04:31,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:31,539 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 264 transitions. [2022-11-20 12:04:31,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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-20 12:04:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 264 transitions. [2022-11-20 12:04:31,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-20 12:04:31,540 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:31,540 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:04:31,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-20 12:04:31,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 12:04:31,747 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:04:31,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:31,748 INFO L85 PathProgramCache]: Analyzing trace with hash -167608475, now seen corresponding path program 1 times [2022-11-20 12:04:31,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:31,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373109580] [2022-11-20 12:04:31,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:31,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:04:31,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:31,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373109580] [2022-11-20 12:04:31,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373109580] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:04:31,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367446605] [2022-11-20 12:04:31,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:31,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:04:31,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:04:31,992 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:04:31,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 12:04:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:32,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 12:04:32,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:04:32,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-11-20 12:04:32,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 12:04:32,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:04:32,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:04:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:04:32,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367446605] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:04:32,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:04:32,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-11-20 12:04:32,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851263698] [2022-11-20 12:04:32,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:04:32,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:04:32,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:32,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:04:32,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:04:32,598 INFO L87 Difference]: Start difference. First operand 238 states and 264 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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-20 12:04:33,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:33,058 INFO L93 Difference]: Finished difference Result 266 states and 295 transitions. [2022-11-20 12:04:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:04:33,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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 49 [2022-11-20 12:04:33,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:33,059 INFO L225 Difference]: With dead ends: 266 [2022-11-20 12:04:33,060 INFO L226 Difference]: Without dead ends: 266 [2022-11-20 12:04:33,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:04:33,060 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 198 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:04:33,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 431 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:04:33,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-20 12:04:33,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 260. [2022-11-20 12:04:33,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 228 states have (on average 1.2894736842105263) internal successors, (294), 259 states have internal predecessors, (294), 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-20 12:04:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 294 transitions. [2022-11-20 12:04:33,069 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 294 transitions. Word has length 49 [2022-11-20 12:04:33,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:33,069 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 294 transitions. [2022-11-20 12:04:33,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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-20 12:04:33,070 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 294 transitions. [2022-11-20 12:04:33,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 12:04:33,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:33,071 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:04:33,078 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 12:04:33,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-20 12:04:33,277 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:04:33,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:33,278 INFO L85 PathProgramCache]: Analyzing trace with hash -900848288, now seen corresponding path program 1 times [2022-11-20 12:04:33,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:33,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215543318] [2022-11-20 12:04:33,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:33,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:04:34,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:34,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215543318] [2022-11-20 12:04:34,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215543318] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:04:34,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258196604] [2022-11-20 12:04:34,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:34,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:04:34,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:04:34,196 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:04:34,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 12:04:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:34,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-20 12:04:34,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:04:34,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 12:04:34,651 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:04:34,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 12:04:34,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:04:34,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:04:35,083 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:04:35,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-20 12:04:35,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 12:04:35,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-20 12:04:35,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 12:04:35,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 12:04:35,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-20 12:04:35,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:04:35,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:04:35,997 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1399 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1399) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2022-11-20 12:04:36,126 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1399 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1399) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2022-11-20 12:04:36,148 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1397 (Array Int Int)) (v_ArrVal_1396 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1397) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1399) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2022-11-20 12:04:36,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:36,315 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 36 treesize of output 37 [2022-11-20 12:04:36,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:36,329 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 28 treesize of output 29 [2022-11-20 12:04:36,339 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 42 [2022-11-20 12:04:36,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:36,365 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 100 treesize of output 99 [2022-11-20 12:04:36,379 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 52 [2022-11-20 12:04:36,386 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 76 treesize of output 70 [2022-11-20 12:04:36,396 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 48 treesize of output 46 [2022-11-20 12:04:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:04:36,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258196604] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:04:36,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:04:36,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 27 [2022-11-20 12:04:36,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702312748] [2022-11-20 12:04:36,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:04:36,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 12:04:36,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:36,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 12:04:36,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=486, Unknown=22, NotChecked=144, Total=756 [2022-11-20 12:04:36,783 INFO L87 Difference]: Start difference. First operand 260 states and 294 transitions. Second operand has 28 states, 27 states have (on average 4.0) internal successors, (108), 28 states have internal predecessors, (108), 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-20 12:04:39,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:39,311 INFO L93 Difference]: Finished difference Result 281 states and 311 transitions. [2022-11-20 12:04:39,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 12:04:39,312 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.0) internal successors, (108), 28 states have internal predecessors, (108), 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 50 [2022-11-20 12:04:39,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:39,314 INFO L225 Difference]: With dead ends: 281 [2022-11-20 12:04:39,314 INFO L226 Difference]: Without dead ends: 281 [2022-11-20 12:04:39,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=290, Invalid=1032, Unknown=22, NotChecked=216, Total=1560 [2022-11-20 12:04:39,315 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 269 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 665 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:04:39,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 1287 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 691 Invalid, 0 Unknown, 665 Unchecked, 1.6s Time] [2022-11-20 12:04:39,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-20 12:04:39,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 262. [2022-11-20 12:04:39,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 230 states have (on average 1.2869565217391303) internal successors, (296), 261 states have internal predecessors, (296), 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-20 12:04:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 296 transitions. [2022-11-20 12:04:39,323 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 296 transitions. Word has length 50 [2022-11-20 12:04:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:39,323 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 296 transitions. [2022-11-20 12:04:39,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.0) internal successors, (108), 28 states have internal predecessors, (108), 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-20 12:04:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 296 transitions. [2022-11-20 12:04:39,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 12:04:39,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:39,325 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:04:39,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 12:04:39,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:04:39,532 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:04:39,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:39,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2138474601, now seen corresponding path program 1 times [2022-11-20 12:04:39,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:39,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474480426] [2022-11-20 12:04:39,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:39,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:04:40,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:40,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474480426] [2022-11-20 12:04:40,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474480426] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:04:40,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438179145] [2022-11-20 12:04:40,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:40,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:04:40,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:04:40,341 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:04:40,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 12:04:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:40,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 12:04:40,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:04:40,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 12:04:40,748 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:04:40,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 12:04:40,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:04:41,139 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:04:41,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-20 12:04:41,405 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:04:41,405 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 29 treesize of output 27 [2022-11-20 12:04:41,480 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:04:41,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-20 12:04:41,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-20 12:04:41,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:04:41,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:04:42,280 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1499 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1499) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-20 12:04:42,448 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1499 (Array Int Int))) (<= (+ 1 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1499) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_#StackHeapBarrier|)) is different from false [2022-11-20 12:04:42,469 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1497 (Array Int Int))) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1497))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1499)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-20 12:04:42,483 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1497 (Array Int Int))) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1497))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1499)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-20 12:04:42,505 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:42,506 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 38 treesize of output 31 [2022-11-20 12:04:42,531 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:42,532 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 252 treesize of output 227 [2022-11-20 12:04:42,561 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:42,561 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 212 treesize of output 204 [2022-11-20 12:04:42,573 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 196 treesize of output 188 [2022-11-20 12:04:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:04:43,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438179145] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:04:43,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:04:43,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 27 [2022-11-20 12:04:43,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253347443] [2022-11-20 12:04:43,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:04:43,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 12:04:43,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:43,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 12:04:43,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=469, Unknown=10, NotChecked=188, Total=756 [2022-11-20 12:04:43,216 INFO L87 Difference]: Start difference. First operand 262 states and 296 transitions. Second operand has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 28 states have internal predecessors, (109), 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-20 12:04:46,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:46,748 INFO L93 Difference]: Finished difference Result 282 states and 312 transitions. [2022-11-20 12:04:46,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 12:04:46,749 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 28 states have internal predecessors, (109), 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 51 [2022-11-20 12:04:46,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:46,750 INFO L225 Difference]: With dead ends: 282 [2022-11-20 12:04:46,751 INFO L226 Difference]: Without dead ends: 282 [2022-11-20 12:04:46,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 85 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=263, Invalid=1146, Unknown=13, NotChecked=300, Total=1722 [2022-11-20 12:04:46,752 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 280 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 790 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-20 12:04:46,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1359 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 836 Invalid, 0 Unknown, 790 Unchecked, 1.9s Time] [2022-11-20 12:04:46,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-20 12:04:46,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 263. [2022-11-20 12:04:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 231 states have (on average 1.2857142857142858) internal successors, (297), 262 states have internal predecessors, (297), 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-20 12:04:46,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 297 transitions. [2022-11-20 12:04:46,760 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 297 transitions. Word has length 51 [2022-11-20 12:04:46,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:46,760 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 297 transitions. [2022-11-20 12:04:46,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 28 states have internal predecessors, (109), 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-20 12:04:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 297 transitions. [2022-11-20 12:04:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 12:04:46,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:46,761 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:04:46,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 12:04:46,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 12:04:46,969 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:04:46,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:46,969 INFO L85 PathProgramCache]: Analyzing trace with hash -805075436, now seen corresponding path program 1 times [2022-11-20 12:04:46,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:46,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70369816] [2022-11-20 12:04:46,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:46,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 12:04:47,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:47,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70369816] [2022-11-20 12:04:47,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70369816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:04:47,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:04:47,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:04:47,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278663931] [2022-11-20 12:04:47,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:04:47,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:04:47,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:47,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:04:47,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:04:47,044 INFO L87 Difference]: Start difference. First operand 263 states and 297 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:04:47,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:47,128 INFO L93 Difference]: Finished difference Result 340 states and 380 transitions. [2022-11-20 12:04:47,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:04:47,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-20 12:04:47,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:47,130 INFO L225 Difference]: With dead ends: 340 [2022-11-20 12:04:47,130 INFO L226 Difference]: Without dead ends: 340 [2022-11-20 12:04:47,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:04:47,131 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 67 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:04:47,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 293 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:04:47,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-11-20 12:04:47,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 285. [2022-11-20 12:04:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 253 states have (on average 1.2648221343873518) internal successors, (320), 284 states have internal predecessors, (320), 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-20 12:04:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 320 transitions. [2022-11-20 12:04:47,139 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 320 transitions. Word has length 51 [2022-11-20 12:04:47,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:47,140 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 320 transitions. [2022-11-20 12:04:47,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:04:47,140 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 320 transitions. [2022-11-20 12:04:47,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 12:04:47,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:47,141 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:04:47,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-20 12:04:47,141 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:04:47,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:47,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1868203650, now seen corresponding path program 1 times [2022-11-20 12:04:47,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:47,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884663986] [2022-11-20 12:04:47,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:47,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:04:47,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:47,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884663986] [2022-11-20 12:04:47,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884663986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:04:47,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:04:47,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:04:47,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424219143] [2022-11-20 12:04:47,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:04:47,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:04:47,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:47,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:04:47,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:04:47,248 INFO L87 Difference]: Start difference. First operand 285 states and 320 transitions. Second operand has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 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-20 12:04:47,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:47,604 INFO L93 Difference]: Finished difference Result 289 states and 323 transitions. [2022-11-20 12:04:47,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:04:47,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 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 52 [2022-11-20 12:04:47,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:47,606 INFO L225 Difference]: With dead ends: 289 [2022-11-20 12:04:47,606 INFO L226 Difference]: Without dead ends: 289 [2022-11-20 12:04:47,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-20 12:04:47,607 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 165 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:04:47,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 159 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:04:47,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-20 12:04:47,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 278. [2022-11-20 12:04:47,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 247 states have (on average 1.2672064777327936) internal successors, (313), 277 states have internal predecessors, (313), 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-20 12:04:47,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 313 transitions. [2022-11-20 12:04:47,614 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 313 transitions. Word has length 52 [2022-11-20 12:04:47,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:47,614 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 313 transitions. [2022-11-20 12:04:47,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 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-20 12:04:47,614 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 313 transitions. [2022-11-20 12:04:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 12:04:47,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:47,615 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:04:47,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-20 12:04:47,616 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:04:47,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:47,616 INFO L85 PathProgramCache]: Analyzing trace with hash 455461742, now seen corresponding path program 1 times [2022-11-20 12:04:47,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:47,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795644903] [2022-11-20 12:04:47,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:47,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:04:47,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:47,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795644903] [2022-11-20 12:04:47,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795644903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:04:47,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:04:47,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:04:47,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205437933] [2022-11-20 12:04:47,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:04:47,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:04:47,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:47,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:04:47,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:04:47,723 INFO L87 Difference]: Start difference. First operand 278 states and 313 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-20 12:04:47,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:47,854 INFO L93 Difference]: Finished difference Result 295 states and 319 transitions. [2022-11-20 12:04:47,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:04:47,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2022-11-20 12:04:47,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:47,856 INFO L225 Difference]: With dead ends: 295 [2022-11-20 12:04:47,857 INFO L226 Difference]: Without dead ends: 295 [2022-11-20 12:04:47,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-20 12:04:47,857 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 49 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:04:47,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 386 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:04:47,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-20 12:04:47,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 272. [2022-11-20 12:04:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 241 states have (on average 1.2448132780082988) internal successors, (300), 271 states have internal predecessors, (300), 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-20 12:04:47,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 300 transitions. [2022-11-20 12:04:47,864 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 300 transitions. Word has length 52 [2022-11-20 12:04:47,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:47,865 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 300 transitions. [2022-11-20 12:04:47,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-20 12:04:47,865 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 300 transitions. [2022-11-20 12:04:47,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 12:04:47,866 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:47,866 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:04:47,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-20 12:04:47,867 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:04:47,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:47,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1330619915, now seen corresponding path program 1 times [2022-11-20 12:04:47,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:47,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922026288] [2022-11-20 12:04:47,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:47,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:04:50,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:50,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922026288] [2022-11-20 12:04:50,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922026288] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:04:50,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284409027] [2022-11-20 12:04:50,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:50,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:04:50,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:04:50,777 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:04:50,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 12:04:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:50,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-20 12:04:50,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:04:50,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 12:04:51,104 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:04:51,104 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 11 treesize of output 11 [2022-11-20 12:04:51,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:04:51,607 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:04:51,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-20 12:04:51,962 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:04:51,963 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 30 treesize of output 28 [2022-11-20 12:04:52,188 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:04:52,189 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 30 treesize of output 28 [2022-11-20 12:04:52,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:04:52,477 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-20 12:04:52,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 12:04:52,668 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 12:04:52,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2022-11-20 12:04:53,071 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 12:04:53,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 50 [2022-11-20 12:04:53,518 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 12:04:53,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 52 [2022-11-20 12:04:53,707 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 12:04:53,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 52 [2022-11-20 12:04:54,305 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 12:04:54,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2022-11-20 12:04:54,313 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:04:54,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:04:54,566 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1819 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1819) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-20 12:04:54,579 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1819 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1819) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-20 12:04:54,949 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1819 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_1817 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1817))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1819)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-20 12:04:55,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:55,226 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-20 12:04:55,249 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_1819 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_1817 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_15 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_15) .cse1 v_ArrVal_1817))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1819)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select |c_#valid| .cse1) 0))))) is different from false [2022-11-20 12:04:56,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:56,332 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 120 treesize of output 80 [2022-11-20 12:04:56,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:56,385 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 18117 treesize of output 14488 [2022-11-20 12:04:56,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:56,659 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 14473 treesize of output 14247 [2022-11-20 12:04:56,807 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:56,808 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 14225 treesize of output 12143 [2022-11-20 12:04:56,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:04:56,968 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 12128 treesize of output 11421 [2022-11-20 12:04:57,111 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 11412 treesize of output 10836 [2022-11-20 12:04:57,473 INFO L321 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2022-11-20 12:04:57,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61 [2022-11-20 12:04:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-20 12:04:59,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284409027] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:04:59,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:04:59,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 20] total 51 [2022-11-20 12:04:59,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82289739] [2022-11-20 12:04:59,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:04:59,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-20 12:04:59,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:59,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-20 12:04:59,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1899, Unknown=35, NotChecked=372, Total=2550 [2022-11-20 12:04:59,812 INFO L87 Difference]: Start difference. First operand 272 states and 300 transitions. Second operand has 51 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 51 states have internal predecessors, (136), 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-20 12:05:03,339 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_main_~status~0#1| 0)) (.cse2 (= |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse0 (not (= .cse4 0))) (.cse3 (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~status~0#1|)) (.cse5 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_main_~item~0#1.offset| 0))) (and .cse0 (or .cse1 (and .cse2 (or (and .cse3 (= .cse4 |c_ULTIMATE.start_main_~item~0#1.base|)) .cse5) .cse6)) (= |c_ULTIMATE.start_main_~status~0#1| (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|)) (or .cse1 (and .cse2 (or (and .cse0 .cse3) .cse5) .cse6)) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_31| Int)) (or (forall ((v_ArrVal_1819 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_1817 (Array Int Int))) (not (= (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~malloc3#1.base_31|)) |v_ULTIMATE.start_main_#t~malloc3#1.base_31| v_ArrVal_1817))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1819)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_31|) 0))))))) is different from false [2022-11-20 12:05:06,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:05:06,711 INFO L93 Difference]: Finished difference Result 306 states and 331 transitions. [2022-11-20 12:05:06,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 12:05:06,712 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 51 states have internal predecessors, (136), 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 52 [2022-11-20 12:05:06,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:05:06,713 INFO L225 Difference]: With dead ends: 306 [2022-11-20 12:05:06,713 INFO L226 Difference]: Without dead ends: 306 [2022-11-20 12:05:06,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=579, Invalid=3565, Unknown=36, NotChecked=650, Total=4830 [2022-11-20 12:05:06,716 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 267 mSDsluCounter, 2083 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1147 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:05:06,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 2184 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1022 Invalid, 0 Unknown, 1147 Unchecked, 2.4s Time] [2022-11-20 12:05:06,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-20 12:05:06,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 298. [2022-11-20 12:05:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 267 states have (on average 1.2247191011235956) internal successors, (327), 297 states have internal predecessors, (327), 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-20 12:05:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 327 transitions. [2022-11-20 12:05:06,723 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 327 transitions. Word has length 52 [2022-11-20 12:05:06,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:05:06,723 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 327 transitions. [2022-11-20 12:05:06,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 51 states have internal predecessors, (136), 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-20 12:05:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 327 transitions. [2022-11-20 12:05:06,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-20 12:05:06,724 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:05:06,725 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:05:06,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 12:05:06,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-20 12:05:06,925 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2022-11-20 12:05:06,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:05:06,926 INFO L85 PathProgramCache]: Analyzing trace with hash 47392293, now seen corresponding path program 2 times [2022-11-20 12:05:06,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:05:06,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285345891] [2022-11-20 12:05:06,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:05:06,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:05:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:08,744 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:05:08,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:05:08,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285345891] [2022-11-20 12:05:08,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285345891] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:05:08,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540966205] [2022-11-20 12:05:08,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:05:08,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:05:08,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:05:08,747 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:05:08,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca83570c-b381-4765-a5af-ef1c63978106/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 12:05:08,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:05:08,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:05:08,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-20 12:05:08,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:05:09,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 12:05:09,288 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:05:09,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 12:05:09,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:05:09,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:05:09,801 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:05:09,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-20 12:05:09,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 12:05:10,162 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 12:05:10,163 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 27 treesize of output 22 [2022-11-20 12:05:10,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-20 12:05:10,373 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 12:05:10,374 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 1 case distinctions, treesize of input 69 treesize of output 50 [2022-11-20 12:05:10,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-11-20 12:05:11,819 INFO L321 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2022-11-20 12:05:11,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 36 [2022-11-20 12:05:11,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:05:11,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2022-11-20 12:05:12,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:05:12,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:05:31,045 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int)) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int)) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1922))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1921))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse3 (+ .cse2 8))) (select (store .cse0 .cse1 (store (store (select .cse0 .cse1) .cse2 0) .cse3 v_ArrVal_1928)) (select (select (store .cse4 .cse1 (store (store (select .cse4 .cse1) .cse2 0) .cse3 v_ArrVal_1930)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) 0) 0)) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int)) (v_ArrVal_1930 Int)) (= (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1921))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store .cse6 .cse7 (let ((.cse8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1922) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store (store (select .cse6 .cse7) .cse8 0) (+ .cse8 8) v_ArrVal_1930))))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0) 0))) is different from false [2022-11-20 12:05:31,091 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int)) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int)) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1922))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse4 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1921))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse3 (+ 8 .cse2))) (select (store .cse0 .cse1 (store (store (select .cse0 .cse1) .cse2 0) .cse3 v_ArrVal_1928)) (select (select (store .cse4 .cse1 (store (store (select .cse4 .cse1) .cse2 0) .cse3 v_ArrVal_1930)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) 0) 0)) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int)) (v_ArrVal_1930 Int)) (= (select (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1921))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store .cse7 .cse8 (let ((.cse9 (select (select (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1922) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store (store (select .cse7 .cse8) .cse9 0) (+ 8 .cse9) v_ArrVal_1930))))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0) 0)))) is different from false [2022-11-20 12:05:31,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:05:31,140 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 201 treesize of output 162 [2022-11-20 12:05:31,156 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:05:31,157 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 153 treesize of output 114 [2022-11-20 12:05:31,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:05:31,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1216 treesize of output 1194 [2022-11-20 12:05:31,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:05:33,064 INFO L321 Elim1Store]: treesize reduction 330, result has 58.4 percent of original size [2022-11-20 12:05:33,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 13 new quantified variables, introduced 45 case distinctions, treesize of input 13416 treesize of output 12018 [2022-11-20 12:05:33,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:05:33,374 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 20112 treesize of output 18276 [2022-11-20 12:05:34,430 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:05:34,431 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 22120 treesize of output 20910 [2022-11-20 12:05:42,374 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-20 12:07:07,665 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 5842 treesize of output 5700