./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:53:07,779 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:53:07,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:53:07,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:53:07,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:53:07,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:53:07,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:53:07,856 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:53:07,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:53:07,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:53:07,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:53:07,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:53:07,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:53:07,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:53:07,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:53:07,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:53:07,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:53:07,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:53:07,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:53:07,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:53:07,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:53:07,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:53:07,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:53:07,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:53:07,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:53:07,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:53:07,921 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:53:07,923 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:53:07,924 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:53:07,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:53:07,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:53:07,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:53:07,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:53:07,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:53:07,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:53:07,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:53:07,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:53:07,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:53:07,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:53:07,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:53:07,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:53:07,940 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-03 01:53:07,991 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:53:07,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:53:07,992 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:53:07,992 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:53:07,993 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:53:07,994 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:53:07,994 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:53:07,994 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:53:07,994 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:53:07,995 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:53:07,996 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:53:07,996 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:53:07,997 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:53:07,997 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:53:07,997 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:53:07,998 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:53:07,998 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:53:07,998 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:53:07,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 01:53:07,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 01:53:08,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:53:08,001 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:53:08,001 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 01:53:08,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:53:08,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:53:08,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:53:08,002 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 01:53:08,003 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 01:53:08,003 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 01:53:08,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:53:08,004 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 01:53:08,004 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:53:08,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:53:08,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:53:08,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:53:08,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:53:08,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:53:08,006 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:53:08,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:53:08,006 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:53:08,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:53:08,007 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:53:08,007 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_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/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_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI 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 -> Taipan 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 -> 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b [2022-11-03 01:53:08,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:53:08,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:53:08,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:53:08,451 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:53:08,453 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:53:08,454 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2022-11-03 01:53:08,542 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/data/c92093bd5/b01f9473ce2b4b14bbaf0f5f9f4670de/FLAG57152ec64 [2022-11-03 01:53:09,335 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:53:09,336 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2022-11-03 01:53:09,358 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/data/c92093bd5/b01f9473ce2b4b14bbaf0f5f9f4670de/FLAG57152ec64 [2022-11-03 01:53:09,565 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/data/c92093bd5/b01f9473ce2b4b14bbaf0f5f9f4670de [2022-11-03 01:53:09,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:53:09,573 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:53:09,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:53:09,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:53:09,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:53:09,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:53:09" (1/1) ... [2022-11-03 01:53:09,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dfb546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:09, skipping insertion in model container [2022-11-03 01:53:09,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:53:09" (1/1) ... [2022-11-03 01:53:09,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:53:09,665 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:53:10,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22673,22686] [2022-11-03 01:53:10,186 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22743,22756] [2022-11-03 01:53:10,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22807,22820] [2022-11-03 01:53:10,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22902,22915] [2022-11-03 01:53:10,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22974,22987] [2022-11-03 01:53:10,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23113,23126] [2022-11-03 01:53:10,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23187,23200] [2022-11-03 01:53:10,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:53:10,232 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:53:10,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22673,22686] [2022-11-03 01:53:10,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22743,22756] [2022-11-03 01:53:10,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22807,22820] [2022-11-03 01:53:10,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22902,22915] [2022-11-03 01:53:10,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22974,22987] [2022-11-03 01:53:10,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23113,23126] [2022-11-03 01:53:10,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23187,23200] [2022-11-03 01:53:10,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:53:10,330 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:53:10,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:10 WrapperNode [2022-11-03 01:53:10,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:53:10,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:53:10,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:53:10,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:53:10,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:10" (1/1) ... [2022-11-03 01:53:10,359 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:10" (1/1) ... [2022-11-03 01:53:10,388 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 169 [2022-11-03 01:53:10,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:53:10,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:53:10,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:53:10,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:53:10,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:10" (1/1) ... [2022-11-03 01:53:10,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:10" (1/1) ... [2022-11-03 01:53:10,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:10" (1/1) ... [2022-11-03 01:53:10,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:10" (1/1) ... [2022-11-03 01:53:10,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:10" (1/1) ... [2022-11-03 01:53:10,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:10" (1/1) ... [2022-11-03 01:53:10,431 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:10" (1/1) ... [2022-11-03 01:53:10,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:10" (1/1) ... [2022-11-03 01:53:10,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:53:10,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:53:10,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:53:10,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:53:10,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:10" (1/1) ... [2022-11-03 01:53:10,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:53:10,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:10,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:53:10,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:53:10,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 01:53:10,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 01:53:10,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 01:53:10,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:53:10,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 01:53:10,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 01:53:10,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:53:10,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:53:10,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:53:10,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:53:10,728 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:53:10,731 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:53:11,423 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:53:11,485 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:53:11,486 INFO L300 CfgBuilder]: Removed 17 assume(true) statements. [2022-11-03 01:53:11,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:53:11 BoogieIcfgContainer [2022-11-03 01:53:11,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:53:11,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:53:11,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:53:11,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:53:11,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:53:09" (1/3) ... [2022-11-03 01:53:11,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ffdfe28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:53:11, skipping insertion in model container [2022-11-03 01:53:11,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:10" (2/3) ... [2022-11-03 01:53:11,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ffdfe28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:53:11, skipping insertion in model container [2022-11-03 01:53:11,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:53:11" (3/3) ... [2022-11-03 01:53:11,500 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2022-11-03 01:53:11,518 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:53:11,519 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-11-03 01:53:11,574 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:53:11,582 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;@3a2e7536, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:53:11,583 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-11-03 01:53:11,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 73 states have (on average 2.4794520547945207) internal successors, (181), 153 states have internal predecessors, (181), 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-03 01:53:11,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 01:53:11,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:11,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 01:53:11,597 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:11,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:11,604 INFO L85 PathProgramCache]: Analyzing trace with hash 10761, now seen corresponding path program 1 times [2022-11-03 01:53:11,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:11,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434912396] [2022-11-03 01:53:11,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:11,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:11,938 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-03 01:53:11,939 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:11,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434912396] [2022-11-03 01:53:11,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434912396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:11,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:11,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 01:53:11,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911980187] [2022-11-03 01:53:11,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:11,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:53:11,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:11,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:53:11,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:11,997 INFO L87 Difference]: Start difference. First operand has 154 states, 73 states have (on average 2.4794520547945207) internal successors, (181), 153 states have internal predecessors, (181), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03 01:53:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:12,267 INFO L93 Difference]: Finished difference Result 179 states and 186 transitions. [2022-11-03 01:53:12,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:53:12,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-03 01:53:12,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:12,282 INFO L225 Difference]: With dead ends: 179 [2022-11-03 01:53:12,282 INFO L226 Difference]: Without dead ends: 178 [2022-11-03 01:53:12,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-03 01:53:12,289 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 137 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:12,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 95 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:53:12,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-03 01:53:12,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 154. [2022-11-03 01:53:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 77 states have (on average 2.103896103896104) internal successors, (162), 153 states have internal predecessors, (162), 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-03 01:53:12,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 162 transitions. [2022-11-03 01:53:12,342 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 162 transitions. Word has length 2 [2022-11-03 01:53:12,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:12,343 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 162 transitions. [2022-11-03 01:53:12,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03 01:53:12,344 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 162 transitions. [2022-11-03 01:53:12,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 01:53:12,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:12,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 01:53:12,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:53:12,345 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:12,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:12,346 INFO L85 PathProgramCache]: Analyzing trace with hash 10762, now seen corresponding path program 1 times [2022-11-03 01:53:12,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:12,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593325652] [2022-11-03 01:53:12,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:12,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:12,467 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-03 01:53:12,467 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:12,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593325652] [2022-11-03 01:53:12,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593325652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:12,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:12,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 01:53:12,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853397163] [2022-11-03 01:53:12,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:12,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:53:12,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:12,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:53:12,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:12,472 INFO L87 Difference]: Start difference. First operand 154 states and 162 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03 01:53:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:12,688 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2022-11-03 01:53:12,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:53:12,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-03 01:53:12,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:12,690 INFO L225 Difference]: With dead ends: 150 [2022-11-03 01:53:12,690 INFO L226 Difference]: Without dead ends: 150 [2022-11-03 01:53:12,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-03 01:53:12,692 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 147 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:12,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 75 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:53:12,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-03 01:53:12,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-03 01:53:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 77 states have (on average 2.038961038961039) internal successors, (157), 149 states have internal predecessors, (157), 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-03 01:53:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 157 transitions. [2022-11-03 01:53:12,705 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 157 transitions. Word has length 2 [2022-11-03 01:53:12,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:12,705 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 157 transitions. [2022-11-03 01:53:12,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03 01:53:12,706 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 157 transitions. [2022-11-03 01:53:12,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 01:53:12,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:12,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 01:53:12,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:53:12,707 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:12,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:12,708 INFO L85 PathProgramCache]: Analyzing trace with hash 320566798, now seen corresponding path program 1 times [2022-11-03 01:53:12,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:12,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732282017] [2022-11-03 01:53:12,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:12,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:12,821 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-03 01:53:12,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:12,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732282017] [2022-11-03 01:53:12,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732282017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:12,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:12,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:53:12,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576785090] [2022-11-03 01:53:12,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:12,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:53:12,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:12,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:53:12,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:12,824 INFO L87 Difference]: Start difference. First operand 150 states and 157 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:13,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:13,010 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2022-11-03 01:53:13,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:53:13,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 01:53:13,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:13,017 INFO L225 Difference]: With dead ends: 146 [2022-11-03 01:53:13,017 INFO L226 Difference]: Without dead ends: 146 [2022-11-03 01:53:13,018 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-03 01:53:13,022 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 123 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:13,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 85 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:53:13,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-03 01:53:13,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2022-11-03 01:53:13,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 78 states have (on average 1.9487179487179487) internal successors, (152), 143 states have internal predecessors, (152), 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-03 01:53:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2022-11-03 01:53:13,036 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 5 [2022-11-03 01:53:13,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:13,036 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2022-11-03 01:53:13,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03 01:53:13,037 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2022-11-03 01:53:13,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 01:53:13,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:13,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 01:53:13,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 01:53:13,038 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:13,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:13,044 INFO L85 PathProgramCache]: Analyzing trace with hash 320566799, now seen corresponding path program 1 times [2022-11-03 01:53:13,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:13,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700848327] [2022-11-03 01:53:13,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:13,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:13,184 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-03 01:53:13,184 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:13,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700848327] [2022-11-03 01:53:13,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700848327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:13,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:13,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:53:13,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303727433] [2022-11-03 01:53:13,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:13,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:53:13,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:13,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:53:13,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:13,188 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:13,375 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2022-11-03 01:53:13,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:53:13,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 01:53:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:13,377 INFO L225 Difference]: With dead ends: 158 [2022-11-03 01:53:13,377 INFO L226 Difference]: Without dead ends: 158 [2022-11-03 01:53:13,377 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-03 01:53:13,379 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 120 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:13,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 93 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:53:13,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-03 01:53:13,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2022-11-03 01:53:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 83 states have (on average 1.855421686746988) internal successors, (154), 145 states have internal predecessors, (154), 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-03 01:53:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions. [2022-11-03 01:53:13,390 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 5 [2022-11-03 01:53:13,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:13,391 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions. [2022-11-03 01:53:13,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03 01:53:13,391 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions. [2022-11-03 01:53:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:53:13,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:13,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:13,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 01:53:13,393 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:13,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:13,394 INFO L85 PathProgramCache]: Analyzing trace with hash 423636449, now seen corresponding path program 1 times [2022-11-03 01:53:13,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:13,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241505837] [2022-11-03 01:53:13,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:13,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:13,650 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-03 01:53:13,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:13,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241505837] [2022-11-03 01:53:13,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241505837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:13,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:13,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:53:13,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130968059] [2022-11-03 01:53:13,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:13,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:53:13,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:13,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:53:13,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:53:13,655 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-03 01:53:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:13,906 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2022-11-03 01:53:13,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:53:13,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-03 01:53:13,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:13,908 INFO L225 Difference]: With dead ends: 144 [2022-11-03 01:53:13,908 INFO L226 Difference]: Without dead ends: 144 [2022-11-03 01:53:13,909 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-03 01:53:13,910 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 184 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:13,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 72 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:53:13,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-03 01:53:13,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 133. [2022-11-03 01:53:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 85 states have (on average 1.6823529411764706) internal successors, (143), 132 states have internal predecessors, (143), 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-03 01:53:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2022-11-03 01:53:13,920 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 10 [2022-11-03 01:53:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:13,921 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2022-11-03 01:53:13,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-03 01:53:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2022-11-03 01:53:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:53:13,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:13,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:13,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 01:53:13,923 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:13,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:13,924 INFO L85 PathProgramCache]: Analyzing trace with hash 423636450, now seen corresponding path program 1 times [2022-11-03 01:53:13,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:13,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200544317] [2022-11-03 01:53:13,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:13,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:14,213 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-03 01:53:14,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:14,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200544317] [2022-11-03 01:53:14,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200544317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:14,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:14,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:53:14,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046209783] [2022-11-03 01:53:14,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:14,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:53:14,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:14,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:53:14,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:53:14,217 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-03 01:53:14,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:14,620 INFO L93 Difference]: Finished difference Result 167 states and 177 transitions. [2022-11-03 01:53:14,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:53:14,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-03 01:53:14,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:14,622 INFO L225 Difference]: With dead ends: 167 [2022-11-03 01:53:14,622 INFO L226 Difference]: Without dead ends: 167 [2022-11-03 01:53:14,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:53:14,624 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 272 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:14,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 128 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 01:53:14,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-03 01:53:14,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 141. [2022-11-03 01:53:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 94 states have (on average 1.6382978723404256) internal successors, (154), 140 states have internal predecessors, (154), 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-03 01:53:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2022-11-03 01:53:14,632 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 10 [2022-11-03 01:53:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:14,633 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2022-11-03 01:53:14,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-03 01:53:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2022-11-03 01:53:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:53:14,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:14,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:14,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 01:53:14,635 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:14,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash -906992480, now seen corresponding path program 1 times [2022-11-03 01:53:14,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:14,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485704830] [2022-11-03 01:53:14,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:14,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:14,864 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-03 01:53:14,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:14,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485704830] [2022-11-03 01:53:14,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485704830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:14,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:14,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:53:14,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158081096] [2022-11-03 01:53:14,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:14,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:53:14,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:14,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:53:14,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:53:14,868 INFO L87 Difference]: Start difference. First operand 141 states and 154 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-03 01:53:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:15,104 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2022-11-03 01:53:15,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:53:15,106 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-03 01:53:15,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:15,107 INFO L225 Difference]: With dead ends: 140 [2022-11-03 01:53:15,107 INFO L226 Difference]: Without dead ends: 140 [2022-11-03 01:53:15,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:53:15,108 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 6 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:15,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 295 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:53:15,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-03 01:53:15,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-11-03 01:53:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 94 states have (on average 1.6170212765957446) internal successors, (152), 139 states have internal predecessors, (152), 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-03 01:53:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 152 transitions. [2022-11-03 01:53:15,122 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 152 transitions. Word has length 12 [2022-11-03 01:53:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:15,123 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 152 transitions. [2022-11-03 01:53:15,123 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-03 01:53:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2022-11-03 01:53:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:53:15,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:15,125 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:15,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 01:53:15,126 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:15,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:15,129 INFO L85 PathProgramCache]: Analyzing trace with hash -906992479, now seen corresponding path program 1 times [2022-11-03 01:53:15,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:15,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723769022] [2022-11-03 01:53:15,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:15,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:15,530 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-03 01:53:15,530 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:15,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723769022] [2022-11-03 01:53:15,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723769022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:15,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:15,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:53:15,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017622053] [2022-11-03 01:53:15,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:15,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:53:15,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:15,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:53:15,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:53:15,533 INFO L87 Difference]: Start difference. First operand 140 states and 152 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-03 01:53:15,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:15,792 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2022-11-03 01:53:15,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:53:15,793 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-03 01:53:15,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:15,794 INFO L225 Difference]: With dead ends: 139 [2022-11-03 01:53:15,795 INFO L226 Difference]: Without dead ends: 139 [2022-11-03 01:53:15,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:53:15,800 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 3 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:15,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 284 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:53:15,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-03 01:53:15,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-11-03 01:53:15,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 94 states have (on average 1.5957446808510638) internal successors, (150), 138 states have internal predecessors, (150), 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-03 01:53:15,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2022-11-03 01:53:15,813 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 12 [2022-11-03 01:53:15,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:15,813 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2022-11-03 01:53:15,814 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-03 01:53:15,814 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2022-11-03 01:53:15,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:53:15,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:15,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:15,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 01:53:15,816 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:15,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:15,818 INFO L85 PathProgramCache]: Analyzing trace with hash -907212716, now seen corresponding path program 1 times [2022-11-03 01:53:15,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:15,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710894864] [2022-11-03 01:53:15,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:15,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:15,942 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-03 01:53:15,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:15,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710894864] [2022-11-03 01:53:15,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710894864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:15,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:15,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:53:15,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027435462] [2022-11-03 01:53:15,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:15,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:53:15,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:15,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:53:15,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:53:15,946 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand has 5 states, 5 states have (on average 2.4) 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-03 01:53:16,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:16,219 INFO L93 Difference]: Finished difference Result 172 states and 182 transitions. [2022-11-03 01:53:16,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:53:16,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) 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-03 01:53:16,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:16,222 INFO L225 Difference]: With dead ends: 172 [2022-11-03 01:53:16,222 INFO L226 Difference]: Without dead ends: 172 [2022-11-03 01:53:16,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:53:16,224 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 241 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:16,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 127 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:53:16,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-03 01:53:16,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 140. [2022-11-03 01:53:16,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 96 states have (on average 1.5729166666666667) internal successors, (151), 139 states have internal predecessors, (151), 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-03 01:53:16,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2022-11-03 01:53:16,232 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 12 [2022-11-03 01:53:16,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:16,234 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2022-11-03 01:53:16,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) 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-03 01:53:16,235 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2022-11-03 01:53:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:53:16,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:16,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:16,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 01:53:16,236 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:16,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:16,237 INFO L85 PathProgramCache]: Analyzing trace with hash 258858983, now seen corresponding path program 1 times [2022-11-03 01:53:16,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:16,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449233012] [2022-11-03 01:53:16,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:16,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:16,622 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-03 01:53:16,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:16,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449233012] [2022-11-03 01:53:16,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449233012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:16,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:16,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:53:16,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643644404] [2022-11-03 01:53:16,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:16,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:53:16,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:16,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:53:16,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:53:16,626 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 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-03 01:53:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:17,057 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2022-11-03 01:53:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:53:17,058 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 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 14 [2022-11-03 01:53:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:17,059 INFO L225 Difference]: With dead ends: 139 [2022-11-03 01:53:17,059 INFO L226 Difference]: Without dead ends: 139 [2022-11-03 01:53:17,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:53:17,060 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 151 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:17,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 187 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 01:53:17,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-03 01:53:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-11-03 01:53:17,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 96 states have (on average 1.5625) internal successors, (150), 138 states have internal predecessors, (150), 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-03 01:53:17,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2022-11-03 01:53:17,066 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 14 [2022-11-03 01:53:17,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:17,067 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2022-11-03 01:53:17,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 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-03 01:53:17,067 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2022-11-03 01:53:17,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:53:17,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:17,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:17,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 01:53:17,069 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:17,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:17,070 INFO L85 PathProgramCache]: Analyzing trace with hash 258858984, now seen corresponding path program 1 times [2022-11-03 01:53:17,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:17,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817254099] [2022-11-03 01:53:17,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:17,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:17,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:17,560 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:17,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817254099] [2022-11-03 01:53:17,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817254099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:17,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:17,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 01:53:17,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9975004] [2022-11-03 01:53:17,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:17,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 01:53:17,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:17,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 01:53:17,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:53:17,563 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 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-03 01:53:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:18,097 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2022-11-03 01:53:18,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 01:53:18,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 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 14 [2022-11-03 01:53:18,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:18,098 INFO L225 Difference]: With dead ends: 154 [2022-11-03 01:53:18,098 INFO L226 Difference]: Without dead ends: 154 [2022-11-03 01:53:18,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-11-03 01:53:18,100 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 195 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:18,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 196 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:53:18,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-03 01:53:18,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2022-11-03 01:53:18,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 104 states have (on average 1.4903846153846154) internal successors, (155), 140 states have internal predecessors, (155), 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-03 01:53:18,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2022-11-03 01:53:18,104 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 14 [2022-11-03 01:53:18,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:18,104 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2022-11-03 01:53:18,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 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-03 01:53:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2022-11-03 01:53:18,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:53:18,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:18,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:18,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 01:53:18,106 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:18,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:18,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1459239985, now seen corresponding path program 1 times [2022-11-03 01:53:18,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:18,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258830695] [2022-11-03 01:53:18,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:18,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:18,437 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-03 01:53:18,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:18,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258830695] [2022-11-03 01:53:18,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258830695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:18,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:18,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:53:18,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353934278] [2022-11-03 01:53:18,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:18,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:53:18,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:18,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:53:18,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:53:18,440 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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-03 01:53:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:18,883 INFO L93 Difference]: Finished difference Result 193 states and 212 transitions. [2022-11-03 01:53:18,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:53:18,887 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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 15 [2022-11-03 01:53:18,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:18,888 INFO L225 Difference]: With dead ends: 193 [2022-11-03 01:53:18,888 INFO L226 Difference]: Without dead ends: 193 [2022-11-03 01:53:18,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:53:18,890 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 314 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:18,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 252 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 01:53:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-11-03 01:53:18,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 148. [2022-11-03 01:53:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 111 states have (on average 1.4684684684684686) internal successors, (163), 147 states have internal predecessors, (163), 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-03 01:53:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 163 transitions. [2022-11-03 01:53:18,901 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 163 transitions. Word has length 15 [2022-11-03 01:53:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:18,901 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 163 transitions. [2022-11-03 01:53:18,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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-03 01:53:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 163 transitions. [2022-11-03 01:53:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 01:53:18,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:18,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:18,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 01:53:18,903 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:18,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:18,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1897501794, now seen corresponding path program 1 times [2022-11-03 01:53:18,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:18,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101165563] [2022-11-03 01:53:18,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:18,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:19,043 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-03 01:53:19,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:19,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101165563] [2022-11-03 01:53:19,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101165563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:19,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:19,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:53:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948891225] [2022-11-03 01:53:19,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:19,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:53:19,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:19,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:53:19,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:53:19,046 INFO L87 Difference]: Start difference. First operand 148 states and 163 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-03 01:53:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:19,184 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2022-11-03 01:53:19,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:53:19,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 01:53:19,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:19,186 INFO L225 Difference]: With dead ends: 146 [2022-11-03 01:53:19,186 INFO L226 Difference]: Without dead ends: 146 [2022-11-03 01:53:19,187 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-03 01:53:19,187 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 19 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:19,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 207 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:19,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-03 01:53:19,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-11-03 01:53:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 110 states have (on average 1.4545454545454546) internal successors, (160), 145 states have internal predecessors, (160), 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-03 01:53:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 160 transitions. [2022-11-03 01:53:19,192 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 160 transitions. Word has length 19 [2022-11-03 01:53:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:19,192 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 160 transitions. [2022-11-03 01:53:19,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-03 01:53:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2022-11-03 01:53:19,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 01:53:19,193 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:19,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:19,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 01:53:19,194 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:19,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:19,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1910415876, now seen corresponding path program 1 times [2022-11-03 01:53:19,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:19,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801667895] [2022-11-03 01:53:19,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:19,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:19,361 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-03 01:53:19,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:19,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801667895] [2022-11-03 01:53:19,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801667895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:19,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:19,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:53:19,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154599171] [2022-11-03 01:53:19,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:19,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:53:19,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:19,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:53:19,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:53:19,364 INFO L87 Difference]: Start difference. First operand 146 states and 160 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-03 01:53:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:19,549 INFO L93 Difference]: Finished difference Result 145 states and 159 transitions. [2022-11-03 01:53:19,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:53:19,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 01:53:19,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:19,551 INFO L225 Difference]: With dead ends: 145 [2022-11-03 01:53:19,551 INFO L226 Difference]: Without dead ends: 145 [2022-11-03 01:53:19,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:53:19,552 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 3 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:19,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 263 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:53:19,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-03 01:53:19,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-11-03 01:53:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 110 states have (on average 1.4454545454545455) internal successors, (159), 144 states have internal predecessors, (159), 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-03 01:53:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 159 transitions. [2022-11-03 01:53:19,556 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 159 transitions. Word has length 19 [2022-11-03 01:53:19,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:19,557 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 159 transitions. [2022-11-03 01:53:19,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-03 01:53:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 159 transitions. [2022-11-03 01:53:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 01:53:19,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:19,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:19,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 01:53:19,558 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:19,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:19,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1910415877, now seen corresponding path program 1 times [2022-11-03 01:53:19,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:19,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586523953] [2022-11-03 01:53:19,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:19,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:19,961 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-03 01:53:19,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:19,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586523953] [2022-11-03 01:53:19,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586523953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:19,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:19,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:53:19,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438711648] [2022-11-03 01:53:19,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:19,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:53:19,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:19,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:53:19,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:53:19,964 INFO L87 Difference]: Start difference. First operand 145 states and 159 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-03 01:53:20,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:20,174 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2022-11-03 01:53:20,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:53:20,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 01:53:20,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:20,176 INFO L225 Difference]: With dead ends: 144 [2022-11-03 01:53:20,176 INFO L226 Difference]: Without dead ends: 144 [2022-11-03 01:53:20,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:53:20,177 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:20,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 257 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:53:20,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-03 01:53:20,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-11-03 01:53:20,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 110 states have (on average 1.4363636363636363) internal successors, (158), 143 states have internal predecessors, (158), 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-03 01:53:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2022-11-03 01:53:20,181 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 19 [2022-11-03 01:53:20,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:20,181 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2022-11-03 01:53:20,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-03 01:53:20,182 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2022-11-03 01:53:20,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 01:53:20,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:20,184 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-03 01:53:20,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 01:53:20,185 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:20,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:20,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1958872500, now seen corresponding path program 1 times [2022-11-03 01:53:20,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:20,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850942855] [2022-11-03 01:53:20,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:20,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:20,557 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-03 01:53:20,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:20,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850942855] [2022-11-03 01:53:20,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850942855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:20,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:20,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:53:20,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382878343] [2022-11-03 01:53:20,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:20,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:53:20,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:20,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:53:20,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:53:20,563 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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-03 01:53:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:20,902 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2022-11-03 01:53:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:53:20,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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-03 01:53:20,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:20,904 INFO L225 Difference]: With dead ends: 143 [2022-11-03 01:53:20,904 INFO L226 Difference]: Without dead ends: 143 [2022-11-03 01:53:20,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-03 01:53:20,905 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 48 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:20,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 257 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:53:20,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-03 01:53:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-11-03 01:53:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 110 states have (on average 1.4272727272727272) internal successors, (157), 142 states have internal predecessors, (157), 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-03 01:53:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2022-11-03 01:53:20,910 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 21 [2022-11-03 01:53:20,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:20,911 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2022-11-03 01:53:20,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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-03 01:53:20,912 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2022-11-03 01:53:20,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 01:53:20,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:20,914 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-03 01:53:20,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 01:53:20,915 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:20,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:20,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1958872501, now seen corresponding path program 1 times [2022-11-03 01:53:20,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:20,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654591279] [2022-11-03 01:53:20,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:20,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:21,440 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-03 01:53:21,441 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:21,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654591279] [2022-11-03 01:53:21,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654591279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:21,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:21,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:53:21,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031065840] [2022-11-03 01:53:21,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:21,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:53:21,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:21,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:53:21,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:53:21,443 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-03 01:53:21,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:21,851 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2022-11-03 01:53:21,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:53:21,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-03 01:53:21,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:21,853 INFO L225 Difference]: With dead ends: 141 [2022-11-03 01:53:21,853 INFO L226 Difference]: Without dead ends: 141 [2022-11-03 01:53:21,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:53:21,854 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 60 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:21,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 306 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:53:21,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-03 01:53:21,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 122. [2022-11-03 01:53:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 121 states have internal predecessors, (133), 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-03 01:53:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2022-11-03 01:53:21,857 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 21 [2022-11-03 01:53:21,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:21,858 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2022-11-03 01:53:21,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-03 01:53:21,858 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2022-11-03 01:53:21,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 01:53:21,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:21,865 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] [2022-11-03 01:53:21,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 01:53:21,866 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:21,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:21,867 INFO L85 PathProgramCache]: Analyzing trace with hash 770959303, now seen corresponding path program 1 times [2022-11-03 01:53:21,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:21,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722817797] [2022-11-03 01:53:21,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:21,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:22,242 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-03 01:53:22,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:22,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722817797] [2022-11-03 01:53:22,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722817797] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:22,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810128679] [2022-11-03 01:53:22,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:22,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:22,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:22,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:22,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:53:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:22,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 01:53:22,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:22,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:53:22,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:53:22,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:22,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:53:22,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:22,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:53:22,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:22,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:53:22,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:22,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:53:22,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:53:22,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:53:23,005 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-03 01:53:23,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:23,108 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-03 01:53:23,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810128679] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:53:23,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1523634283] [2022-11-03 01:53:23,134 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-03 01:53:23,135 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:53:23,140 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:53:23,146 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:53:23,147 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:53:23,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:53:23,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:53:23,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:53:23,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:53:23,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 01:53:23,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:53:23,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:53:23,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:53:23,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:53:23,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:53:23,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-03 01:53:23,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:53:23,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-03 01:53:23,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:53:23,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:53:23,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-11-03 01:53:23,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:53:23,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-11-03 01:53:23,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:53:23,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:23,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-11-03 01:53:24,250 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:53:27,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1523634283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:27,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:53:27,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 6, 5] total 21 [2022-11-03 01:53:27,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934355616] [2022-11-03 01:53:27,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:27,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:53:27,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:27,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:53:27,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-03 01:53:27,728 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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-03 01:53:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:28,812 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2022-11-03 01:53:28,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 01:53:28,813 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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-03 01:53:28,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:28,814 INFO L225 Difference]: With dead ends: 140 [2022-11-03 01:53:28,814 INFO L226 Difference]: Without dead ends: 140 [2022-11-03 01:53:28,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2022-11-03 01:53:28,815 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 138 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:28,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 126 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 01:53:28,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-03 01:53:28,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 103. [2022-11-03 01:53:28,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 102 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-03 01:53:28,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2022-11-03 01:53:28,819 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 21 [2022-11-03 01:53:28,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:28,819 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2022-11-03 01:53:28,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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-03 01:53:28,819 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-11-03 01:53:28,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 01:53:28,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:28,820 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] [2022-11-03 01:53:28,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:53:29,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 01:53:29,021 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:29,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:29,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1879594872, now seen corresponding path program 1 times [2022-11-03 01:53:29,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:29,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903460014] [2022-11-03 01:53:29,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:29,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:29,328 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-03 01:53:29,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:29,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903460014] [2022-11-03 01:53:29,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903460014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:29,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:29,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:53:29,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81180675] [2022-11-03 01:53:29,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:29,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:53:29,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:29,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:53:29,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:53:29,331 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:29,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:29,469 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-11-03 01:53:29,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:53:29,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-03 01:53:29,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:29,471 INFO L225 Difference]: With dead ends: 102 [2022-11-03 01:53:29,471 INFO L226 Difference]: Without dead ends: 102 [2022-11-03 01:53:29,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 01:53:29,472 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:29,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 139 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:29,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-03 01:53:29,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-11-03 01:53:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 100 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-03 01:53:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2022-11-03 01:53:29,476 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 22 [2022-11-03 01:53:29,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:29,477 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2022-11-03 01:53:29,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2022-11-03 01:53:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 01:53:29,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:29,478 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] [2022-11-03 01:53:29,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 01:53:29,478 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:29,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:29,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1890689676, now seen corresponding path program 1 times [2022-11-03 01:53:29,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:29,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359119395] [2022-11-03 01:53:29,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:29,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:29,889 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-03 01:53:29,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:29,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359119395] [2022-11-03 01:53:29,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359119395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:29,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:29,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 01:53:29,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639236734] [2022-11-03 01:53:29,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:29,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 01:53:29,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:29,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 01:53:29,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:53:29,892 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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-03 01:53:30,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:30,361 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-11-03 01:53:30,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 01:53:30,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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 24 [2022-11-03 01:53:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:30,363 INFO L225 Difference]: With dead ends: 121 [2022-11-03 01:53:30,363 INFO L226 Difference]: Without dead ends: 121 [2022-11-03 01:53:30,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2022-11-03 01:53:30,365 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 116 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:30,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 157 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:53:30,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-03 01:53:30,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 108. [2022-11-03 01:53:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 107 states have internal predecessors, (115), 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-03 01:53:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2022-11-03 01:53:30,369 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 24 [2022-11-03 01:53:30,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:30,370 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2022-11-03 01:53:30,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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-03 01:53:30,370 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2022-11-03 01:53:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 01:53:30,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:30,371 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, 1] [2022-11-03 01:53:30,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-03 01:53:30,372 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:30,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:30,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1681363225, now seen corresponding path program 1 times [2022-11-03 01:53:30,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:30,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800701732] [2022-11-03 01:53:30,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:30,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:30,571 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-03 01:53:30,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:30,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800701732] [2022-11-03 01:53:30,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800701732] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:30,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298801934] [2022-11-03 01:53:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:30,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:30,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:30,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:30,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:53:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:30,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:53:30,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:30,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:53:30,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 01:53:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:53:30,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:53:30,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298801934] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:30,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:53:30,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-11-03 01:53:30,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591674158] [2022-11-03 01:53:30,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:30,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:53:30,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:30,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:53:30,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:53:30,833 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:30,969 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2022-11-03 01:53:30,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:53:30,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-03 01:53:30,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:30,971 INFO L225 Difference]: With dead ends: 122 [2022-11-03 01:53:30,971 INFO L226 Difference]: Without dead ends: 122 [2022-11-03 01:53:30,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-03 01:53:30,972 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:30,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 152 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:30,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-03 01:53:30,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2022-11-03 01:53:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.25) internal successors, (125), 116 states have internal predecessors, (125), 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-03 01:53:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2022-11-03 01:53:30,976 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 28 [2022-11-03 01:53:30,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:30,977 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2022-11-03 01:53:30,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2022-11-03 01:53:30,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 01:53:30,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:30,979 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:31,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:53:31,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:31,190 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:31,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:31,190 INFO L85 PathProgramCache]: Analyzing trace with hash -973930404, now seen corresponding path program 1 times [2022-11-03 01:53:31,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:31,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702208581] [2022-11-03 01:53:31,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:31,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:31,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:31,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702208581] [2022-11-03 01:53:31,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702208581] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:31,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235759258] [2022-11-03 01:53:31,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:31,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:31,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:31,430 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:31,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:53:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:31,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-03 01:53:31,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:31,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:53:31,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:53:31,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:53:31,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:53:31,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:53:31,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:53:31,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:53:31,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:53:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:53:31,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:53:32,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235759258] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:53:32,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [468114096] [2022-11-03 01:53:32,106 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-03 01:53:32,107 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:53:32,107 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:53:32,107 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:53:32,108 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:53:32,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:53:32,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:53:32,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:53:32,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:53:32,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 01:53:32,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:53:32,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:53:32,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-03 01:53:32,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:53:32,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:53:32,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:53:32,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:53:32,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-03 01:53:32,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:53:32,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:53:32,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:53:32,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-11-03 01:53:32,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-11-03 01:53:32,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:53:32,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:32,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-11-03 01:53:33,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:53:33,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:53:33,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:53:33,244 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:53:37,314 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6695#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 01:53:37,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:53:37,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:53:37,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2022-11-03 01:53:37,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872940198] [2022-11-03 01:53:37,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:53:37,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 01:53:37,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:37,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 01:53:37,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2022-11-03 01:53:37,317 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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-03 01:53:38,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:38,052 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2022-11-03 01:53:38,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 01:53:38,052 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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 29 [2022-11-03 01:53:38,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:38,053 INFO L225 Difference]: With dead ends: 179 [2022-11-03 01:53:38,054 INFO L226 Difference]: Without dead ends: 179 [2022-11-03 01:53:38,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=211, Invalid=1049, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 01:53:38,055 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 234 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:38,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 182 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 01:53:38,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-11-03 01:53:38,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 135. [2022-11-03 01:53:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 118 states have (on average 1.2372881355932204) internal successors, (146), 134 states have internal predecessors, (146), 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-03 01:53:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-11-03 01:53:38,060 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 29 [2022-11-03 01:53:38,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:38,061 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-11-03 01:53:38,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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-03 01:53:38,061 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-11-03 01:53:38,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 01:53:38,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:38,062 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, 1, 1, 1] [2022-11-03 01:53:38,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:53:38,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:38,279 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:38,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash -182482604, now seen corresponding path program 1 times [2022-11-03 01:53:38,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:38,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606279904] [2022-11-03 01:53:38,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:38,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:38,862 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-03 01:53:38,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:38,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606279904] [2022-11-03 01:53:38,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606279904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:38,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:38,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 01:53:38,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030563489] [2022-11-03 01:53:38,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:38,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 01:53:38,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:38,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 01:53:38,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-03 01:53:38,865 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 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-03 01:53:39,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:39,265 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2022-11-03 01:53:39,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:53:39,265 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 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 30 [2022-11-03 01:53:39,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:39,267 INFO L225 Difference]: With dead ends: 168 [2022-11-03 01:53:39,267 INFO L226 Difference]: Without dead ends: 168 [2022-11-03 01:53:39,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-11-03 01:53:39,268 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 133 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:39,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 166 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:53:39,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-03 01:53:39,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 126. [2022-11-03 01:53:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 110 states have (on average 1.2454545454545454) internal successors, (137), 125 states have internal predecessors, (137), 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-03 01:53:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2022-11-03 01:53:39,273 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 30 [2022-11-03 01:53:39,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:39,273 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2022-11-03 01:53:39,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 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-03 01:53:39,273 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2022-11-03 01:53:39,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 01:53:39,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:39,278 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] [2022-11-03 01:53:39,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-03 01:53:39,278 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-03 01:53:39,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:39,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1675562428, now seen corresponding path program 1 times [2022-11-03 01:53:39,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:39,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067866316] [2022-11-03 01:53:39,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:39,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:40,520 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-03 01:53:40,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:40,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067866316] [2022-11-03 01:53:40,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067866316] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:40,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738427253] [2022-11-03 01:53:40,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:40,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:40,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:40,523 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:40,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1c80b93-5d87-4ec2-b909-71d4ce38ee40/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:53:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:40,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 01:53:40,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:40,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:53:40,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:53:40,860 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:53:40,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 01:53:40,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:40,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:53:40,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:53:41,019 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:53:41,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-03 01:53:41,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 01:53:41,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-03 01:53:41,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 01:53:41,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 01:53:41,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 01:53:41,167 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-03 01:53:41,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:41,210 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1427) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-11-03 01:53:41,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1427) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2022-11-03 01:53:41,242 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1424) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1427) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-11-03 01:53:41,257 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_1424) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1425) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1427)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-11-03 01:53:41,271 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:53:41,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-11-03 01:53:41,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2022-11-03 01:53:41,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-11-03 01:53:41,332 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (or .cse0 (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1420 Int)) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1420)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1427) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)))) (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1420 Int) (v_arrayElimCell_115 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1420)))) (or (= ~unnamed1~0~BLACK (select (select (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1424) v_arrayElimCell_115 v_ArrVal_1427) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= ~unnamed1~0~BLACK (select (select (store .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1427) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (or (not .cse0) (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1420 Int) (v_arrayElimCell_115 Int)) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1420)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1424) v_arrayElimCell_115 v_ArrVal_1427) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)))))) is different from false [2022-11-03 01:53:41,548 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:53:41,555 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:53:41,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 66 treesize of output 72 [2022-11-03 01:53:41,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2022-11-03 01:53:41,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-11-03 01:53:41,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:53:41,607 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-03 01:53:41,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738427253] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:53:41,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1053690288] [2022-11-03 01:53:41,610 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2022-11-03 01:53:41,611 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:53:41,611 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:53:41,611 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:53:41,612 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:53:41,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:53:41,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:53:41,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:53:41,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:53:41,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 01:53:41,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:53:41,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:53:41,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:53:41,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:53:41,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-03 01:53:41,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:53:41,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:53:41,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-03 01:53:41,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:53:41,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:53:41,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-11-03 01:53:41,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:53:41,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:53:41,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:41,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-11-03 01:53:42,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-11-03 01:53:42,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2022-11-03 01:53:42,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2022-11-03 01:53:42,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2022-11-03 01:53:42,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2022-11-03 01:53:42,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:53:42,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:53:42,325 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-03 01:53:42,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 194 treesize of output 153 [2022-11-03 01:53:42,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 116 [2022-11-03 01:53:42,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 45 [2022-11-03 01:53:42,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:53:42,461 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:53:42,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:53:42,493 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-03 01:53:42,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 157 treesize of output 135 [2022-11-03 01:53:42,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,538 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 01:53:42,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2022-11-03 01:53:42,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2022-11-03 01:53:42,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2022-11-03 01:53:42,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 01:53:42,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2022-11-03 01:53:42,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:42,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:43,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 19 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 56 [2022-11-03 01:53:43,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:43,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:43,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:43,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:43,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:43,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 65 [2022-11-03 01:53:43,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:43,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:43,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:43,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:43,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:43,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:43,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:43,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2022-11-03 01:53:43,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:43,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:43,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:43,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:43,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:43,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 65 [2022-11-03 01:53:43,263 INFO L356 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-03 01:53:43,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 84 [2022-11-03 01:53:43,297 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 01:53:43,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 96 [2022-11-03 01:53:43,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2022-11-03 01:53:43,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:53:44,851 INFO L356 Elim1Store]: treesize reduction 172, result has 75.3 percent of original size [2022-11-03 01:53:44,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 387 treesize of output 803 [2022-11-03 01:53:46,247 INFO L356 Elim1Store]: treesize reduction 140, result has 75.4 percent of original size [2022-11-03 01:53:46,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 541 treesize of output 851 [2022-11-03 02:01:57,501 WARN L234 SmtUtils]: Spent 15.43s on a formula simplification that was a NOOP. DAG size: 687 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 02:02:08,585 WARN L234 SmtUtils]: Spent 5.54s on a formula simplification that was a NOOP. DAG size: 673 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)