./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-token-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13567f89-3063-4f2a-bb7b-1592e6f9cd61/bin/utaipan-vmNK8stdcF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13567f89-3063-4f2a-bb7b-1592e6f9cd61/bin/utaipan-vmNK8stdcF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13567f89-3063-4f2a-bb7b-1592e6f9cd61/bin/utaipan-vmNK8stdcF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13567f89-3063-4f2a-bb7b-1592e6f9cd61/bin/utaipan-vmNK8stdcF/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13567f89-3063-4f2a-bb7b-1592e6f9cd61/bin/utaipan-vmNK8stdcF/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13567f89-3063-4f2a-bb7b-1592e6f9cd61/bin/utaipan-vmNK8stdcF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 820401b0140b0bfb9dffe62418c7fb9ec2170c8bc6edd71581a88d2ffbcfa1c6 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-12 22:41:34,712 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-12 22:41:34,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-12 22:41:34,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-12 22:41:34,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-12 22:41:34,789 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-12 22:41:34,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-12 22:41:34,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-12 22:41:34,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-12 22:41:34,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-12 22:41:34,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-12 22:41:34,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-12 22:41:34,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-12 22:41:34,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-12 22:41:34,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-12 22:41:34,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-12 22:41:34,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-12 22:41:34,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-12 22:41:34,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-12 22:41:34,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-12 22:41:34,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-12 22:41:34,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-12 22:41:34,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-12 22:41:34,856 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-12 22:41:34,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-12 22:41:34,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-12 22:41:34,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-12 22:41:34,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-12 22:41:34,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-12 22:41:34,874 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-12 22:41:34,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-12 22:41:34,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-12 22:41:34,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-12 22:41:34,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-12 22:41:34,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-12 22:41:34,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-12 22:41:34,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-12 22:41:34,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-12 22:41:34,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-12 22:41:34,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-12 22:41:34,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-12 22:41:34,888 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13567f89-3063-4f2a-bb7b-1592e6f9cd61/bin/utaipan-vmNK8stdcF/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-11-12 22:41:34,948 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-12 22:41:34,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-12 22:41:34,950 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-12 22:41:34,958 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-12 22:41:34,959 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-12 22:41:34,960 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-12 22:41:34,960 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-12 22:41:34,960 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-12 22:41:34,961 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-12 22:41:34,961 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-12 22:41:34,962 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-12 22:41:34,963 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-12 22:41:34,963 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-12 22:41:34,964 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-12 22:41:34,964 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-12 22:41:34,964 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-12 22:41:34,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-12 22:41:34,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-12 22:41:34,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-12 22:41:34,966 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-12 22:41:34,966 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-12 22:41:34,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-12 22:41:34,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-12 22:41:34,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-12 22:41:34,967 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-12 22:41:34,978 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-12 22:41:34,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-12 22:41:34,981 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-12 22:41:34,981 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-12 22:41:34,982 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-12 22:41:34,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-12 22:41:34,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-12 22:41:34,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 22:41:34,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-12 22:41:34,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-12 22:41:34,985 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-12 22:41:34,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-12 22:41:34,986 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-12 22:41:34,986 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-12 22:41:34,987 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_13567f89-3063-4f2a-bb7b-1592e6f9cd61/bin/utaipan-vmNK8stdcF/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_13567f89-3063-4f2a-bb7b-1592e6f9cd61/bin/utaipan-vmNK8stdcF 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-memcleanup) ) 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 -> 820401b0140b0bfb9dffe62418c7fb9ec2170c8bc6edd71581a88d2ffbcfa1c6 [2021-11-12 22:41:35,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-12 22:41:35,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-12 22:41:35,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-12 22:41:35,371 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-12 22:41:35,372 INFO L275 PluginConnector]: CDTParser initialized [2021-11-12 22:41:35,374 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13567f89-3063-4f2a-bb7b-1592e6f9cd61/bin/utaipan-vmNK8stdcF/../../sv-benchmarks/c/forester-heap/dll-token-2.i [2021-11-12 22:41:35,478 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13567f89-3063-4f2a-bb7b-1592e6f9cd61/bin/utaipan-vmNK8stdcF/data/ead1b615f/eba98e87b77749d9be441f9dce19b0cf/FLAG7fb42dae2 [2021-11-12 22:41:36,097 INFO L306 CDTParser]: Found 1 translation units. [2021-11-12 22:41:36,097 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13567f89-3063-4f2a-bb7b-1592e6f9cd61/sv-benchmarks/c/forester-heap/dll-token-2.i [2021-11-12 22:41:36,113 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13567f89-3063-4f2a-bb7b-1592e6f9cd61/bin/utaipan-vmNK8stdcF/data/ead1b615f/eba98e87b77749d9be441f9dce19b0cf/FLAG7fb42dae2 [2021-11-12 22:41:36,353 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13567f89-3063-4f2a-bb7b-1592e6f9cd61/bin/utaipan-vmNK8stdcF/data/ead1b615f/eba98e87b77749d9be441f9dce19b0cf [2021-11-12 22:41:36,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-12 22:41:36,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-12 22:41:36,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-12 22:41:36,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-12 22:41:36,364 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-12 22:41:36,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 10:41:36" (1/1) ... [2021-11-12 22:41:36,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ab745e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:41:36, skipping insertion in model container [2021-11-12 22:41:36,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 10:41:36" (1/1) ... [2021-11-12 22:41:36,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-12 22:41:36,448 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-12 22:41:36,814 WARN L228 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_13567f89-3063-4f2a-bb7b-1592e6f9cd61/sv-benchmarks/c/forester-heap/dll-token-2.i[22229,22242] [2021-11-12 22:41:36,821 WARN L228 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_13567f89-3063-4f2a-bb7b-1592e6f9cd61/sv-benchmarks/c/forester-heap/dll-token-2.i[22398,22411] [2021-11-12 22:41:36,823 WARN L228 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_13567f89-3063-4f2a-bb7b-1592e6f9cd61/sv-benchmarks/c/forester-heap/dll-token-2.i[22489,22502] [2021-11-12 22:41:36,825 WARN L228 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_13567f89-3063-4f2a-bb7b-1592e6f9cd61/sv-benchmarks/c/forester-heap/dll-token-2.i[22571,22584] [2021-11-12 22:41:36,827 WARN L228 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_13567f89-3063-4f2a-bb7b-1592e6f9cd61/sv-benchmarks/c/forester-heap/dll-token-2.i[22649,22662] [2021-11-12 22:41:36,831 WARN L228 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_13567f89-3063-4f2a-bb7b-1592e6f9cd61/sv-benchmarks/c/forester-heap/dll-token-2.i[22795,22808] [2021-11-12 22:41:36,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 22:41:36,857 INFO L203 MainTranslator]: Completed pre-run [2021-11-12 22:41:36,935 WARN L228 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_13567f89-3063-4f2a-bb7b-1592e6f9cd61/sv-benchmarks/c/forester-heap/dll-token-2.i[22229,22242] [2021-11-12 22:41:36,948 WARN L228 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_13567f89-3063-4f2a-bb7b-1592e6f9cd61/sv-benchmarks/c/forester-heap/dll-token-2.i[22398,22411] [2021-11-12 22:41:36,952 WARN L228 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_13567f89-3063-4f2a-bb7b-1592e6f9cd61/sv-benchmarks/c/forester-heap/dll-token-2.i[22489,22502] [2021-11-12 22:41:36,962 WARN L228 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_13567f89-3063-4f2a-bb7b-1592e6f9cd61/sv-benchmarks/c/forester-heap/dll-token-2.i[22571,22584] [2021-11-12 22:41:36,963 WARN L228 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_13567f89-3063-4f2a-bb7b-1592e6f9cd61/sv-benchmarks/c/forester-heap/dll-token-2.i[22649,22662] [2021-11-12 22:41:36,965 WARN L228 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_13567f89-3063-4f2a-bb7b-1592e6f9cd61/sv-benchmarks/c/forester-heap/dll-token-2.i[22795,22808] [2021-11-12 22:41:36,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 22:41:37,012 INFO L208 MainTranslator]: Completed translation [2021-11-12 22:41:37,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:41:37 WrapperNode [2021-11-12 22:41:37,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-12 22:41:37,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-12 22:41:37,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-12 22:41:37,014 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-12 22:41:37,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:41:37" (1/1) ... [2021-11-12 22:41:37,043 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:41:37" (1/1) ... [2021-11-12 22:41:37,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-12 22:41:37,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-12 22:41:37,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-12 22:41:37,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-12 22:41:37,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:41:37" (1/1) ... [2021-11-12 22:41:37,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:41:37" (1/1) ... [2021-11-12 22:41:37,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:41:37" (1/1) ... [2021-11-12 22:41:37,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:41:37" (1/1) ... [2021-11-12 22:41:37,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:41:37" (1/1) ... [2021-11-12 22:41:37,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:41:37" (1/1) ... [2021-11-12 22:41:37,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:41:37" (1/1) ... [2021-11-12 22:41:37,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-12 22:41:37,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-12 22:41:37,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-12 22:41:37,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-12 22:41:37,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:41:37" (1/1) ... [2021-11-12 22:41:37,177 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 22:41:37,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13567f89-3063-4f2a-bb7b-1592e6f9cd61/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 22:41:37,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13567f89-3063-4f2a-bb7b-1592e6f9cd61/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-12 22:41:37,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13567f89-3063-4f2a-bb7b-1592e6f9cd61/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-12 22:41:37,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-12 22:41:37,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-12 22:41:37,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-12 22:41:37,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-12 22:41:37,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-12 22:41:37,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-12 22:41:37,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-12 22:41:37,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-12 22:41:37,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-12 22:41:37,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-12 22:41:38,081 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-12 22:41:38,081 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-11-12 22:41:38,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 10:41:38 BoogieIcfgContainer [2021-11-12 22:41:38,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-12 22:41:38,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-12 22:41:38,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-12 22:41:38,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-12 22:41:38,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 10:41:36" (1/3) ... [2021-11-12 22:41:38,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c0d9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 10:41:38, skipping insertion in model container [2021-11-12 22:41:38,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 10:41:37" (2/3) ... [2021-11-12 22:41:38,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c0d9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 10:41:38, skipping insertion in model container [2021-11-12 22:41:38,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 10:41:38" (3/3) ... [2021-11-12 22:41:38,100 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-token-2.i [2021-11-12 22:41:38,116 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-12 22:41:38,117 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2021-11-12 22:41:38,187 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-12 22:41:38,197 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-12 22:41:38,197 INFO L340 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2021-11-12 22:41:38,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 58 states have (on average 2.5172413793103448) internal successors, (146), 122 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) [2021-11-12 22:41:38,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-11-12 22:41:38,228 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:41:38,229 INFO L514 BasicCegarLoop]: trace histogram [1, 1] [2021-11-12 22:41:38,229 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-12 22:41:38,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:41:38,238 INFO L85 PathProgramCache]: Analyzing trace with hash 8839, now seen corresponding path program 1 times [2021-11-12 22:41:38,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:41:38,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299934584] [2021-11-12 22:41:38,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:41:38,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:41:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:41:38,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 22:41:38,556 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 22:41:38,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299934584] [2021-11-12 22:41:38,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299934584] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 22:41:38,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:41:38,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-12 22:41:38,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676815266] [2021-11-12 22:41:38,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 22:41:38,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-12 22:41:38,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 22:41:38,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-12 22:41:38,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-12 22:41:38,605 INFO L87 Difference]: Start difference. First operand has 123 states, 58 states have (on average 2.5172413793103448) internal successors, (146), 122 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) 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) [2021-11-12 22:41:38,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:41:38,885 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2021-11-12 22:41:38,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-12 22:41:38,888 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 [2021-11-12 22:41:38,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:41:38,911 INFO L225 Difference]: With dead ends: 140 [2021-11-12 22:41:38,911 INFO L226 Difference]: Without dead ends: 139 [2021-11-12 22:41:38,913 INFO L932 BasicCegarLoop]: 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 [2021-11-12 22:41:38,925 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 100 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 171.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.51ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 218.64ms IncrementalHoareTripleChecker+Time [2021-11-12 22:41:38,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 88 Invalid, 76 Unknown, 0 Unchecked, 12.51ms Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 218.64ms Time] [2021-11-12 22:41:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-11-12 22:41:38,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 119. [2021-11-12 22:41:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 58 states have (on average 2.086206896551724) internal successors, (121), 118 states have internal predecessors, (121), 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) [2021-11-12 22:41:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2021-11-12 22:41:39,014 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 2 [2021-11-12 22:41:39,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:41:39,015 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2021-11-12 22:41:39,015 INFO L471 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) [2021-11-12 22:41:39,015 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2021-11-12 22:41:39,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-11-12 22:41:39,016 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:41:39,016 INFO L514 BasicCegarLoop]: trace histogram [1, 1] [2021-11-12 22:41:39,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-12 22:41:39,017 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-12 22:41:39,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:41:39,018 INFO L85 PathProgramCache]: Analyzing trace with hash 8840, now seen corresponding path program 1 times [2021-11-12 22:41:39,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:41:39,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996360562] [2021-11-12 22:41:39,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:41:39,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:41:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:41:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 22:41:39,142 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 22:41:39,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996360562] [2021-11-12 22:41:39,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996360562] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 22:41:39,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:41:39,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-12 22:41:39,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064641734] [2021-11-12 22:41:39,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 22:41:39,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-12 22:41:39,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 22:41:39,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-12 22:41:39,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-12 22:41:39,147 INFO L87 Difference]: Start difference. First operand 119 states and 121 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) [2021-11-12 22:41:39,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:41:39,326 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2021-11-12 22:41:39,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-12 22:41:39,328 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 [2021-11-12 22:41:39,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:41:39,334 INFO L225 Difference]: With dead ends: 144 [2021-11-12 22:41:39,337 INFO L226 Difference]: Without dead ends: 144 [2021-11-12 22:41:39,338 INFO L932 BasicCegarLoop]: 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 [2021-11-12 22:41:39,341 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 105 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 103.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.27ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 125.68ms IncrementalHoareTripleChecker+Time [2021-11-12 22:41:39,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 93 Invalid, 66 Unknown, 0 Unchecked, 7.27ms Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 125.68ms Time] [2021-11-12 22:41:39,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-11-12 22:41:39,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 116. [2021-11-12 22:41:39,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 58 states have (on average 2.0344827586206895) internal successors, (118), 115 states have internal predecessors, (118), 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) [2021-11-12 22:41:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2021-11-12 22:41:39,376 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 2 [2021-11-12 22:41:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:41:39,377 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2021-11-12 22:41:39,377 INFO L471 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) [2021-11-12 22:41:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2021-11-12 22:41:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-12 22:41:39,378 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:41:39,378 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:41:39,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-12 22:41:39,379 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-12 22:41:39,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:41:39,380 INFO L85 PathProgramCache]: Analyzing trace with hash -365389701, now seen corresponding path program 1 times [2021-11-12 22:41:39,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:41:39,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540973513] [2021-11-12 22:41:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:41:39,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:41:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:41:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 22:41:39,546 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 22:41:39,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540973513] [2021-11-12 22:41:39,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540973513] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 22:41:39,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:41:39,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-12 22:41:39,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125980499] [2021-11-12 22:41:39,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 22:41:39,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-12 22:41:39,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 22:41:39,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-12 22:41:39,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-12 22:41:39,553 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2021-11-12 22:41:39,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:41:39,892 INFO L93 Difference]: Finished difference Result 219 states and 223 transitions. [2021-11-12 22:41:39,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-12 22:41:39,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2021-11-12 22:41:39,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:41:39,895 INFO L225 Difference]: With dead ends: 219 [2021-11-12 22:41:39,896 INFO L226 Difference]: Without dead ends: 219 [2021-11-12 22:41:39,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-12 22:41:39,898 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 238 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 236.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.30ms SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 291.53ms IncrementalHoareTripleChecker+Time [2021-11-12 22:41:39,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 98 Invalid, 201 Unknown, 0 Unchecked, 6.30ms Time], IncrementalHoareTripleChecker [33 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 291.53ms Time] [2021-11-12 22:41:39,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-11-12 22:41:39,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 149. [2021-11-12 22:41:39,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 91 states have (on average 1.978021978021978) internal successors, (180), 148 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:41:39,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 180 transitions. [2021-11-12 22:41:39,915 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 180 transitions. Word has length 7 [2021-11-12 22:41:39,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:41:39,915 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 180 transitions. [2021-11-12 22:41:39,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2021-11-12 22:41:39,916 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 180 transitions. [2021-11-12 22:41:39,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-12 22:41:39,916 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:41:39,917 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:41:39,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-12 22:41:39,917 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-12 22:41:39,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:41:39,918 INFO L85 PathProgramCache]: Analyzing trace with hash -365389702, now seen corresponding path program 1 times [2021-11-12 22:41:39,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:41:39,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271901025] [2021-11-12 22:41:39,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:41:39,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:41:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:41:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 22:41:40,011 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 22:41:40,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271901025] [2021-11-12 22:41:40,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271901025] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 22:41:40,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:41:40,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-12 22:41:40,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262033416] [2021-11-12 22:41:40,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 22:41:40,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-12 22:41:40,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 22:41:40,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-12 22:41:40,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-12 22:41:40,015 INFO L87 Difference]: Start difference. First operand 149 states and 180 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-11-12 22:41:40,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:41:40,195 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2021-11-12 22:41:40,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-12 22:41:40,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2021-11-12 22:41:40,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:41:40,197 INFO L225 Difference]: With dead ends: 139 [2021-11-12 22:41:40,198 INFO L226 Difference]: Without dead ends: 139 [2021-11-12 22:41:40,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-12 22:41:40,200 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 157 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 130.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.95ms SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 161.91ms IncrementalHoareTripleChecker+Time [2021-11-12 22:41:40,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 64 Invalid, 131 Unknown, 0 Unchecked, 2.95ms Time], IncrementalHoareTripleChecker [38 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 161.91ms Time] [2021-11-12 22:41:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-11-12 22:41:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2021-11-12 22:41:40,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 91 states have (on average 1.6373626373626373) internal successors, (149), 133 states have internal predecessors, (149), 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) [2021-11-12 22:41:40,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2021-11-12 22:41:40,211 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 7 [2021-11-12 22:41:40,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:41:40,212 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2021-11-12 22:41:40,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-11-12 22:41:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2021-11-12 22:41:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-12 22:41:40,213 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:41:40,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:41:40,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-12 22:41:40,214 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-12 22:41:40,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:41:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1048061535, now seen corresponding path program 1 times [2021-11-12 22:41:40,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:41:40,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448794772] [2021-11-12 22:41:40,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:41:40,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:41:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:41:40,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 22:41:40,370 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 22:41:40,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448794772] [2021-11-12 22:41:40,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448794772] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 22:41:40,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:41:40,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-12 22:41:40,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104538618] [2021-11-12 22:41:40,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 22:41:40,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-12 22:41:40,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 22:41:40,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-12 22:41:40,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-12 22:41:40,373 INFO L87 Difference]: Start difference. First operand 134 states and 149 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:41:40,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:41:40,570 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2021-11-12 22:41:40,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-12 22:41:40,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-12 22:41:40,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:41:40,573 INFO L225 Difference]: With dead ends: 133 [2021-11-12 22:41:40,573 INFO L226 Difference]: Without dead ends: 133 [2021-11-12 22:41:40,573 INFO L932 BasicCegarLoop]: 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 [2021-11-12 22:41:40,575 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 5 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 143.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.42ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 171.70ms IncrementalHoareTripleChecker+Time [2021-11-12 22:41:40,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 235 Invalid, 165 Unknown, 0 Unchecked, 3.42ms Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 171.70ms Time] [2021-11-12 22:41:40,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-11-12 22:41:40,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-11-12 22:41:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 91 states have (on average 1.6153846153846154) internal successors, (147), 132 states have internal predecessors, (147), 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) [2021-11-12 22:41:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2021-11-12 22:41:40,593 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 9 [2021-11-12 22:41:40,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:41:40,594 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2021-11-12 22:41:40,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:41:40,594 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2021-11-12 22:41:40,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-12 22:41:40,595 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:41:40,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:41:40,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-12 22:41:40,596 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-12 22:41:40,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:41:40,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1048061534, now seen corresponding path program 1 times [2021-11-12 22:41:40,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:41:40,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163849238] [2021-11-12 22:41:40,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:41:40,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:41:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:41:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 22:41:40,711 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 22:41:40,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163849238] [2021-11-12 22:41:40,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163849238] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 22:41:40,712 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:41:40,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-12 22:41:40,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481244627] [2021-11-12 22:41:40,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 22:41:40,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-12 22:41:40,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 22:41:40,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-12 22:41:40,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-12 22:41:40,715 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:41:40,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:41:40,901 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2021-11-12 22:41:40,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-12 22:41:40,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-12 22:41:40,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:41:40,903 INFO L225 Difference]: With dead ends: 132 [2021-11-12 22:41:40,903 INFO L226 Difference]: Without dead ends: 132 [2021-11-12 22:41:40,904 INFO L932 BasicCegarLoop]: 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 [2021-11-12 22:41:40,905 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 135.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.44ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 163.28ms IncrementalHoareTripleChecker+Time [2021-11-12 22:41:40,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 242 Invalid, 155 Unknown, 0 Unchecked, 2.44ms Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 163.28ms Time] [2021-11-12 22:41:40,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-11-12 22:41:40,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-11-12 22:41:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 91 states have (on average 1.5934065934065933) internal successors, (145), 131 states have internal predecessors, (145), 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) [2021-11-12 22:41:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2021-11-12 22:41:40,922 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 9 [2021-11-12 22:41:40,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:41:40,922 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 145 transitions. [2021-11-12 22:41:40,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:41:40,923 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2021-11-12 22:41:40,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-12 22:41:40,923 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:41:40,924 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:41:40,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-12 22:41:40,924 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-12 22:41:40,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:41:40,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1871606420, now seen corresponding path program 1 times [2021-11-12 22:41:40,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:41:40,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549308641] [2021-11-12 22:41:40,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:41:40,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:41:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:41:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 22:41:41,033 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 22:41:41,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549308641] [2021-11-12 22:41:41,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549308641] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 22:41:41,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:41:41,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-12 22:41:41,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799551665] [2021-11-12 22:41:41,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 22:41:41,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-12 22:41:41,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 22:41:41,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-12 22:41:41,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-12 22:41:41,036 INFO L87 Difference]: Start difference. First operand 132 states and 145 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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) [2021-11-12 22:41:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:41:41,208 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2021-11-12 22:41:41,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-12 22:41:41,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 [2021-11-12 22:41:41,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:41:41,210 INFO L225 Difference]: With dead ends: 131 [2021-11-12 22:41:41,211 INFO L226 Difference]: Without dead ends: 131 [2021-11-12 22:41:41,211 INFO L932 BasicCegarLoop]: 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 [2021-11-12 22:41:41,212 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 122.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.70ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 153.54ms IncrementalHoareTripleChecker+Time [2021-11-12 22:41:41,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 234 Invalid, 154 Unknown, 0 Unchecked, 2.70ms Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 153.54ms Time] [2021-11-12 22:41:41,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-11-12 22:41:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-11-12 22:41:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 91 states have (on average 1.5714285714285714) internal successors, (143), 130 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) [2021-11-12 22:41:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2021-11-12 22:41:41,220 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 10 [2021-11-12 22:41:41,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:41:41,220 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2021-11-12 22:41:41,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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) [2021-11-12 22:41:41,221 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2021-11-12 22:41:41,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-12 22:41:41,222 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:41:41,222 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:41:41,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-12 22:41:41,223 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-12 22:41:41,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:41:41,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1871606419, now seen corresponding path program 1 times [2021-11-12 22:41:41,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:41:41,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293018430] [2021-11-12 22:41:41,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:41:41,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:41:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:41:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 22:41:41,300 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 22:41:41,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293018430] [2021-11-12 22:41:41,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293018430] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 22:41:41,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:41:41,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-12 22:41:41,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119987964] [2021-11-12 22:41:41,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 22:41:41,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-12 22:41:41,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 22:41:41,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-12 22:41:41,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-12 22:41:41,303 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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) [2021-11-12 22:41:41,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:41:41,467 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2021-11-12 22:41:41,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-12 22:41:41,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 [2021-11-12 22:41:41,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:41:41,469 INFO L225 Difference]: With dead ends: 130 [2021-11-12 22:41:41,469 INFO L226 Difference]: Without dead ends: 130 [2021-11-12 22:41:41,469 INFO L932 BasicCegarLoop]: 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 [2021-11-12 22:41:41,471 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 3 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 120.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.02ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 144.30ms IncrementalHoareTripleChecker+Time [2021-11-12 22:41:41,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 230 Invalid, 160 Unknown, 0 Unchecked, 2.02ms Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 144.30ms Time] [2021-11-12 22:41:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-12 22:41:41,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-11-12 22:41:41,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 129 states have internal predecessors, (141), 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) [2021-11-12 22:41:41,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2021-11-12 22:41:41,477 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 10 [2021-11-12 22:41:41,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:41:41,477 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2021-11-12 22:41:41,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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) [2021-11-12 22:41:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2021-11-12 22:41:41,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-12 22:41:41,478 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:41:41,479 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:41:41,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-12 22:41:41,479 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-12 22:41:41,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:41:41,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2129952249, now seen corresponding path program 1 times [2021-11-12 22:41:41,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:41:41,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425246673] [2021-11-12 22:41:41,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:41:41,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:41:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:41:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 22:41:41,671 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 22:41:41,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425246673] [2021-11-12 22:41:41,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425246673] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 22:41:41,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:41:41,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-12 22:41:41,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296777795] [2021-11-12 22:41:41,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 22:41:41,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-12 22:41:41,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 22:41:41,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-12 22:41:41,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-12 22:41:41,675 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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) [2021-11-12 22:41:42,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:41:42,043 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2021-11-12 22:41:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-12 22:41:42,044 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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 11 [2021-11-12 22:41:42,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:41:42,045 INFO L225 Difference]: With dead ends: 134 [2021-11-12 22:41:42,045 INFO L226 Difference]: Without dead ends: 134 [2021-11-12 22:41:42,046 INFO L932 BasicCegarLoop]: 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 [2021-11-12 22:41:42,046 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 151 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 229.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.99ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 272.03ms IncrementalHoareTripleChecker+Time [2021-11-12 22:41:42,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 191 Invalid, 362 Unknown, 0 Unchecked, 3.99ms Time], IncrementalHoareTripleChecker [25 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 272.03ms Time] [2021-11-12 22:41:42,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-11-12 22:41:42,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 129. [2021-11-12 22:41:42,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 91 states have (on average 1.5384615384615385) internal successors, (140), 128 states have internal predecessors, (140), 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) [2021-11-12 22:41:42,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2021-11-12 22:41:42,052 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 11 [2021-11-12 22:41:42,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:41:42,053 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2021-11-12 22:41:42,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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) [2021-11-12 22:41:42,053 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2021-11-12 22:41:42,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-12 22:41:42,054 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:41:42,054 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:41:42,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-12 22:41:42,054 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-12 22:41:42,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:41:42,055 INFO L85 PathProgramCache]: Analyzing trace with hash -2129952248, now seen corresponding path program 1 times [2021-11-12 22:41:42,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:41:42,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109876670] [2021-11-12 22:41:42,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:41:42,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:41:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:41:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 22:41:42,289 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 22:41:42,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109876670] [2021-11-12 22:41:42,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109876670] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 22:41:42,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:41:42,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-12 22:41:42,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866692997] [2021-11-12 22:41:42,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 22:41:42,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-12 22:41:42,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 22:41:42,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-12 22:41:42,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-12 22:41:42,293 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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) [2021-11-12 22:41:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:41:42,918 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2021-11-12 22:41:42,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-12 22:41:42,918 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 11 [2021-11-12 22:41:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:41:42,920 INFO L225 Difference]: With dead ends: 129 [2021-11-12 22:41:42,920 INFO L226 Difference]: Without dead ends: 129 [2021-11-12 22:41:42,920 INFO L932 BasicCegarLoop]: 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 [2021-11-12 22:41:42,921 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 145 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 338.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.63ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 400.70ms IncrementalHoareTripleChecker+Time [2021-11-12 22:41:42,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 231 Invalid, 453 Unknown, 0 Unchecked, 5.63ms Time], IncrementalHoareTripleChecker [37 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 400.70ms Time] [2021-11-12 22:41:42,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-11-12 22:41:42,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 110. [2021-11-12 22:41:42,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 80 states have (on average 1.5) internal successors, (120), 109 states have internal predecessors, (120), 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) [2021-11-12 22:41:42,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2021-11-12 22:41:42,927 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 11 [2021-11-12 22:41:42,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:41:42,927 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-11-12 22:41:42,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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) [2021-11-12 22:41:42,927 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2021-11-12 22:41:42,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-12 22:41:42,928 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:41:42,928 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:41:42,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-12 22:41:42,929 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-12 22:41:42,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:41:42,929 INFO L85 PathProgramCache]: Analyzing trace with hash 977701891, now seen corresponding path program 1 times [2021-11-12 22:41:42,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:41:42,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202637157] [2021-11-12 22:41:42,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:41:42,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:41:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:41:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 22:41:43,021 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 22:41:43,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202637157] [2021-11-12 22:41:43,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202637157] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 22:41:43,021 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:41:43,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-12 22:41:43,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115731605] [2021-11-12 22:41:43,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 22:41:43,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-12 22:41:43,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 22:41:43,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-12 22:41:43,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-12 22:41:43,023 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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) [2021-11-12 22:41:43,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:41:43,282 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2021-11-12 22:41:43,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-12 22:41:43,283 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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 [2021-11-12 22:41:43,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:41:43,284 INFO L225 Difference]: With dead ends: 109 [2021-11-12 22:41:43,285 INFO L226 Difference]: Without dead ends: 109 [2021-11-12 22:41:43,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-12 22:41:43,286 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 179.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.90ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 216.59ms IncrementalHoareTripleChecker+Time [2021-11-12 22:41:43,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 261 Invalid, 261 Unknown, 0 Unchecked, 2.90ms Time], IncrementalHoareTripleChecker [2 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 216.59ms Time] [2021-11-12 22:41:43,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-11-12 22:41:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-11-12 22:41:43,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.4875) internal successors, (119), 108 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:41:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2021-11-12 22:41:43,291 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 12 [2021-11-12 22:41:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:41:43,291 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2021-11-12 22:41:43,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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) [2021-11-12 22:41:43,292 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2021-11-12 22:41:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-12 22:41:43,293 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:41:43,293 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:41:43,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-12 22:41:43,293 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-12 22:41:43,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:41:43,294 INFO L85 PathProgramCache]: Analyzing trace with hash 977701892, now seen corresponding path program 1 times [2021-11-12 22:41:43,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:41:43,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061778050] [2021-11-12 22:41:43,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:41:43,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:41:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:41:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 22:41:43,425 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 22:41:43,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061778050] [2021-11-12 22:41:43,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061778050] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 22:41:43,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:41:43,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-12 22:41:43,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505772162] [2021-11-12 22:41:43,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 22:41:43,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-12 22:41:43,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 22:41:43,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-12 22:41:43,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-12 22:41:43,427 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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) [2021-11-12 22:41:43,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:41:43,625 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2021-11-12 22:41:43,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-12 22:41:43,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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 [2021-11-12 22:41:43,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:41:43,626 INFO L225 Difference]: With dead ends: 108 [2021-11-12 22:41:43,627 INFO L226 Difference]: Without dead ends: 108 [2021-11-12 22:41:43,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-12 22:41:43,628 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 116.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.00ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 141.46ms IncrementalHoareTripleChecker+Time [2021-11-12 22:41:43,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 202 Invalid, 149 Unknown, 0 Unchecked, 2.00ms Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 141.46ms Time] [2021-11-12 22:41:43,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-12 22:41:43,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-11-12 22:41:43,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 80 states have (on average 1.475) internal successors, (118), 107 states have internal predecessors, (118), 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) [2021-11-12 22:41:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2021-11-12 22:41:43,632 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 12 [2021-11-12 22:41:43,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:41:43,633 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2021-11-12 22:41:43,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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) [2021-11-12 22:41:43,633 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2021-11-12 22:41:43,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-12 22:41:43,634 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:41:43,634 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:41:43,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-12 22:41:43,634 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-12 22:41:43,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:41:43,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1815289415, now seen corresponding path program 1 times [2021-11-12 22:41:43,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:41:43,635 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144669769] [2021-11-12 22:41:43,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:41:43,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:41:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:41:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 22:41:43,825 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 22:41:43,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144669769] [2021-11-12 22:41:43,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144669769] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 22:41:43,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:41:43,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-12 22:41:43,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163017329] [2021-11-12 22:41:43,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 22:41:43,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-12 22:41:43,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 22:41:43,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-12 22:41:43,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-12 22:41:43,828 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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) [2021-11-12 22:41:44,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:41:44,321 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2021-11-12 22:41:44,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-12 22:41:44,322 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 13 [2021-11-12 22:41:44,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:41:44,323 INFO L225 Difference]: With dead ends: 123 [2021-11-12 22:41:44,323 INFO L226 Difference]: Without dead ends: 123 [2021-11-12 22:41:44,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-11-12 22:41:44,324 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 144 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 263.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.46ms SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 316.27ms IncrementalHoareTripleChecker+Time [2021-11-12 22:41:44,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 221 Invalid, 436 Unknown, 0 Unchecked, 4.46ms Time], IncrementalHoareTripleChecker [43 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 316.27ms Time] [2021-11-12 22:41:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-11-12 22:41:44,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2021-11-12 22:41:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 105 states have internal predecessors, (116), 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) [2021-11-12 22:41:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2021-11-12 22:41:44,328 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 13 [2021-11-12 22:41:44,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:41:44,328 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2021-11-12 22:41:44,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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) [2021-11-12 22:41:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2021-11-12 22:41:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-12 22:41:44,329 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:41:44,329 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:41:44,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-12 22:41:44,329 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-12 22:41:44,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:41:44,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1026143783, now seen corresponding path program 1 times [2021-11-12 22:41:44,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:41:44,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984136603] [2021-11-12 22:41:44,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:41:44,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:41:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:41:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 22:41:44,367 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 22:41:44,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984136603] [2021-11-12 22:41:44,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984136603] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 22:41:44,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:41:44,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-12 22:41:44,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613783841] [2021-11-12 22:41:44,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 22:41:44,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-12 22:41:44,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 22:41:44,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-12 22:41:44,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-12 22:41:44,370 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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) [2021-11-12 22:41:44,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:41:44,490 INFO L93 Difference]: Finished difference Result 159 states and 164 transitions. [2021-11-12 22:41:44,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-12 22:41:44,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 [2021-11-12 22:41:44,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:41:44,492 INFO L225 Difference]: With dead ends: 159 [2021-11-12 22:41:44,492 INFO L226 Difference]: Without dead ends: 159 [2021-11-12 22:41:44,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-12 22:41:44,494 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 152 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 85.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.86ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 103.94ms IncrementalHoareTripleChecker+Time [2021-11-12 22:41:44,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 113 Invalid, 93 Unknown, 0 Unchecked, 1.86ms Time], IncrementalHoareTripleChecker [11 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 103.94ms Time] [2021-11-12 22:41:44,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-12 22:41:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 104. [2021-11-12 22:41:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 78 states have (on average 1.4615384615384615) internal successors, (114), 103 states have internal predecessors, (114), 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) [2021-11-12 22:41:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2021-11-12 22:41:44,500 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 14 [2021-11-12 22:41:44,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:41:44,500 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2021-11-12 22:41:44,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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) [2021-11-12 22:41:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2021-11-12 22:41:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-12 22:41:44,502 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:41:44,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:41:44,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-12 22:41:44,503 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-12 22:41:44,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:41:44,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2088902450, now seen corresponding path program 1 times [2021-11-12 22:41:44,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:41:44,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879963120] [2021-11-12 22:41:44,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:41:44,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:41:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:41:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 22:41:44,788 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 22:41:44,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879963120] [2021-11-12 22:41:44,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879963120] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 22:41:44,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:41:44,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-12 22:41:44,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976734211] [2021-11-12 22:41:44,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 22:41:44,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-12 22:41:44,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 22:41:44,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-12 22:41:44,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-12 22:41:44,790 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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) [2021-11-12 22:41:45,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:41:45,100 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2021-11-12 22:41:45,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-12 22:41:45,101 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 [2021-11-12 22:41:45,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:41:45,103 INFO L225 Difference]: With dead ends: 141 [2021-11-12 22:41:45,103 INFO L226 Difference]: Without dead ends: 141 [2021-11-12 22:41:45,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-11-12 22:41:45,104 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 135 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 194.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.42ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 232.80ms IncrementalHoareTripleChecker+Time [2021-11-12 22:41:45,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 208 Invalid, 256 Unknown, 0 Unchecked, 3.42ms Time], IncrementalHoareTripleChecker [17 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 232.80ms Time] [2021-11-12 22:41:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-11-12 22:41:45,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 116. [2021-11-12 22:41:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 115 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 22:41:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2021-11-12 22:41:45,110 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 19 [2021-11-12 22:41:45,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:41:45,110 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2021-11-12 22:41:45,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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) [2021-11-12 22:41:45,111 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2021-11-12 22:41:45,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-12 22:41:45,112 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:41:45,112 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:41:45,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-12 22:41:45,112 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-12 22:41:45,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:41:45,114 INFO L85 PathProgramCache]: Analyzing trace with hash 2088869679, now seen corresponding path program 1 times [2021-11-12 22:41:45,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:41:45,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685754947] [2021-11-12 22:41:45,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:41:45,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:41:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:41:45,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 22:41:45,159 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 22:41:45,160 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685754947] [2021-11-12 22:41:45,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685754947] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 22:41:45,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:41:45,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-12 22:41:45,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236488245] [2021-11-12 22:41:45,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 22:41:45,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-12 22:41:45,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 22:41:45,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-12 22:41:45,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-12 22:41:45,162 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 5 states, 5 states have (on average 3.8) 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) [2021-11-12 22:41:45,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:41:45,294 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2021-11-12 22:41:45,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-12 22:41:45,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) 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 [2021-11-12 22:41:45,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:41:45,296 INFO L225 Difference]: With dead ends: 114 [2021-11-12 22:41:45,296 INFO L226 Difference]: Without dead ends: 114 [2021-11-12 22:41:45,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-12 22:41:45,298 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 5 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 97.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.94ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 118.17ms IncrementalHoareTripleChecker+Time [2021-11-12 22:41:45,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 187 Invalid, 133 Unknown, 0 Unchecked, 1.94ms Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 118.17ms Time] [2021-11-12 22:41:45,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-11-12 22:41:45,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-11-12 22:41:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 113 states have internal predecessors, (124), 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) [2021-11-12 22:41:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2021-11-12 22:41:45,303 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 19 [2021-11-12 22:41:45,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:41:45,303 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2021-11-12 22:41:45,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) 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) [2021-11-12 22:41:45,303 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2021-11-12 22:41:45,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-12 22:41:45,304 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:41:45,305 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:41:45,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-12 22:41:45,305 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-12 22:41:45,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:41:45,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1654168128, now seen corresponding path program 1 times [2021-11-12 22:41:45,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:41:45,307 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790412346] [2021-11-12 22:41:45,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:41:45,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:41:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:41:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 22:41:45,493 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 22:41:45,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790412346] [2021-11-12 22:41:45,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790412346] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 22:41:45,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:41:45,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-12 22:41:45,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131600191] [2021-11-12 22:41:45,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 22:41:45,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-12 22:41:45,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 22:41:45,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-12 22:41:45,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-12 22:41:45,496 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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) [2021-11-12 22:41:45,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:41:45,844 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2021-11-12 22:41:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-12 22:41:45,845 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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 [2021-11-12 22:41:45,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:41:45,846 INFO L225 Difference]: With dead ends: 137 [2021-11-12 22:41:45,846 INFO L226 Difference]: Without dead ends: 137 [2021-11-12 22:41:45,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-11-12 22:41:45,847 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 139 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 211.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.29ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 254.28ms IncrementalHoareTripleChecker+Time [2021-11-12 22:41:45,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 153 Invalid, 285 Unknown, 0 Unchecked, 3.29ms Time], IncrementalHoareTripleChecker [28 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 254.28ms Time] [2021-11-12 22:41:45,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-11-12 22:41:45,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2021-11-12 22:41:45,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 118 states have internal predecessors, (130), 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) [2021-11-12 22:41:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2021-11-12 22:41:45,853 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 21 [2021-11-12 22:41:45,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:41:45,853 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2021-11-12 22:41:45,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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) [2021-11-12 22:41:45,854 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2021-11-12 22:41:45,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-12 22:41:45,855 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:41:45,855 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:41:45,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-12 22:41:45,855 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-12 22:41:45,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:41:45,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1654168129, now seen corresponding path program 1 times [2021-11-12 22:41:45,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:41:45,857 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210953102] [2021-11-12 22:41:45,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:41:45,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:41:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 22:41:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 22:41:46,094 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 22:41:46,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210953102] [2021-11-12 22:41:46,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210953102] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 22:41:46,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 22:41:46,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-12 22:41:46,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300931630] [2021-11-12 22:41:46,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 22:41:46,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-12 22:41:46,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 22:41:46,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-12 22:41:46,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-12 22:41:46,096 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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) [2021-11-12 22:41:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 22:41:46,490 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2021-11-12 22:41:46,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-12 22:41:46,491 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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 [2021-11-12 22:41:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 22:41:46,493 INFO L225 Difference]: With dead ends: 141 [2021-11-12 22:41:46,493 INFO L226 Difference]: Without dead ends: 141 [2021-11-12 22:41:46,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-11-12 22:41:46,494 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 53 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 296.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.66ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 349.35ms IncrementalHoareTripleChecker+Time [2021-11-12 22:41:46,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 263 Invalid, 396 Unknown, 0 Unchecked, 3.66ms Time], IncrementalHoareTripleChecker [10 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 349.35ms Time] [2021-11-12 22:41:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-11-12 22:41:46,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2021-11-12 22:41:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.372340425531915) internal successors, (129), 118 states have internal predecessors, (129), 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) [2021-11-12 22:41:46,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2021-11-12 22:41:46,500 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 21 [2021-11-12 22:41:46,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 22:41:46,500 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2021-11-12 22:41:46,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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) [2021-11-12 22:41:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2021-11-12 22:41:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-12 22:41:46,502 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 22:41:46,502 INFO L514 BasicCegarLoop]: 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] [2021-11-12 22:41:46,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-12 22:41:46,503 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-12 22:41:46,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 22:41:46,503 INFO L85 PathProgramCache]: Analyzing trace with hash 517676064, now seen corresponding path program 1 times [2021-11-12 22:41:46,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 22:41:46,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280355399] [2021-11-12 22:41:46,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 22:41:46,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 22:41:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-12 22:41:46,527 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-12 22:41:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-12 22:41:46,584 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-12 22:41:46,588 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-12 22:41:46,590 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (63 of 64 remaining) [2021-11-12 22:41:46,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (62 of 64 remaining) [2021-11-12 22:41:46,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (61 of 64 remaining) [2021-11-12 22:41:46,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (60 of 64 remaining) [2021-11-12 22:41:46,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (59 of 64 remaining) [2021-11-12 22:41:46,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (58 of 64 remaining) [2021-11-12 22:41:46,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (57 of 64 remaining) [2021-11-12 22:41:46,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (56 of 64 remaining) [2021-11-12 22:41:46,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (55 of 64 remaining) [2021-11-12 22:41:46,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (54 of 64 remaining) [2021-11-12 22:41:46,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (53 of 64 remaining) [2021-11-12 22:41:46,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (52 of 64 remaining) [2021-11-12 22:41:46,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (51 of 64 remaining) [2021-11-12 22:41:46,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (50 of 64 remaining) [2021-11-12 22:41:46,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (49 of 64 remaining) [2021-11-12 22:41:46,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (48 of 64 remaining) [2021-11-12 22:41:46,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (47 of 64 remaining) [2021-11-12 22:41:46,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (46 of 64 remaining) [2021-11-12 22:41:46,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (45 of 64 remaining) [2021-11-12 22:41:46,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (44 of 64 remaining) [2021-11-12 22:41:46,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (43 of 64 remaining) [2021-11-12 22:41:46,601 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (42 of 64 remaining) [2021-11-12 22:41:46,601 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (41 of 64 remaining) [2021-11-12 22:41:46,601 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (40 of 64 remaining) [2021-11-12 22:41:46,601 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (39 of 64 remaining) [2021-11-12 22:41:46,602 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (38 of 64 remaining) [2021-11-12 22:41:46,602 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (37 of 64 remaining) [2021-11-12 22:41:46,602 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (36 of 64 remaining) [2021-11-12 22:41:46,603 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (35 of 64 remaining) [2021-11-12 22:41:46,603 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (34 of 64 remaining) [2021-11-12 22:41:46,603 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK (33 of 64 remaining) [2021-11-12 22:41:46,603 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (32 of 64 remaining) [2021-11-12 22:41:46,604 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (31 of 64 remaining) [2021-11-12 22:41:46,604 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (30 of 64 remaining) [2021-11-12 22:41:46,604 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (29 of 64 remaining) [2021-11-12 22:41:46,604 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (28 of 64 remaining) [2021-11-12 22:41:46,604 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (27 of 64 remaining) [2021-11-12 22:41:46,605 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (26 of 64 remaining) [2021-11-12 22:41:46,605 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (25 of 64 remaining) [2021-11-12 22:41:46,605 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (24 of 64 remaining) [2021-11-12 22:41:46,605 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK (23 of 64 remaining) [2021-11-12 22:41:46,606 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (22 of 64 remaining) [2021-11-12 22:41:46,606 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (21 of 64 remaining) [2021-11-12 22:41:46,606 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (20 of 64 remaining) [2021-11-12 22:41:46,606 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (19 of 64 remaining) [2021-11-12 22:41:46,607 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (18 of 64 remaining) [2021-11-12 22:41:46,607 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (17 of 64 remaining) [2021-11-12 22:41:46,607 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (16 of 64 remaining) [2021-11-12 22:41:46,607 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (15 of 64 remaining) [2021-11-12 22:41:46,607 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE (14 of 64 remaining) [2021-11-12 22:41:46,608 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (13 of 64 remaining) [2021-11-12 22:41:46,608 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (12 of 64 remaining) [2021-11-12 22:41:46,608 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (11 of 64 remaining) [2021-11-12 22:41:46,609 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION (10 of 64 remaining) [2021-11-12 22:41:46,609 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (9 of 64 remaining) [2021-11-12 22:41:46,609 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (8 of 64 remaining) [2021-11-12 22:41:46,609 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION (7 of 64 remaining) [2021-11-12 22:41:46,609 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (6 of 64 remaining) [2021-11-12 22:41:46,610 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (5 of 64 remaining) [2021-11-12 22:41:46,610 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE (4 of 64 remaining) [2021-11-12 22:41:46,610 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE (3 of 64 remaining) [2021-11-12 22:41:46,610 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE (2 of 64 remaining) [2021-11-12 22:41:46,611 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE (1 of 64 remaining) [2021-11-12 22:41:46,611 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK (0 of 64 remaining) [2021-11-12 22:41:46,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-12 22:41:46,619 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 22:41:46,625 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-12 22:41:46,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 10:41:46 BoogieIcfgContainer [2021-11-12 22:41:46,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-12 22:41:46,706 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-12 22:41:46,707 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-12 22:41:46,707 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-12 22:41:46,708 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 10:41:38" (3/4) ... [2021-11-12 22:41:46,711 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-12 22:41:46,781 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13567f89-3063-4f2a-bb7b-1592e6f9cd61/bin/utaipan-vmNK8stdcF/witness.graphml [2021-11-12 22:41:46,786 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-12 22:41:46,787 INFO L158 Benchmark]: Toolchain (without parser) took 10428.62ms. Allocated memory was 104.9MB in the beginning and 136.3MB in the end (delta: 31.5MB). Free memory was 63.1MB in the beginning and 51.2MB in the end (delta: 11.9MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2021-11-12 22:41:46,787 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 104.9MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-12 22:41:46,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 653.30ms. Allocated memory is still 104.9MB. Free memory was 62.9MB in the beginning and 72.6MB in the end (delta: -9.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-12 22:41:46,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.23ms. Allocated memory is still 104.9MB. Free memory was 72.6MB in the beginning and 70.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-12 22:41:46,789 INFO L158 Benchmark]: Boogie Preprocessor took 81.80ms. Allocated memory is still 104.9MB. Free memory was 70.5MB in the beginning and 69.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-12 22:41:46,790 INFO L158 Benchmark]: RCFGBuilder took 927.57ms. Allocated memory is still 104.9MB. Free memory was 68.7MB in the beginning and 47.5MB in the end (delta: 21.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-11-12 22:41:46,790 INFO L158 Benchmark]: TraceAbstraction took 8618.80ms. Allocated memory was 104.9MB in the beginning and 136.3MB in the end (delta: 31.5MB). Free memory was 47.2MB in the beginning and 53.3MB in the end (delta: -6.1MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2021-11-12 22:41:46,796 INFO L158 Benchmark]: Witness Printer took 79.68ms. Allocated memory is still 136.3MB. Free memory was 53.3MB in the beginning and 51.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-12 22:41:46,799 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 104.9MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 653.30ms. Allocated memory is still 104.9MB. Free memory was 62.9MB in the beginning and 72.6MB in the end (delta: -9.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.23ms. Allocated memory is still 104.9MB. Free memory was 72.6MB in the beginning and 70.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.80ms. Allocated memory is still 104.9MB. Free memory was 70.5MB in the beginning and 69.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 927.57ms. Allocated memory is still 104.9MB. Free memory was 68.7MB in the beginning and 47.5MB in the end (delta: 21.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8618.80ms. Allocated memory was 104.9MB in the beginning and 136.3MB in the end (delta: 31.5MB). Free memory was 47.2MB in the beginning and 53.3MB in the end (delta: -6.1MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. * Witness Printer took 79.68ms. Allocated memory is still 136.3MB. Free memory was 53.3MB in the beginning and 51.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1037]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1004] SLL* head = malloc(sizeof(SLL)); [L1005] head->next = ((void*)0) VAL [head={-1:0}] [L1006] head->prev = ((void*)0) VAL [head={-1:0}] [L1007] head->data = 0 [L1009] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1021] x->data = 1 [L1022] x->next = malloc(sizeof(SLL)) [L1023] EXPR x->next VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1023] x->next->prev = x [L1024] EXPR x->next VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1024] x->next->data = 2 [L1026] x = head VAL [head={-1:0}, x={-1:0}] [L1028] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, x={-1:0}] [L1030] EXPR x->data VAL [head={-1:0}, x={-1:0}, x->data=1] [L1030] COND FALSE !(1 != x->data) [L1035] EXPR x->data VAL [head={-1:0}, x={-1:0}, x->data=1] [L1035] COND FALSE !(!(1 == x->data)) [L1036] EXPR x->next [L1036] x = x->next [L1037] EXPR x->data VAL [head={-1:0}, x={-2:0}, x->data=2] [L1037] COND TRUE !(2 != x->data) [L1037] reach_error() VAL [head={-1:0}, x={-2:0}] - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 123 locations, 64 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1553 SdHoareTripleChecker+Valid, 3836.15ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1553 mSDsluCounter, 3314 SdHoareTripleChecker+Invalid, 3176.74ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2222 mSDsCounter, 259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3673 IncrementalHoareTripleChecker+Invalid, 3932 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 259 mSolverCounterUnsat, 1102 mSDtfsCounter, 3673 mSolverCounterSat, 72.78ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=3, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 284 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 1591 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-12 22:41:46,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13567f89-3063-4f2a-bb7b-1592e6f9cd61/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)