./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 02:06:55,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 02:06:55,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 02:06:55,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 02:06:55,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 02:06:55,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 02:06:55,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 02:06:55,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 02:06:55,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 02:06:55,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 02:06:55,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 02:06:55,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 02:06:55,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 02:06:55,942 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 02:06:55,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 02:06:55,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 02:06:55,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 02:06:55,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 02:06:55,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 02:06:55,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 02:06:55,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 02:06:55,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 02:06:55,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 02:06:55,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 02:06:55,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 02:06:55,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 02:06:55,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 02:06:55,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 02:06:55,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 02:06:55,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 02:06:55,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 02:06:55,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 02:06:55,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 02:06:55,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 02:06:55,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 02:06:55,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 02:06:56,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 02:06:56,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 02:06:56,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 02:06:56,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 02:06:56,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 02:06:56,003 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-07 02:06:56,054 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 02:06:56,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 02:06:56,056 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 02:06:56,056 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 02:06:56,057 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 02:06:56,057 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 02:06:56,057 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 02:06:56,057 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 02:06:56,058 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 02:06:56,058 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 02:06:56,059 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 02:06:56,060 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 02:06:56,060 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 02:06:56,060 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 02:06:56,061 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 02:06:56,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 02:06:56,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 02:06:56,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 02:06:56,062 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 02:06:56,063 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 02:06:56,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 02:06:56,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 02:06:56,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 02:06:56,064 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-07 02:06:56,064 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-07 02:06:56,064 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-07 02:06:56,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 02:06:56,066 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 02:06:56,066 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 02:06:56,067 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 02:06:56,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 02:06:56,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 02:06:56,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:06:56,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 02:06:56,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 02:06:56,069 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 02:06:56,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 02:06:56,069 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 02:06:56,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 02:06:56,070 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_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/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_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 [2021-11-07 02:06:56,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 02:06:56,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 02:06:56,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 02:06:56,402 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 02:06:56,403 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 02:06:56,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-11-07 02:06:56,504 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/data/db87c4a6b/6f73405c3eea4d89b6df2b97fd5b8909/FLAG688ba788a [2021-11-07 02:06:57,187 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 02:06:57,188 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-11-07 02:06:57,202 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/data/db87c4a6b/6f73405c3eea4d89b6df2b97fd5b8909/FLAG688ba788a [2021-11-07 02:06:57,492 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/data/db87c4a6b/6f73405c3eea4d89b6df2b97fd5b8909 [2021-11-07 02:06:57,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 02:06:57,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 02:06:57,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 02:06:57,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 02:06:57,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 02:06:57,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:06:57" (1/1) ... [2021-11-07 02:06:57,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dcbc382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:06:57, skipping insertion in model container [2021-11-07 02:06:57,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:06:57" (1/1) ... [2021-11-07 02:06:57,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 02:06:57,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 02:06:57,916 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_9ff9f413-13ba-46e4-b349-614e91502d03/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2021-11-07 02:06:57,920 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_9ff9f413-13ba-46e4-b349-614e91502d03/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2021-11-07 02:06:57,922 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_9ff9f413-13ba-46e4-b349-614e91502d03/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2021-11-07 02:06:57,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:06:57,938 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 02:06:57,984 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_9ff9f413-13ba-46e4-b349-614e91502d03/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2021-11-07 02:06:57,988 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_9ff9f413-13ba-46e4-b349-614e91502d03/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2021-11-07 02:06:57,991 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_9ff9f413-13ba-46e4-b349-614e91502d03/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2021-11-07 02:06:57,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:06:58,039 INFO L208 MainTranslator]: Completed translation [2021-11-07 02:06:58,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:06:58 WrapperNode [2021-11-07 02:06:58,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 02:06:58,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 02:06:58,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 02:06:58,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 02:06:58,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:06:58" (1/1) ... [2021-11-07 02:06:58,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:06:58" (1/1) ... [2021-11-07 02:06:58,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 02:06:58,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 02:06:58,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 02:06:58,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 02:06:58,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:06:58" (1/1) ... [2021-11-07 02:06:58,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:06:58" (1/1) ... [2021-11-07 02:06:58,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:06:58" (1/1) ... [2021-11-07 02:06:58,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:06:58" (1/1) ... [2021-11-07 02:06:58,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:06:58" (1/1) ... [2021-11-07 02:06:58,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:06:58" (1/1) ... [2021-11-07 02:06:58,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:06:58" (1/1) ... [2021-11-07 02:06:58,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 02:06:58,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 02:06:58,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 02:06:58,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 02:06:58,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:06:58" (1/1) ... [2021-11-07 02:06:58,165 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:06:58,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:06:58,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 02:06:58,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 02:06:58,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 02:06:58,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 02:06:58,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 02:06:58,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 02:06:58,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 02:06:58,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 02:06:58,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 02:06:58,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 02:06:58,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 02:06:58,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 02:06:59,123 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 02:06:59,124 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2021-11-07 02:06:59,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:06:59 BoogieIcfgContainer [2021-11-07 02:06:59,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 02:06:59,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 02:06:59,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 02:06:59,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 02:06:59,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:06:57" (1/3) ... [2021-11-07 02:06:59,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7c3ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:06:59, skipping insertion in model container [2021-11-07 02:06:59,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:06:58" (2/3) ... [2021-11-07 02:06:59,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7c3ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:06:59, skipping insertion in model container [2021-11-07 02:06:59,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:06:59" (3/3) ... [2021-11-07 02:06:59,147 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2021-11-07 02:06:59,153 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 02:06:59,153 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2021-11-07 02:06:59,209 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 02:06:59,217 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-07 02:06:59,218 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2021-11-07 02:06:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 54 states have (on average 2.5) internal successors, (135), 119 states have internal predecessors, (135), 0 states have call successors, (0), 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-07 02:06:59,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-11-07 02:06:59,246 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:06:59,247 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-11-07 02:06:59,247 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:06:59,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:06:59,254 INFO L85 PathProgramCache]: Analyzing trace with hash 8095, now seen corresponding path program 1 times [2021-11-07 02:06:59,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:06:59,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195297086] [2021-11-07 02:06:59,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:06:59,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:06:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:06:59,444 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-07 02:06:59,445 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:06:59,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195297086] [2021-11-07 02:06:59,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195297086] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:06:59,446 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:06:59,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-07 02:06:59,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705710097] [2021-11-07 02:06:59,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:06:59,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:06:59,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:06:59,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:06:59,474 INFO L87 Difference]: Start difference. First operand has 120 states, 54 states have (on average 2.5) internal successors, (135), 119 states have internal predecessors, (135), 0 states have call successors, (0), 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-07 02:06:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:06:59,637 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2021-11-07 02:06:59,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:06:59,639 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-07 02:06:59,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:06:59,650 INFO L225 Difference]: With dead ends: 119 [2021-11-07 02:06:59,650 INFO L226 Difference]: Without dead ends: 117 [2021-11-07 02:06:59,652 INFO L786 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-07 02:06:59,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-07 02:06:59,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2021-11-07 02:06:59,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 56 states have (on average 2.1607142857142856) internal successors, (121), 113 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-07 02:06:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2021-11-07 02:06:59,696 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 2 [2021-11-07 02:06:59,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:06:59,697 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2021-11-07 02:06:59,697 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-07 02:06:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2021-11-07 02:06:59,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-11-07 02:06:59,698 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:06:59,698 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-11-07 02:06:59,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 02:06:59,698 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:06:59,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:06:59,699 INFO L85 PathProgramCache]: Analyzing trace with hash 8096, now seen corresponding path program 1 times [2021-11-07 02:06:59,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:06:59,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311426926] [2021-11-07 02:06:59,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:06:59,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:06:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:06:59,753 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-07 02:06:59,754 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:06:59,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311426926] [2021-11-07 02:06:59,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311426926] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:06:59,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:06:59,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-07 02:06:59,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151283204] [2021-11-07 02:06:59,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:06:59,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:06:59,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:06:59,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:06:59,758 INFO L87 Difference]: Start difference. First operand 114 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-07 02:06:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:06:59,893 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2021-11-07 02:06:59,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:06:59,894 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-07 02:06:59,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:06:59,896 INFO L225 Difference]: With dead ends: 127 [2021-11-07 02:06:59,896 INFO L226 Difference]: Without dead ends: 127 [2021-11-07 02:06:59,898 INFO L786 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-07 02:06:59,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-11-07 02:06:59,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 116. [2021-11-07 02:06:59,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 115 states have internal predecessors, (123), 0 states have call successors, (0), 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-07 02:06:59,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2021-11-07 02:06:59,921 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 2 [2021-11-07 02:06:59,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:06:59,922 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2021-11-07 02:06:59,922 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-07 02:06:59,922 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2021-11-07 02:06:59,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 02:06:59,923 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:06:59,923 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:06:59,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 02:06:59,924 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:06:59,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:06:59,924 INFO L85 PathProgramCache]: Analyzing trace with hash -191356527, now seen corresponding path program 1 times [2021-11-07 02:06:59,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:06:59,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980008619] [2021-11-07 02:06:59,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:06:59,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:07:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:00,066 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-07 02:07:00,067 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:07:00,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980008619] [2021-11-07 02:07:00,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980008619] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:00,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:00,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 02:07:00,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085754291] [2021-11-07 02:07:00,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:07:00,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:07:00,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:07:00,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:07:00,072 INFO L87 Difference]: Start difference. First operand 116 states and 123 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-07 02:07:00,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:00,291 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2021-11-07 02:07:00,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:07:00,291 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-07 02:07:00,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:00,297 INFO L225 Difference]: With dead ends: 117 [2021-11-07 02:07:00,298 INFO L226 Difference]: Without dead ends: 117 [2021-11-07 02:07:00,298 INFO L786 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-07 02:07:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-07 02:07:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2021-11-07 02:07:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 64 states have (on average 1.8125) 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-07 02:07:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2021-11-07 02:07:00,313 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 7 [2021-11-07 02:07:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:00,314 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2021-11-07 02:07:00,314 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-07 02:07:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2021-11-07 02:07:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 02:07:00,315 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:00,315 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:00,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 02:07:00,315 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:00,316 INFO L85 PathProgramCache]: Analyzing trace with hash -191356526, now seen corresponding path program 1 times [2021-11-07 02:07:00,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:07:00,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655717603] [2021-11-07 02:07:00,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:00,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:07:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:00,468 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-07 02:07:00,468 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:07:00,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655717603] [2021-11-07 02:07:00,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655717603] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:00,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:00,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 02:07:00,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85766633] [2021-11-07 02:07:00,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:07:00,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:07:00,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:07:00,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:07:00,475 INFO L87 Difference]: Start difference. First operand 106 states and 116 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-07 02:07:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:00,701 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2021-11-07 02:07:00,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:07:00,702 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-07 02:07:00,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:00,704 INFO L225 Difference]: With dead ends: 140 [2021-11-07 02:07:00,705 INFO L226 Difference]: Without dead ends: 140 [2021-11-07 02:07:00,707 INFO L786 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-07 02:07:00,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-11-07 02:07:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 117. [2021-11-07 02:07:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 76 states have (on average 1.7236842105263157) internal successors, (131), 116 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2021-11-07 02:07:00,728 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 7 [2021-11-07 02:07:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:00,728 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2021-11-07 02:07:00,729 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-07 02:07:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2021-11-07 02:07:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 02:07:00,730 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:00,730 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:00,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 02:07:00,731 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:00,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:00,733 INFO L85 PathProgramCache]: Analyzing trace with hash 789967275, now seen corresponding path program 1 times [2021-11-07 02:07:00,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:07:00,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414834074] [2021-11-07 02:07:00,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:00,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:07:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:00,826 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-07 02:07:00,827 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:07:00,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414834074] [2021-11-07 02:07:00,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414834074] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:00,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:00,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:07:00,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257383956] [2021-11-07 02:07:00,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:07:00,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:07:00,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:07:00,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:07:00,832 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-07 02:07:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:00,973 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2021-11-07 02:07:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:07:00,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-07 02:07:00,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:00,975 INFO L225 Difference]: With dead ends: 129 [2021-11-07 02:07:00,975 INFO L226 Difference]: Without dead ends: 129 [2021-11-07 02:07:00,976 INFO L786 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-07 02:07:00,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-11-07 02:07:00,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 115. [2021-11-07 02:07:00,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 114 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-07 02:07:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2021-11-07 02:07:00,991 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 9 [2021-11-07 02:07:00,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:00,991 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2021-11-07 02:07:00,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-07 02:07:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2021-11-07 02:07:00,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 02:07:00,993 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:00,994 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:00,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 02:07:00,997 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:00,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:00,998 INFO L85 PathProgramCache]: Analyzing trace with hash 790171077, now seen corresponding path program 1 times [2021-11-07 02:07:00,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:07:00,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425004771] [2021-11-07 02:07:01,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:01,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:07:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:01,149 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-07 02:07:01,150 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:07:01,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425004771] [2021-11-07 02:07:01,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425004771] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:01,151 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:01,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:07:01,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948889140] [2021-11-07 02:07:01,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:07:01,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:07:01,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:07:01,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:07:01,155 INFO L87 Difference]: Start difference. First operand 115 states and 127 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-07 02:07:01,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:01,320 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2021-11-07 02:07:01,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:07:01,321 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-07 02:07:01,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:01,322 INFO L225 Difference]: With dead ends: 114 [2021-11-07 02:07:01,322 INFO L226 Difference]: Without dead ends: 114 [2021-11-07 02:07:01,322 INFO L786 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-07 02:07:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-11-07 02:07:01,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-11-07 02:07:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 75 states have (on average 1.6666666666666667) internal successors, (125), 113 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2021-11-07 02:07:01,327 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 9 [2021-11-07 02:07:01,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:01,327 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2021-11-07 02:07:01,327 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-07 02:07:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2021-11-07 02:07:01,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 02:07:01,328 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:01,328 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:01,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 02:07:01,329 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:01,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:01,329 INFO L85 PathProgramCache]: Analyzing trace with hash 790171076, now seen corresponding path program 1 times [2021-11-07 02:07:01,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:07:01,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012986852] [2021-11-07 02:07:01,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:01,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:07:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:01,421 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-07 02:07:01,422 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:07:01,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012986852] [2021-11-07 02:07:01,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012986852] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:01,423 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:01,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:07:01,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277879281] [2021-11-07 02:07:01,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:07:01,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:07:01,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:07:01,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:07:01,426 INFO L87 Difference]: Start difference. First operand 114 states and 125 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-07 02:07:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:01,563 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2021-11-07 02:07:01,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:07:01,564 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-07 02:07:01,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:01,565 INFO L225 Difference]: With dead ends: 113 [2021-11-07 02:07:01,565 INFO L226 Difference]: Without dead ends: 113 [2021-11-07 02:07:01,566 INFO L786 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-07 02:07:01,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-07 02:07:01,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-11-07 02:07:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 75 states have (on average 1.64) internal successors, (123), 112 states have internal predecessors, (123), 0 states have call successors, (0), 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-07 02:07:01,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2021-11-07 02:07:01,571 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 9 [2021-11-07 02:07:01,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:01,572 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2021-11-07 02:07:01,572 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-07 02:07:01,572 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2021-11-07 02:07:01,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:07:01,573 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:01,573 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:01,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 02:07:01,574 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:01,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:01,574 INFO L85 PathProgramCache]: Analyzing trace with hash -854603864, now seen corresponding path program 1 times [2021-11-07 02:07:01,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:07:01,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136006476] [2021-11-07 02:07:01,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:01,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:07:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:01,750 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-07 02:07:01,750 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:07:01,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136006476] [2021-11-07 02:07:01,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136006476] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:01,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:01,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 02:07:01,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956251069] [2021-11-07 02:07:01,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 02:07:01,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:07:01,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 02:07:01,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-07 02:07:01,754 INFO L87 Difference]: Start difference. First operand 113 states and 123 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-07 02:07:02,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:02,022 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2021-11-07 02:07:02,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 02:07:02,023 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-07 02:07:02,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:02,024 INFO L225 Difference]: With dead ends: 113 [2021-11-07 02:07:02,024 INFO L226 Difference]: Without dead ends: 113 [2021-11-07 02:07:02,025 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:07:02,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-07 02:07:02,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2021-11-07 02:07:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 111 states have internal predecessors, (122), 0 states have call successors, (0), 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-07 02:07:02,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2021-11-07 02:07:02,029 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 11 [2021-11-07 02:07:02,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:02,029 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2021-11-07 02:07:02,029 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-07 02:07:02,029 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2021-11-07 02:07:02,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:07:02,030 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:02,030 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:02,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 02:07:02,031 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:02,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:02,031 INFO L85 PathProgramCache]: Analyzing trace with hash -854603863, now seen corresponding path program 1 times [2021-11-07 02:07:02,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:07:02,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954442309] [2021-11-07 02:07:02,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:02,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:07:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:02,181 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-07 02:07:02,182 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:07:02,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954442309] [2021-11-07 02:07:02,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954442309] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:02,183 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:02,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 02:07:02,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116230388] [2021-11-07 02:07:02,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 02:07:02,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:07:02,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 02:07:02,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-07 02:07:02,185 INFO L87 Difference]: Start difference. First operand 112 states and 122 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-07 02:07:02,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:02,661 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2021-11-07 02:07:02,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:07:02,662 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-07 02:07:02,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:02,663 INFO L225 Difference]: With dead ends: 114 [2021-11-07 02:07:02,663 INFO L226 Difference]: Without dead ends: 114 [2021-11-07 02:07:02,664 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-11-07 02:07:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-11-07 02:07:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2021-11-07 02:07:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 75 states have (on average 1.5466666666666666) 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-07 02:07:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2021-11-07 02:07:02,668 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 11 [2021-11-07 02:07:02,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:02,668 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2021-11-07 02:07:02,669 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-07 02:07:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2021-11-07 02:07:02,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 02:07:02,669 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:02,670 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:02,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 02:07:02,674 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:02,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:02,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1793276823, now seen corresponding path program 1 times [2021-11-07 02:07:02,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:07:02,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040939240] [2021-11-07 02:07:02,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:02,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:07:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:02,772 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-07 02:07:02,772 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:07:02,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040939240] [2021-11-07 02:07:02,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040939240] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:02,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:02,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:07:02,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197080521] [2021-11-07 02:07:02,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:07:02,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:07:02,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:07:02,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:07:02,778 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:02,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:02,975 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2021-11-07 02:07:02,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 02:07:02,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-07 02:07:02,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:02,977 INFO L225 Difference]: With dead ends: 161 [2021-11-07 02:07:02,978 INFO L226 Difference]: Without dead ends: 161 [2021-11-07 02:07:02,978 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-07 02:07:02,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-07 02:07:02,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 113. [2021-11-07 02:07:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 82 states have (on average 1.5121951219512195) internal successors, (124), 112 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-07 02:07:02,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2021-11-07 02:07:02,984 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 12 [2021-11-07 02:07:02,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:02,986 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2021-11-07 02:07:02,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2021-11-07 02:07:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 02:07:02,988 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:02,988 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:02,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 02:07:02,992 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:02,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:02,996 INFO L85 PathProgramCache]: Analyzing trace with hash -50027826, now seen corresponding path program 1 times [2021-11-07 02:07:02,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:07:02,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115553212] [2021-11-07 02:07:02,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:02,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:07:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:03,085 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-07 02:07:03,085 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:07:03,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115553212] [2021-11-07 02:07:03,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115553212] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:03,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:03,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:07:03,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923295498] [2021-11-07 02:07:03,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:07:03,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:07:03,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:07:03,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:07:03,090 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:03,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:03,216 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2021-11-07 02:07:03,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:07:03,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-07 02:07:03,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:03,220 INFO L225 Difference]: With dead ends: 112 [2021-11-07 02:07:03,220 INFO L226 Difference]: Without dead ends: 112 [2021-11-07 02:07:03,221 INFO L786 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-07 02:07:03,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-11-07 02:07:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-11-07 02:07:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.5) internal successors, (123), 111 states have internal predecessors, (123), 0 states have call successors, (0), 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-07 02:07:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2021-11-07 02:07:03,227 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 16 [2021-11-07 02:07:03,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:03,227 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2021-11-07 02:07:03,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2021-11-07 02:07:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 02:07:03,228 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:03,229 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:03,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 02:07:03,229 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:03,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:03,230 INFO L85 PathProgramCache]: Analyzing trace with hash -50027825, now seen corresponding path program 1 times [2021-11-07 02:07:03,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:07:03,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260401813] [2021-11-07 02:07:03,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:03,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:07:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:03,308 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-07 02:07:03,308 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:07:03,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260401813] [2021-11-07 02:07:03,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260401813] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:03,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:03,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:07:03,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088907094] [2021-11-07 02:07:03,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:07:03,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:07:03,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:07:03,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:07:03,311 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:03,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:03,457 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2021-11-07 02:07:03,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:07:03,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-07 02:07:03,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:03,459 INFO L225 Difference]: With dead ends: 111 [2021-11-07 02:07:03,459 INFO L226 Difference]: Without dead ends: 111 [2021-11-07 02:07:03,459 INFO L786 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-07 02:07:03,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-11-07 02:07:03,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-11-07 02:07:03,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 110 states have internal predecessors, (122), 0 states have call successors, (0), 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-07 02:07:03,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2021-11-07 02:07:03,463 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 16 [2021-11-07 02:07:03,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:03,463 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2021-11-07 02:07:03,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2021-11-07 02:07:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:07:03,464 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:03,464 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:03,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 02:07:03,465 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:03,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:03,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2126705211, now seen corresponding path program 1 times [2021-11-07 02:07:03,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:07:03,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789495342] [2021-11-07 02:07:03,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:03,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:07:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:03,562 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-07 02:07:03,563 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:07:03,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789495342] [2021-11-07 02:07:03,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789495342] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:03,563 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:03,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:07:03,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952391512] [2021-11-07 02:07:03,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:07:03,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:07:03,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:07:03,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:07:03,568 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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-07 02:07:03,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:03,690 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2021-11-07 02:07:03,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:07:03,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-11-07 02:07:03,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:03,692 INFO L225 Difference]: With dead ends: 112 [2021-11-07 02:07:03,692 INFO L226 Difference]: Without dead ends: 112 [2021-11-07 02:07:03,692 INFO L786 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-07 02:07:03,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-11-07 02:07:03,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2021-11-07 02:07:03,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 81 states have (on average 1.4814814814814814) 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-07 02:07:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2021-11-07 02:07:03,696 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 17 [2021-11-07 02:07:03,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:03,702 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-11-07 02:07:03,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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-07 02:07:03,703 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2021-11-07 02:07:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 02:07:03,704 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:03,704 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:03,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 02:07:03,704 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:03,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:03,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1503141088, now seen corresponding path program 1 times [2021-11-07 02:07:03,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:07:03,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145535471] [2021-11-07 02:07:03,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:03,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:07:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 02:07:03,717 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 02:07:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 02:07:03,751 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 02:07:03,752 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 02:07:03,753 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 02:07:03,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-11-07 02:07:03,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-11-07 02:07:03,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-11-07 02:07:03,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-11-07 02:07:03,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-11-07 02:07:03,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-11-07 02:07:03,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-11-07 02:07:03,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-11-07 02:07:03,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-11-07 02:07:03,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-11-07 02:07:03,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-11-07 02:07:03,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-11-07 02:07:03,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-11-07 02:07:03,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-11-07 02:07:03,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-11-07 02:07:03,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-11-07 02:07:03,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-11-07 02:07:03,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-11-07 02:07:03,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-11-07 02:07:03,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-11-07 02:07:03,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-11-07 02:07:03,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-11-07 02:07:03,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-11-07 02:07:03,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-11-07 02:07:03,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-11-07 02:07:03,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-11-07 02:07:03,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-11-07 02:07:03,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-11-07 02:07:03,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-11-07 02:07:03,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-11-07 02:07:03,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-11-07 02:07:03,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-11-07 02:07:03,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 02:07:03,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-11-07 02:07:03,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-11-07 02:07:03,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 02:07:03,764 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-11-07 02:07:03,764 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-11-07 02:07:03,764 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-11-07 02:07:03,764 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-11-07 02:07:03,764 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-11-07 02:07:03,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-11-07 02:07:03,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-11-07 02:07:03,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-11-07 02:07:03,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-11-07 02:07:03,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-11-07 02:07:03,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-11-07 02:07:03,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-11-07 02:07:03,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-11-07 02:07:03,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-11-07 02:07:03,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:07:03,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:07:03,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:07:03,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-11-07 02:07:03,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-11-07 02:07:03,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:07:03,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:07:03,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:07:03,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-11-07 02:07:03,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-11-07 02:07:03,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:07:03,770 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:07:03,770 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:07:03,770 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 02:07:03,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 02:07:03,774 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:03,778 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 02:07:03,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:07:03 BoogieIcfgContainer [2021-11-07 02:07:03,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 02:07:03,805 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 02:07:03,805 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 02:07:03,805 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 02:07:03,806 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:06:59" (3/4) ... [2021-11-07 02:07:03,809 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 02:07:03,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 02:07:03,811 INFO L168 Benchmark]: Toolchain (without parser) took 6314.65 ms. Allocated memory was 102.8 MB in the beginning and 159.4 MB in the end (delta: 56.6 MB). Free memory was 69.5 MB in the beginning and 121.4 MB in the end (delta: -51.9 MB). Peak memory consumption was 4.6 MB. Max. memory is 16.1 GB. [2021-11-07 02:07:03,812 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 102.8 MB. Free memory is still 56.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:07:03,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 529.05 ms. Allocated memory is still 102.8 MB. Free memory was 69.3 MB in the beginning and 68.9 MB in the end (delta: 379.6 kB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-07 02:07:03,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.41 ms. Allocated memory is still 102.8 MB. Free memory was 68.9 MB in the beginning and 66.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 02:07:03,813 INFO L168 Benchmark]: Boogie Preprocessor took 34.17 ms. Allocated memory is still 102.8 MB. Free memory was 66.8 MB in the beginning and 65.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 02:07:03,813 INFO L168 Benchmark]: RCFGBuilder took 976.28 ms. Allocated memory was 102.8 MB in the beginning and 132.1 MB in the end (delta: 29.4 MB). Free memory was 64.8 MB in the beginning and 100.8 MB in the end (delta: -36.1 MB). Peak memory consumption was 28.8 MB. Max. memory is 16.1 GB. [2021-11-07 02:07:03,814 INFO L168 Benchmark]: TraceAbstraction took 4675.14 ms. Allocated memory was 132.1 MB in the beginning and 159.4 MB in the end (delta: 27.3 MB). Free memory was 100.1 MB in the beginning and 121.4 MB in the end (delta: -21.3 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2021-11-07 02:07:03,814 INFO L168 Benchmark]: Witness Printer took 5.01 ms. Allocated memory is still 159.4 MB. Free memory is still 121.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:07:03,817 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.30 ms. Allocated memory is still 102.8 MB. Free memory is still 56.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 529.05 ms. Allocated memory is still 102.8 MB. Free memory was 69.3 MB in the beginning and 68.9 MB in the end (delta: 379.6 kB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 74.41 ms. Allocated memory is still 102.8 MB. Free memory was 68.9 MB in the beginning and 66.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.17 ms. Allocated memory is still 102.8 MB. Free memory was 66.8 MB in the beginning and 65.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 976.28 ms. Allocated memory was 102.8 MB in the beginning and 132.1 MB in the end (delta: 29.4 MB). Free memory was 64.8 MB in the beginning and 100.8 MB in the end (delta: -36.1 MB). Peak memory consumption was 28.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4675.14 ms. Allocated memory was 132.1 MB in the beginning and 159.4 MB in the end (delta: 27.3 MB). Free memory was 100.1 MB in the beginning and 121.4 MB in the end (delta: -21.3 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * Witness Printer took 5.01 ms. Allocated memory is still 159.4 MB. Free memory is still 121.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * 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 - UnprovableResult [Line: 1051]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1051. Possible FailurePath: [L1005] SLL* list = malloc(sizeof(SLL)); [L1006] list->next = ((void*)0) [L1007] list->prev = ((void*)0) [L1008] list->colour = BLACK [L1010] SLL* end = list; [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1036] end = ((void*)0) [L1037] end = list [L1040] COND FALSE !(!(((void*)0) != end)) [L1041] EXPR end->colour [L1041] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE ((void*)0) != end [L1045] EXPR end->colour [L1045] COND FALSE !(RED == end->colour) [L1051] EXPR end->next [L1051] COND TRUE !(end->next) [L1051] reach_error() - 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: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: 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: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: 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: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: 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: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: 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: 1040]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1041]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1045]: 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 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 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1002]: 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, 120 locations, 65 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 817 SDtfs, 1011 SDslu, 1036 SDs, 0 SdLazy, 1956 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 121 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 601 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 could not prove your program: unable to determine feasibility of some traces [2021-11-07 02:07:03,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 02:07:06,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 02:07:06,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 02:07:06,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 02:07:06,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 02:07:06,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 02:07:06,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 02:07:06,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 02:07:06,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 02:07:06,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 02:07:06,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 02:07:06,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 02:07:06,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 02:07:06,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 02:07:06,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 02:07:06,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 02:07:06,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 02:07:06,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 02:07:06,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 02:07:06,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 02:07:06,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 02:07:06,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 02:07:06,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 02:07:06,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 02:07:06,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 02:07:06,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 02:07:06,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 02:07:06,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 02:07:06,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 02:07:06,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 02:07:06,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 02:07:06,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 02:07:06,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 02:07:06,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 02:07:06,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 02:07:06,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 02:07:06,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 02:07:06,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 02:07:06,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 02:07:06,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 02:07:06,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 02:07:06,649 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-07 02:07:06,705 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 02:07:06,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 02:07:06,707 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 02:07:06,707 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 02:07:06,708 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 02:07:06,708 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 02:07:06,708 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 02:07:06,708 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 02:07:06,709 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 02:07:06,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 02:07:06,712 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 02:07:06,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 02:07:06,712 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 02:07:06,713 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 02:07:06,713 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 02:07:06,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 02:07:06,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 02:07:06,714 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-07 02:07:06,714 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-07 02:07:06,714 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-07 02:07:06,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 02:07:06,715 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 02:07:06,715 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-07 02:07:06,716 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-07 02:07:06,716 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 02:07:06,716 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 02:07:06,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 02:07:06,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 02:07:06,717 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 02:07:06,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:07:06,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 02:07:06,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 02:07:06,718 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-07 02:07:06,719 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-07 02:07:06,719 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 02:07:06,719 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 02:07:06,720 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/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_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 [2021-11-07 02:07:07,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 02:07:07,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 02:07:07,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 02:07:07,146 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 02:07:07,147 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 02:07:07,148 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-11-07 02:07:07,234 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/data/a34378e77/5d47360ce51c447dbab154f40f0a3e96/FLAGabe547fb1 [2021-11-07 02:07:07,860 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 02:07:07,861 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-11-07 02:07:07,893 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/data/a34378e77/5d47360ce51c447dbab154f40f0a3e96/FLAGabe547fb1 [2021-11-07 02:07:08,161 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/data/a34378e77/5d47360ce51c447dbab154f40f0a3e96 [2021-11-07 02:07:08,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 02:07:08,172 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 02:07:08,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 02:07:08,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 02:07:08,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 02:07:08,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:07:08" (1/1) ... [2021-11-07 02:07:08,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d857283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:08, skipping insertion in model container [2021-11-07 02:07:08,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:07:08" (1/1) ... [2021-11-07 02:07:08,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 02:07:08,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 02:07:08,698 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_9ff9f413-13ba-46e4-b349-614e91502d03/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2021-11-07 02:07:08,701 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_9ff9f413-13ba-46e4-b349-614e91502d03/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2021-11-07 02:07:08,703 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_9ff9f413-13ba-46e4-b349-614e91502d03/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2021-11-07 02:07:08,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:07:08,742 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 02:07:08,819 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_9ff9f413-13ba-46e4-b349-614e91502d03/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2021-11-07 02:07:08,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_9ff9f413-13ba-46e4-b349-614e91502d03/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2021-11-07 02:07:08,835 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_9ff9f413-13ba-46e4-b349-614e91502d03/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2021-11-07 02:07:08,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:07:08,875 INFO L208 MainTranslator]: Completed translation [2021-11-07 02:07:08,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:08 WrapperNode [2021-11-07 02:07:08,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 02:07:08,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 02:07:08,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 02:07:08,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 02:07:08,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:08" (1/1) ... [2021-11-07 02:07:08,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:08" (1/1) ... [2021-11-07 02:07:08,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 02:07:08,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 02:07:08,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 02:07:08,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 02:07:08,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:08" (1/1) ... [2021-11-07 02:07:08,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:08" (1/1) ... [2021-11-07 02:07:08,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:08" (1/1) ... [2021-11-07 02:07:08,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:08" (1/1) ... [2021-11-07 02:07:08,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:08" (1/1) ... [2021-11-07 02:07:08,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:08" (1/1) ... [2021-11-07 02:07:08,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:08" (1/1) ... [2021-11-07 02:07:08,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 02:07:08,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 02:07:08,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 02:07:08,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 02:07:08,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:08" (1/1) ... [2021-11-07 02:07:08,997 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:07:09,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:07:09,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 02:07:09,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 02:07:09,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-07 02:07:09,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 02:07:09,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 02:07:09,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 02:07:09,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 02:07:09,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 02:07:09,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-07 02:07:09,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-07 02:07:09,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 02:07:09,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 02:07:10,111 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 02:07:10,112 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2021-11-07 02:07:10,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:07:10 BoogieIcfgContainer [2021-11-07 02:07:10,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 02:07:10,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 02:07:10,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 02:07:10,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 02:07:10,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:07:08" (1/3) ... [2021-11-07 02:07:10,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@feb9cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:07:10, skipping insertion in model container [2021-11-07 02:07:10,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:08" (2/3) ... [2021-11-07 02:07:10,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@feb9cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:07:10, skipping insertion in model container [2021-11-07 02:07:10,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:07:10" (3/3) ... [2021-11-07 02:07:10,131 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2021-11-07 02:07:10,137 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 02:07:10,138 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2021-11-07 02:07:10,226 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 02:07:10,233 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-07 02:07:10,234 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2021-11-07 02:07:10,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 70 states have (on average 2.1857142857142855) internal successors, (153), 135 states have internal predecessors, (153), 0 states have call successors, (0), 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-07 02:07:10,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-07 02:07:10,262 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:10,263 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-07 02:07:10,264 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:10,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:10,271 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-11-07 02:07:10,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:07:10,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117148099] [2021-11-07 02:07:10,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:10,287 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:07:10,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:07:10,291 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:07:10,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-07 02:07:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:10,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 02:07:10,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:07:10,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-07 02:07:10,476 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-07 02:07:10,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:07:10,504 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-07 02:07:10,506 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:07:10,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117148099] [2021-11-07 02:07:10,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117148099] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:10,509 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:10,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-07 02:07:10,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057758600] [2021-11-07 02:07:10,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:07:10,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 02:07:10,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:07:10,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:07:10,543 INFO L87 Difference]: Start difference. First operand has 136 states, 70 states have (on average 2.1857142857142855) internal successors, (153), 135 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:10,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:10,907 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2021-11-07 02:07:10,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:07:10,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-11-07 02:07:10,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:10,920 INFO L225 Difference]: With dead ends: 137 [2021-11-07 02:07:10,920 INFO L226 Difference]: Without dead ends: 133 [2021-11-07 02:07:10,922 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-07 02:07:10,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-11-07 02:07:10,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2021-11-07 02:07:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 71 states have (on average 1.9154929577464788) internal successors, (136), 128 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2021-11-07 02:07:10,990 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 3 [2021-11-07 02:07:10,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:10,990 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2021-11-07 02:07:10,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:10,991 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2021-11-07 02:07:10,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-07 02:07:10,992 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:10,992 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-07 02:07:11,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-07 02:07:11,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 02:07:11,210 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:11,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:11,211 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-11-07 02:07:11,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:07:11,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766327619] [2021-11-07 02:07:11,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:11,213 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:07:11,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:07:11,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:07:11,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-07 02:07:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:11,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 02:07:11,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:07:11,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-07 02:07:11,329 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-07 02:07:11,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:07:11,404 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-07 02:07:11,405 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:07:11,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766327619] [2021-11-07 02:07:11,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766327619] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:11,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:11,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-07 02:07:11,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577028633] [2021-11-07 02:07:11,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:07:11,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 02:07:11,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:07:11,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:07:11,411 INFO L87 Difference]: Start difference. First operand 129 states and 136 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:11,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:11,879 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2021-11-07 02:07:11,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:07:11,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-11-07 02:07:11,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:11,885 INFO L225 Difference]: With dead ends: 146 [2021-11-07 02:07:11,885 INFO L226 Difference]: Without dead ends: 146 [2021-11-07 02:07:11,886 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:07:11,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-11-07 02:07:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2021-11-07 02:07:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 78 states have (on average 1.794871794871795) internal successors, (140), 132 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-07 02:07:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2021-11-07 02:07:11,898 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 3 [2021-11-07 02:07:11,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:11,899 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2021-11-07 02:07:11,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2021-11-07 02:07:11,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 02:07:11,900 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:11,901 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:11,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-07 02:07:12,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 02:07:12,121 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:12,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:12,122 INFO L85 PathProgramCache]: Analyzing trace with hash 59261803, now seen corresponding path program 1 times [2021-11-07 02:07:12,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:07:12,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208849351] [2021-11-07 02:07:12,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:12,125 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:07:12,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:07:12,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:07:12,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-07 02:07:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:12,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 02:07:12,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:07:12,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-07 02:07:12,321 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-07 02:07:12,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2021-11-07 02:07:12,355 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-07 02:07:12,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:07:12,423 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-07 02:07:12,423 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:07:12,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208849351] [2021-11-07 02:07:12,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208849351] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:12,424 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:12,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-07 02:07:12,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632796197] [2021-11-07 02:07:12,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:07:12,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 02:07:12,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:07:12,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:07:12,427 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-07 02:07:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:12,902 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2021-11-07 02:07:12,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:07:12,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-11-07 02:07:12,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:12,904 INFO L225 Difference]: With dead ends: 138 [2021-11-07 02:07:12,904 INFO L226 Difference]: Without dead ends: 138 [2021-11-07 02:07:12,905 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:07:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-11-07 02:07:12,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 123. [2021-11-07 02:07:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.6419753086419753) internal successors, (133), 122 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2021-11-07 02:07:12,914 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 8 [2021-11-07 02:07:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:12,915 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2021-11-07 02:07:12,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-07 02:07:12,915 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2021-11-07 02:07:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 02:07:12,916 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:12,916 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:12,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-07 02:07:13,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 02:07:13,128 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:13,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:13,129 INFO L85 PathProgramCache]: Analyzing trace with hash 59261804, now seen corresponding path program 1 times [2021-11-07 02:07:13,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:07:13,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679898352] [2021-11-07 02:07:13,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:13,130 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:07:13,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:07:13,132 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:07:13,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-07 02:07:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:13,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-07 02:07:13,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:07:13,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-07 02:07:13,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-07 02:07:13,392 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-07 02:07:13,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2021-11-07 02:07:13,406 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-07 02:07:13,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2021-11-07 02:07:13,458 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-07 02:07:13,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:07:16,575 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-07 02:07:16,575 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:07:16,575 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679898352] [2021-11-07 02:07:16,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679898352] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:16,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:16,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-07 02:07:16,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000829197] [2021-11-07 02:07:16,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 02:07:16,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 02:07:16,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 02:07:16,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2021-11-07 02:07:16,579 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:34,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:34,306 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2021-11-07 02:07:34,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:07:34,308 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-07 02:07:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:34,309 INFO L225 Difference]: With dead ends: 173 [2021-11-07 02:07:34,310 INFO L226 Difference]: Without dead ends: 173 [2021-11-07 02:07:34,310 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=68, Invalid=112, Unknown=2, NotChecked=0, Total=182 [2021-11-07 02:07:34,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-11-07 02:07:34,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 118. [2021-11-07 02:07:34,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 117 states have internal predecessors, (128), 0 states have call successors, (0), 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-07 02:07:34,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2021-11-07 02:07:34,320 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 8 [2021-11-07 02:07:34,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:34,321 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2021-11-07 02:07:34,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:34,321 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2021-11-07 02:07:34,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 02:07:34,322 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:34,322 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:34,348 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-07 02:07:34,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 02:07:34,548 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:34,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:34,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1116012804, now seen corresponding path program 1 times [2021-11-07 02:07:34,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:07:34,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194429393] [2021-11-07 02:07:34,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:34,550 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:07:34,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:07:34,554 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:07:34,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-07 02:07:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:34,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 02:07:34,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:07:34,703 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-07 02:07:34,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:07:34,758 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-07 02:07:34,758 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:07:34,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194429393] [2021-11-07 02:07:34,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194429393] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:34,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:34,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-07 02:07:34,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650357284] [2021-11-07 02:07:34,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:07:34,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 02:07:34,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:07:34,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:07:34,762 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:35,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:35,201 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2021-11-07 02:07:35,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:07:35,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-07 02:07:35,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:35,202 INFO L225 Difference]: With dead ends: 144 [2021-11-07 02:07:35,202 INFO L226 Difference]: Without dead ends: 144 [2021-11-07 02:07:35,203 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-07 02:07:35,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-11-07 02:07:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 116. [2021-11-07 02:07:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 115 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-07 02:07:35,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2021-11-07 02:07:35,216 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 10 [2021-11-07 02:07:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:35,217 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2021-11-07 02:07:35,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2021-11-07 02:07:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:07:35,218 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:35,218 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:35,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-07 02:07:35,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 02:07:35,419 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:35,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:35,419 INFO L85 PathProgramCache]: Analyzing trace with hash 236809587, now seen corresponding path program 1 times [2021-11-07 02:07:35,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:07:35,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131594679] [2021-11-07 02:07:35,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:35,420 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:07:35,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:07:35,423 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:07:35,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-07 02:07:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:35,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 02:07:35,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:07:35,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-07 02:07:35,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-11-07 02:07:35,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-07 02:07:35,649 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-07 02:07:35,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:07:35,719 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-07 02:07:35,719 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:07:35,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131594679] [2021-11-07 02:07:35,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131594679] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:35,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:35,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-07 02:07:35,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616994681] [2021-11-07 02:07:35,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:07:35,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 02:07:35,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:07:35,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:07:35,721 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-07 02:07:36,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:36,388 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2021-11-07 02:07:36,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:07:36,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-07 02:07:36,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:36,389 INFO L225 Difference]: With dead ends: 115 [2021-11-07 02:07:36,389 INFO L226 Difference]: Without dead ends: 115 [2021-11-07 02:07:36,390 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:07:36,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-07 02:07:36,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-11-07 02:07:36,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 114 states have internal predecessors, (123), 0 states have call successors, (0), 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-07 02:07:36,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2021-11-07 02:07:36,397 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 11 [2021-11-07 02:07:36,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:36,397 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2021-11-07 02:07:36,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-07 02:07:36,398 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2021-11-07 02:07:36,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:07:36,399 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:36,399 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:36,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-07 02:07:36,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 02:07:36,612 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:36,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:36,612 INFO L85 PathProgramCache]: Analyzing trace with hash 236809588, now seen corresponding path program 1 times [2021-11-07 02:07:36,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:07:36,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489437061] [2021-11-07 02:07:36,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:36,614 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:07:36,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:07:36,615 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:07:36,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-07 02:07:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:36,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-07 02:07:36,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:07:36,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-07 02:07:36,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-11-07 02:07:36,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 02:07:36,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-11-07 02:07:36,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-11-07 02:07:36,925 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-07 02:07:36,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:07:37,272 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-07 02:07:37,272 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:07:37,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489437061] [2021-11-07 02:07:37,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489437061] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:37,272 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:37,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-07 02:07:37,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991003032] [2021-11-07 02:07:37,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 02:07:37,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 02:07:37,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 02:07:37,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-07 02:07:37,274 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:38,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:38,762 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2021-11-07 02:07:38,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 02:07:38,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:07:38,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:38,765 INFO L225 Difference]: With dead ends: 114 [2021-11-07 02:07:38,765 INFO L226 Difference]: Without dead ends: 114 [2021-11-07 02:07:38,766 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-11-07 02:07:38,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-11-07 02:07:38,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-11-07 02:07:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 113 states have internal predecessors, (122), 0 states have call successors, (0), 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-07 02:07:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2021-11-07 02:07:38,771 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 11 [2021-11-07 02:07:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:38,772 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2021-11-07 02:07:38,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2021-11-07 02:07:38,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 02:07:38,773 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:38,773 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:38,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-07 02:07:38,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 02:07:38,983 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:38,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:38,983 INFO L85 PathProgramCache]: Analyzing trace with hash -200394276, now seen corresponding path program 1 times [2021-11-07 02:07:38,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:07:38,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528971297] [2021-11-07 02:07:38,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:38,984 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:07:38,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:07:38,984 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:07:38,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-07 02:07:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:39,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 02:07:39,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:07:39,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-07 02:07:39,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-07 02:07:39,223 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-07 02:07:39,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:07:39,290 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-07 02:07:39,290 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:07:39,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528971297] [2021-11-07 02:07:39,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528971297] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:39,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:39,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-07 02:07:39,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288879711] [2021-11-07 02:07:39,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:07:39,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 02:07:39,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:07:39,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:07:39,292 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-07 02:07:39,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:39,987 INFO L93 Difference]: Finished difference Result 175 states and 189 transitions. [2021-11-07 02:07:39,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:07:39,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-07 02:07:39,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:39,989 INFO L225 Difference]: With dead ends: 175 [2021-11-07 02:07:39,989 INFO L226 Difference]: Without dead ends: 175 [2021-11-07 02:07:39,989 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:07:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-11-07 02:07:39,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 120. [2021-11-07 02:07:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 89 states have (on average 1.449438202247191) internal successors, (129), 119 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-07 02:07:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2021-11-07 02:07:39,995 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 13 [2021-11-07 02:07:39,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:39,995 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2021-11-07 02:07:39,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-07 02:07:39,996 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2021-11-07 02:07:39,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 02:07:39,997 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:39,997 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:40,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-07 02:07:40,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 02:07:40,203 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:40,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:40,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053835, now seen corresponding path program 1 times [2021-11-07 02:07:40,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:07:40,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325615377] [2021-11-07 02:07:40,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:40,204 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:07:40,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:07:40,205 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:07:40,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-07 02:07:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:40,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-07 02:07:40,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:07:40,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-07 02:07:40,469 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-07 02:07:40,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2021-11-07 02:07:40,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-11-07 02:07:40,835 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-07 02:07:40,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 33 [2021-11-07 02:07:41,041 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-07 02:07:41,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 38 [2021-11-07 02:07:41,246 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-07 02:07:41,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:07:43,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|) c_ULTIMATE.start_main_~end~0.base)) c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset))))))) (_ bv1 1)))) is different from false [2021-11-07 02:07:45,383 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|) c_ULTIMATE.start_main_~end~0.base))) c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset))))))))))) (_ bv1 1)))) is different from false [2021-11-07 02:07:45,517 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-07 02:07:45,518 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:07:45,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325615377] [2021-11-07 02:07:45,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325615377] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:07:45,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:07:45,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [] total 14 [2021-11-07 02:07:45,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776905497] [2021-11-07 02:07:45,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 02:07:45,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 02:07:45,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 02:07:45,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=119, Unknown=2, NotChecked=46, Total=210 [2021-11-07 02:07:45,521 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 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-07 02:07:48,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:48,426 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2021-11-07 02:07:48,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 02:07:48,426 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 02:07:48,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:48,428 INFO L225 Difference]: With dead ends: 141 [2021-11-07 02:07:48,428 INFO L226 Difference]: Without dead ends: 141 [2021-11-07 02:07:48,428 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=134, Invalid=334, Unknown=2, NotChecked=82, Total=552 [2021-11-07 02:07:48,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-11-07 02:07:48,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2021-11-07 02:07:48,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 118 states have internal predecessors, (128), 0 states have call successors, (0), 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-07 02:07:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2021-11-07 02:07:48,433 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 15 [2021-11-07 02:07:48,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:48,434 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2021-11-07 02:07:48,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 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-07 02:07:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2021-11-07 02:07:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 02:07:48,435 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:48,435 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:48,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-07 02:07:48,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 02:07:48,636 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:07:48,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:48,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053834, now seen corresponding path program 1 times [2021-11-07 02:07:48,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:07:48,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955685454] [2021-11-07 02:07:48,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:48,637 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:07:48,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:07:48,641 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:07:48,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-07 02:07:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:48,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-07 02:07:48,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:07:48,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-07 02:07:48,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-07 02:07:48,905 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-07 02:07:48,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-11-07 02:07:48,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-11-07 02:07:48,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 02:07:49,169 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-07 02:07:49,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 49 [2021-11-07 02:07:49,204 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-11-07 02:07:49,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2021-11-07 02:07:49,384 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-07 02:07:49,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 42 [2021-11-07 02:07:49,394 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-07 02:07:49,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 19 [2021-11-07 02:07:49,496 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-07 02:07:49,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:07:51,858 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base|) .cse0 c_ULTIMATE.start_main_~end~0.offset)) c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base|) .cse0 c_ULTIMATE.start_main_~end~0.base)) c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset))))) (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|) c_ULTIMATE.start_main_~end~0.offset)) c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2021-11-07 02:08:00,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 02:08:00,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 02:08:01,119 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-07 02:08:01,120 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:08:01,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955685454] [2021-11-07 02:08:01,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955685454] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:01,120 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:01,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2021-11-07 02:08:01,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784097230] [2021-11-07 02:08:01,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 02:08:01,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 02:08:01,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 02:08:01,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=170, Unknown=3, NotChecked=26, Total=240 [2021-11-07 02:08:01,123 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:12,901 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2021-11-07 02:08:12,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-07 02:08:12,902 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 02:08:12,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:12,903 INFO L225 Difference]: With dead ends: 141 [2021-11-07 02:08:12,903 INFO L226 Difference]: Without dead ends: 141 [2021-11-07 02:08:12,904 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=328, Invalid=933, Unknown=3, NotChecked=68, Total=1332 [2021-11-07 02:08:12,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-11-07 02:08:12,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 116. [2021-11-07 02:08:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.404494382022472) internal successors, (125), 115 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2021-11-07 02:08:12,909 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 15 [2021-11-07 02:08:12,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:12,909 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2021-11-07 02:08:12,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:12,910 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2021-11-07 02:08:12,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 02:08:12,911 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:12,911 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:08:12,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-07 02:08:13,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 02:08:13,118 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:08:13,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:13,119 INFO L85 PathProgramCache]: Analyzing trace with hash -715208061, now seen corresponding path program 1 times [2021-11-07 02:08:13,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:08:13,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284506450] [2021-11-07 02:08:13,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:13,119 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:08:13,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:08:13,120 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:08:13,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-07 02:08:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:13,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 02:08:13,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:08:13,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-07 02:08:13,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-07 02:08:13,373 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-07 02:08:13,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:08:13,509 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-07 02:08:13,509 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 02:08:13,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284506450] [2021-11-07 02:08:13,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284506450] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:08:13,510 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:08:13,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-07 02:08:13,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711707756] [2021-11-07 02:08:13,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 02:08:13,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 02:08:13,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 02:08:13,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-07 02:08:13,513 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:14,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:08:14,086 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2021-11-07 02:08:14,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:08:14,086 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-07 02:08:14,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:08:14,087 INFO L225 Difference]: With dead ends: 169 [2021-11-07 02:08:14,088 INFO L226 Difference]: Without dead ends: 169 [2021-11-07 02:08:14,088 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:08:14,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-11-07 02:08:14,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 120. [2021-11-07 02:08:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 119 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-07 02:08:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2021-11-07 02:08:14,093 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 19 [2021-11-07 02:08:14,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:08:14,093 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2021-11-07 02:08:14,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:08:14,094 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2021-11-07 02:08:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 02:08:14,095 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:08:14,095 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:08:14,111 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-11-07 02:08:14,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 02:08:14,308 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-11-07 02:08:14,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:08:14,309 INFO L85 PathProgramCache]: Analyzing trace with hash -714897179, now seen corresponding path program 1 times [2021-11-07 02:08:14,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 02:08:14,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832024100] [2021-11-07 02:08:14,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:08:14,310 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 02:08:14,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 02:08:14,311 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 02:08:14,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-07 02:08:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 02:08:14,497 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 02:08:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 02:08:14,599 INFO L133 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2021-11-07 02:08:14,600 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 02:08:14,601 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 02:08:14,603 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-11-07 02:08:14,603 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-11-07 02:08:14,603 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-11-07 02:08:14,609 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-11-07 02:08:14,609 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-11-07 02:08:14,609 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-11-07 02:08:14,609 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-11-07 02:08:14,610 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-11-07 02:08:14,610 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-11-07 02:08:14,610 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-11-07 02:08:14,610 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-11-07 02:08:14,610 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-11-07 02:08:14,611 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-11-07 02:08:14,611 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-11-07 02:08:14,611 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-11-07 02:08:14,611 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-11-07 02:08:14,611 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-11-07 02:08:14,612 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-11-07 02:08:14,612 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-11-07 02:08:14,612 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-11-07 02:08:14,612 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-11-07 02:08:14,612 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-11-07 02:08:14,613 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-11-07 02:08:14,613 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-11-07 02:08:14,613 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-11-07 02:08:14,613 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-11-07 02:08:14,613 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-11-07 02:08:14,614 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-11-07 02:08:14,614 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-11-07 02:08:14,614 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-11-07 02:08:14,614 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-11-07 02:08:14,615 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-11-07 02:08:14,619 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 02:08:14,619 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-11-07 02:08:14,619 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-11-07 02:08:14,619 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 02:08:14,620 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-11-07 02:08:14,620 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-11-07 02:08:14,620 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-11-07 02:08:14,620 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-11-07 02:08:14,620 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-11-07 02:08:14,621 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-11-07 02:08:14,621 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-11-07 02:08:14,621 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-11-07 02:08:14,621 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-11-07 02:08:14,621 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-11-07 02:08:14,622 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-11-07 02:08:14,622 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-11-07 02:08:14,622 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-11-07 02:08:14,622 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-11-07 02:08:14,622 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:08:14,623 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:08:14,623 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:08:14,638 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-11-07 02:08:14,638 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-11-07 02:08:14,639 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:08:14,639 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:08:14,639 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:08:14,639 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-11-07 02:08:14,639 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-11-07 02:08:14,640 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:08:14,640 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:08:14,640 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 02:08:14,640 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 02:08:14,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-07 02:08:14,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 02:08:14,844 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:08:14,847 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 02:08:14,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:08:14 BoogieIcfgContainer [2021-11-07 02:08:14,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 02:08:14,881 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 02:08:14,881 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 02:08:14,881 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 02:08:14,882 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:07:10" (3/4) ... [2021-11-07 02:08:14,885 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 02:08:14,885 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 02:08:14,887 INFO L168 Benchmark]: Toolchain (without parser) took 66714.26 ms. Allocated memory was 94.4 MB in the beginning and 144.7 MB in the end (delta: 50.3 MB). Free memory was 57.1 MB in the beginning and 60.1 MB in the end (delta: -3.0 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.1 GB. [2021-11-07 02:08:14,887 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 94.4 MB. Free memory is still 75.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:08:14,893 INFO L168 Benchmark]: CACSL2BoogieTranslator took 702.59 ms. Allocated memory is still 94.4 MB. Free memory was 56.8 MB in the beginning and 70.8 MB in the end (delta: -13.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.1 GB. [2021-11-07 02:08:14,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.37 ms. Allocated memory is still 94.4 MB. Free memory was 70.8 MB in the beginning and 68.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 02:08:14,895 INFO L168 Benchmark]: Boogie Preprocessor took 44.58 ms. Allocated memory is still 94.4 MB. Free memory was 68.6 MB in the beginning and 66.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 02:08:14,896 INFO L168 Benchmark]: RCFGBuilder took 1130.87 ms. Allocated memory is still 94.4 MB. Free memory was 66.5 MB in the beginning and 44.6 MB in the end (delta: 21.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-11-07 02:08:14,897 INFO L168 Benchmark]: TraceAbstraction took 64758.02 ms. Allocated memory was 94.4 MB in the beginning and 144.7 MB in the end (delta: 50.3 MB). Free memory was 44.1 MB in the beginning and 61.2 MB in the end (delta: -17.1 MB). Peak memory consumption was 35.4 MB. Max. memory is 16.1 GB. [2021-11-07 02:08:14,897 INFO L168 Benchmark]: Witness Printer took 4.81 ms. Allocated memory is still 144.7 MB. Free memory was 61.2 MB in the beginning and 60.1 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:08:14,900 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.31 ms. Allocated memory is still 94.4 MB. Free memory is still 75.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 702.59 ms. Allocated memory is still 94.4 MB. Free memory was 56.8 MB in the beginning and 70.8 MB in the end (delta: -13.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 65.37 ms. Allocated memory is still 94.4 MB. Free memory was 70.8 MB in the beginning and 68.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 44.58 ms. Allocated memory is still 94.4 MB. Free memory was 68.6 MB in the beginning and 66.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1130.87 ms. Allocated memory is still 94.4 MB. Free memory was 66.5 MB in the beginning and 44.6 MB in the end (delta: 21.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 64758.02 ms. Allocated memory was 94.4 MB in the beginning and 144.7 MB in the end (delta: 50.3 MB). Free memory was 44.1 MB in the beginning and 61.2 MB in the end (delta: -17.1 MB). Peak memory consumption was 35.4 MB. Max. memory is 16.1 GB. * Witness Printer took 4.81 ms. Allocated memory is still 144.7 MB. Free memory was 61.2 MB in the beginning and 60.1 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * 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 - UnprovableResult [Line: 1051]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1051. Possible FailurePath: [L1005] SLL* list = malloc(sizeof(SLL)); [L1006] list->next = ((void*)0) [L1007] list->prev = ((void*)0) [L1008] list->colour = BLACK [L1010] SLL* end = list; [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1036] end = ((void*)0) [L1037] end = list [L1040] COND FALSE !(!(((void*)0) != end)) [L1041] EXPR end->colour [L1041] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE ((void*)0) != end [L1045] EXPR end->colour [L1045] COND FALSE !(RED == end->colour) [L1051] EXPR end->next [L1051] COND TRUE !(end->next) [L1051] reach_error() - 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: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: 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: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: 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: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: 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: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: 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: 1040]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1041]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1045]: 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 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 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1002]: 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, 136 locations, 65 error locations. Started 1 CEGAR loops. OverallTime: 64.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 37.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 776 SDtfs, 1536 SDslu, 1474 SDs, 0 SdLazy, 2639 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 147 SyntacticMatches, 6 SemanticMatches, 105 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 42.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=0, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 266 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 22.6s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 210 ConstructedInterpolants, 22 QuantifiedInterpolants, 2295 SizeOfPredicates, 52 NumberOfNonLiveVariables, 666 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 could not prove your program: unable to determine feasibility of some traces [2021-11-07 02:08:14,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff9f413-13ba-46e4-b349-614e91502d03/bin/utaipan-UUZaoUuFF8/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 Result: UNKNOWN: Overapproximated counterexample