./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 57096758 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d3671f-f8f6-4080-963c-58eac4e3e719/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d3671f-f8f6-4080-963c-58eac4e3e719/bin/utaipan-mTDlp9Zugs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d3671f-f8f6-4080-963c-58eac4e3e719/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d3671f-f8f6-4080-963c-58eac4e3e719/bin/utaipan-mTDlp9Zugs/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d3671f-f8f6-4080-963c-58eac4e3e719/bin/utaipan-mTDlp9Zugs/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d3671f-f8f6-4080-963c-58eac4e3e719/bin/utaipan-mTDlp9Zugs --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 95135695b4ab9cb9c416390540cae35b9fbb32e4 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-5709675 [2021-10-16 02:34:36,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 02:34:36,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 02:34:36,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 02:34:36,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 02:34:36,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 02:34:36,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 02:34:36,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 02:34:36,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 02:34:36,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 02:34:36,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 02:34:36,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 02:34:36,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 02:34:36,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 02:34:36,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 02:34:36,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 02:34:36,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 02:34:36,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 02:34:36,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 02:34:36,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 02:34:36,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 02:34:36,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 02:34:36,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 02:34:36,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 02:34:36,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 02:34:36,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 02:34:36,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 02:34:36,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 02:34:36,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 02:34:36,885 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 02:34:36,885 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 02:34:36,886 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 02:34:36,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 02:34:36,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 02:34:36,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 02:34:36,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 02:34:36,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 02:34:36,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 02:34:36,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 02:34:36,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 02:34:36,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 02:34:36,894 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d3671f-f8f6-4080-963c-58eac4e3e719/bin/utaipan-mTDlp9Zugs/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-10-16 02:34:36,935 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 02:34:36,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 02:34:36,937 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 02:34:36,937 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 02:34:36,938 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 02:34:36,938 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 02:34:36,938 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-16 02:34:36,938 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 02:34:36,939 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 02:34:36,939 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-16 02:34:36,940 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-16 02:34:36,940 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 02:34:36,941 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-16 02:34:36,941 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-16 02:34:36,941 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-16 02:34:36,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-16 02:34:36,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-16 02:34:36,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 02:34:36,943 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 02:34:36,943 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-16 02:34:36,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-16 02:34:36,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 02:34:36,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 02:34:36,944 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-16 02:34:36,944 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-16 02:34:36,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 02:34:36,946 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 02:34:36,946 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 02:34:36,946 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 02:34:36,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 02:34:36,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 02:34:36,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:34:36,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 02:34:36,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 02:34:36,948 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-16 02:34:36,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-16 02:34:36,948 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 02:34:36,949 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 02:34:36,949 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_a3d3671f-f8f6-4080-963c-58eac4e3e719/bin/utaipan-mTDlp9Zugs/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_a3d3671f-f8f6-4080-963c-58eac4e3e719/bin/utaipan-mTDlp9Zugs Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 95135695b4ab9cb9c416390540cae35b9fbb32e4 [2021-10-16 02:34:37,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 02:34:37,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 02:34:37,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 02:34:37,240 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 02:34:37,240 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 02:34:37,241 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d3671f-f8f6-4080-963c-58eac4e3e719/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/forester-heap/sll-token-1.i [2021-10-16 02:34:37,314 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d3671f-f8f6-4080-963c-58eac4e3e719/bin/utaipan-mTDlp9Zugs/data/3eab899ed/44345950f7ca47c1899790776bdd75c9/FLAG4d6d32261 [2021-10-16 02:34:37,819 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 02:34:37,819 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d3671f-f8f6-4080-963c-58eac4e3e719/sv-benchmarks/c/forester-heap/sll-token-1.i [2021-10-16 02:34:37,832 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d3671f-f8f6-4080-963c-58eac4e3e719/bin/utaipan-mTDlp9Zugs/data/3eab899ed/44345950f7ca47c1899790776bdd75c9/FLAG4d6d32261 [2021-10-16 02:34:38,122 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d3671f-f8f6-4080-963c-58eac4e3e719/bin/utaipan-mTDlp9Zugs/data/3eab899ed/44345950f7ca47c1899790776bdd75c9 [2021-10-16 02:34:38,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 02:34:38,125 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 02:34:38,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 02:34:38,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 02:34:38,130 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 02:34:38,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:34:38" (1/1) ... [2021-10-16 02:34:38,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13dfd20a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:38, skipping insertion in model container [2021-10-16 02:34:38,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:34:38" (1/1) ... [2021-10-16 02:34:38,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 02:34:38,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 02:34:38,469 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_a3d3671f-f8f6-4080-963c-58eac4e3e719/sv-benchmarks/c/forester-heap/sll-token-1.i[22162,22175] [2021-10-16 02:34:38,473 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_a3d3671f-f8f6-4080-963c-58eac4e3e719/sv-benchmarks/c/forester-heap/sll-token-1.i[22311,22324] [2021-10-16 02:34:38,475 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_a3d3671f-f8f6-4080-963c-58eac4e3e719/sv-benchmarks/c/forester-heap/sll-token-1.i[22402,22415] [2021-10-16 02:34:38,476 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_a3d3671f-f8f6-4080-963c-58eac4e3e719/sv-benchmarks/c/forester-heap/sll-token-1.i[22484,22497] [2021-10-16 02:34:38,477 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_a3d3671f-f8f6-4080-963c-58eac4e3e719/sv-benchmarks/c/forester-heap/sll-token-1.i[22562,22575] [2021-10-16 02:34:38,479 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_a3d3671f-f8f6-4080-963c-58eac4e3e719/sv-benchmarks/c/forester-heap/sll-token-1.i[22708,22721] [2021-10-16 02:34:38,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:34:38,490 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 02:34:38,522 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_a3d3671f-f8f6-4080-963c-58eac4e3e719/sv-benchmarks/c/forester-heap/sll-token-1.i[22162,22175] [2021-10-16 02:34:38,524 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_a3d3671f-f8f6-4080-963c-58eac4e3e719/sv-benchmarks/c/forester-heap/sll-token-1.i[22311,22324] [2021-10-16 02:34:38,525 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_a3d3671f-f8f6-4080-963c-58eac4e3e719/sv-benchmarks/c/forester-heap/sll-token-1.i[22402,22415] [2021-10-16 02:34:38,526 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_a3d3671f-f8f6-4080-963c-58eac4e3e719/sv-benchmarks/c/forester-heap/sll-token-1.i[22484,22497] [2021-10-16 02:34:38,527 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_a3d3671f-f8f6-4080-963c-58eac4e3e719/sv-benchmarks/c/forester-heap/sll-token-1.i[22562,22575] [2021-10-16 02:34:38,529 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_a3d3671f-f8f6-4080-963c-58eac4e3e719/sv-benchmarks/c/forester-heap/sll-token-1.i[22708,22721] [2021-10-16 02:34:38,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:34:38,557 INFO L208 MainTranslator]: Completed translation [2021-10-16 02:34:38,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:38 WrapperNode [2021-10-16 02:34:38,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 02:34:38,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 02:34:38,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 02:34:38,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 02:34:38,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:38" (1/1) ... [2021-10-16 02:34:38,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:38" (1/1) ... [2021-10-16 02:34:38,602 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 02:34:38,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 02:34:38,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 02:34:38,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 02:34:38,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:38" (1/1) ... [2021-10-16 02:34:38,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:38" (1/1) ... [2021-10-16 02:34:38,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:38" (1/1) ... [2021-10-16 02:34:38,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:38" (1/1) ... [2021-10-16 02:34:38,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:38" (1/1) ... [2021-10-16 02:34:38,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:38" (1/1) ... [2021-10-16 02:34:38,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:38" (1/1) ... [2021-10-16 02:34:38,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 02:34:38,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 02:34:38,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 02:34:38,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 02:34:38,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:38" (1/1) ... [2021-10-16 02:34:38,643 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:34:38,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d3671f-f8f6-4080-963c-58eac4e3e719/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:34:38,670 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d3671f-f8f6-4080-963c-58eac4e3e719/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 02:34:38,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d3671f-f8f6-4080-963c-58eac4e3e719/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 02:34:38,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-16 02:34:38,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-16 02:34:38,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-16 02:34:38,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-16 02:34:38,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 02:34:38,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-16 02:34:38,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-16 02:34:38,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-16 02:34:38,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 02:34:38,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 02:34:39,391 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 02:34:39,392 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-10-16 02:34:39,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:34:39 BoogieIcfgContainer [2021-10-16 02:34:39,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 02:34:39,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 02:34:39,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 02:34:39,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 02:34:39,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:34:38" (1/3) ... [2021-10-16 02:34:39,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7db247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:34:39, skipping insertion in model container [2021-10-16 02:34:39,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:38" (2/3) ... [2021-10-16 02:34:39,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7db247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:34:39, skipping insertion in model container [2021-10-16 02:34:39,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:34:39" (3/3) ... [2021-10-16 02:34:39,402 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-token-1.i [2021-10-16 02:34:39,408 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 02:34:39,408 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2021-10-16 02:34:39,452 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 02:34:39,458 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, mConcurrency=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-10-16 02:34:39,458 INFO L340 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2021-10-16 02:34:39,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 53 states have (on average 2.4716981132075473) internal successors, (131), 107 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-10-16 02:34:39,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-16 02:34:39,481 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:39,481 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-16 02:34:39,482 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-16 02:34:39,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:39,487 INFO L82 PathProgramCache]: Analyzing trace with hash 8405, now seen corresponding path program 1 times [2021-10-16 02:34:39,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:39,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520757593] [2021-10-16 02:34:39,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:39,497 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:39,647 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:39,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520757593] [2021-10-16 02:34:39,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520757593] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:39,648 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:39,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-16 02:34:39,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72547578] [2021-10-16 02:34:39,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:34:39,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:39,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:34:39,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:34:39,671 INFO L87 Difference]: Start difference. First operand has 108 states, 53 states have (on average 2.4716981132075473) internal successors, (131), 107 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) 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-10-16 02:34:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:39,789 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2021-10-16 02:34:39,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:34:39,791 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-10-16 02:34:39,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:39,801 INFO L225 Difference]: With dead ends: 126 [2021-10-16 02:34:39,801 INFO L226 Difference]: Without dead ends: 125 [2021-10-16 02:34:39,802 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:34:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-10-16 02:34:39,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 105. [2021-10-16 02:34:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 53 states have (on average 2.018867924528302) internal successors, (107), 104 states have internal predecessors, (107), 0 states have call successors, (0), 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-10-16 02:34:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2021-10-16 02:34:39,848 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 2 [2021-10-16 02:34:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:39,849 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2021-10-16 02:34:39,849 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-10-16 02:34:39,849 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2021-10-16 02:34:39,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-16 02:34:39,850 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:39,850 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-16 02:34:39,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-16 02:34:39,851 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-16 02:34:39,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash 8406, now seen corresponding path program 1 times [2021-10-16 02:34:39,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:39,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134311785] [2021-10-16 02:34:39,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:39,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:39,933 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:39,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134311785] [2021-10-16 02:34:39,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134311785] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:39,934 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:39,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-16 02:34:39,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525086043] [2021-10-16 02:34:39,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:34:39,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:39,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:34:39,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:34:39,940 INFO L87 Difference]: Start difference. First operand 105 states and 107 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-10-16 02:34:40,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:40,053 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2021-10-16 02:34:40,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:34:40,054 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-10-16 02:34:40,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:40,060 INFO L225 Difference]: With dead ends: 131 [2021-10-16 02:34:40,060 INFO L226 Difference]: Without dead ends: 131 [2021-10-16 02:34:40,061 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:34:40,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-10-16 02:34:40,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 103. [2021-10-16 02:34:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 102 states have internal predecessors, (105), 0 states have call successors, (0), 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-10-16 02:34:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2021-10-16 02:34:40,076 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 2 [2021-10-16 02:34:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:40,077 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2021-10-16 02:34:40,077 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-10-16 02:34:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2021-10-16 02:34:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-16 02:34:40,078 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:40,078 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-16 02:34:40,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-16 02:34:40,078 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-16 02:34:40,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:40,079 INFO L82 PathProgramCache]: Analyzing trace with hash -821381070, now seen corresponding path program 1 times [2021-10-16 02:34:40,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:40,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491006189] [2021-10-16 02:34:40,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:40,080 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:40,125 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:40,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491006189] [2021-10-16 02:34:40,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491006189] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:40,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:40,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:34:40,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313673980] [2021-10-16 02:34:40,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:34:40,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:40,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:34:40,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:34:40,128 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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-10-16 02:34:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:40,267 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2021-10-16 02:34:40,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:34:40,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-10-16 02:34:40,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:40,269 INFO L225 Difference]: With dead ends: 109 [2021-10-16 02:34:40,269 INFO L226 Difference]: Without dead ends: 109 [2021-10-16 02:34:40,270 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:34:40,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-10-16 02:34:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 92. [2021-10-16 02:34:40,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 91 states have internal predecessors, (96), 0 states have call successors, (0), 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-10-16 02:34:40,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2021-10-16 02:34:40,288 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 6 [2021-10-16 02:34:40,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:40,289 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2021-10-16 02:34:40,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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-10-16 02:34:40,289 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2021-10-16 02:34:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-16 02:34:40,290 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:40,290 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-16 02:34:40,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-16 02:34:40,290 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-16 02:34:40,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:40,291 INFO L82 PathProgramCache]: Analyzing trace with hash -821381069, now seen corresponding path program 1 times [2021-10-16 02:34:40,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:40,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980302360] [2021-10-16 02:34:40,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:40,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:40,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-10-16 02:34:40,421 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:40,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980302360] [2021-10-16 02:34:40,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980302360] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:40,423 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:40,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:34:40,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417734635] [2021-10-16 02:34:40,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:34:40,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:40,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:34:40,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:34:40,425 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-10-16 02:34:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:40,627 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2021-10-16 02:34:40,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:34:40,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-10-16 02:34:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:40,629 INFO L225 Difference]: With dead ends: 166 [2021-10-16 02:34:40,629 INFO L226 Difference]: Without dead ends: 166 [2021-10-16 02:34:40,630 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:34:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-10-16 02:34:40,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 119. [2021-10-16 02:34:40,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 82 states have (on average 1.5853658536585367) internal successors, (130), 118 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:34:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2021-10-16 02:34:40,648 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 6 [2021-10-16 02:34:40,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:40,648 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2021-10-16 02:34:40,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-10-16 02:34:40,648 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2021-10-16 02:34:40,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-16 02:34:40,649 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:40,649 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:40,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-16 02:34:40,649 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-16 02:34:40,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:40,652 INFO L82 PathProgramCache]: Analyzing trace with hash 927018906, now seen corresponding path program 1 times [2021-10-16 02:34:40,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:40,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045394385] [2021-10-16 02:34:40,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:40,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:40,745 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:40,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045394385] [2021-10-16 02:34:40,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045394385] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:40,746 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:40,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 02:34:40,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222430127] [2021-10-16 02:34:40,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 02:34:40,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:40,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 02:34:40,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:34:40,748 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-10-16 02:34:40,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:40,896 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2021-10-16 02:34:40,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:34:40,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-10-16 02:34:40,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:40,899 INFO L225 Difference]: With dead ends: 118 [2021-10-16 02:34:40,899 INFO L226 Difference]: Without dead ends: 118 [2021-10-16 02:34:40,899 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 23.9ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-16 02:34:40,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-10-16 02:34:40,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-10-16 02:34:40,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 82 states have (on average 1.5731707317073171) internal successors, (129), 117 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-10-16 02:34:40,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2021-10-16 02:34:40,903 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 8 [2021-10-16 02:34:40,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:40,903 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2021-10-16 02:34:40,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-10-16 02:34:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2021-10-16 02:34:40,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-16 02:34:40,907 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:40,908 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:40,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-16 02:34:40,908 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-16 02:34:40,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:40,909 INFO L82 PathProgramCache]: Analyzing trace with hash 927018907, now seen corresponding path program 1 times [2021-10-16 02:34:40,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:40,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054763866] [2021-10-16 02:34:40,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:40,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:41,024 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:41,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054763866] [2021-10-16 02:34:41,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054763866] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:41,025 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:41,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 02:34:41,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749925267] [2021-10-16 02:34:41,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 02:34:41,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:41,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 02:34:41,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:34:41,031 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-10-16 02:34:41,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:41,214 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2021-10-16 02:34:41,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-16 02:34:41,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-10-16 02:34:41,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:41,216 INFO L225 Difference]: With dead ends: 115 [2021-10-16 02:34:41,216 INFO L226 Difference]: Without dead ends: 115 [2021-10-16 02:34:41,216 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 44.6ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-16 02:34:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-10-16 02:34:41,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2021-10-16 02:34:41,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 104 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:34:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2021-10-16 02:34:41,219 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 8 [2021-10-16 02:34:41,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:41,220 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2021-10-16 02:34:41,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-10-16 02:34:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2021-10-16 02:34:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-16 02:34:41,220 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:41,221 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:41,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-16 02:34:41,221 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-16 02:34:41,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:41,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1329117493, now seen corresponding path program 1 times [2021-10-16 02:34:41,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:41,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252925670] [2021-10-16 02:34:41,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:41,224 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:41,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:41,307 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:41,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252925670] [2021-10-16 02:34:41,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252925670] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:41,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:41,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 02:34:41,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547438444] [2021-10-16 02:34:41,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 02:34:41,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:41,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 02:34:41,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:34:41,309 INFO L87 Difference]: Start difference. First operand 105 states and 115 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-10-16 02:34:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:41,410 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2021-10-16 02:34:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:34:41,411 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-10-16 02:34:41,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:41,412 INFO L225 Difference]: With dead ends: 104 [2021-10-16 02:34:41,412 INFO L226 Difference]: Without dead ends: 104 [2021-10-16 02:34:41,413 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-16 02:34:41,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-16 02:34:41,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-10-16 02:34:41,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 75 states have (on average 1.52) internal successors, (114), 103 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:34:41,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2021-10-16 02:34:41,416 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 9 [2021-10-16 02:34:41,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:41,416 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2021-10-16 02:34:41,417 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-10-16 02:34:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2021-10-16 02:34:41,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-16 02:34:41,417 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:41,417 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:41,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-16 02:34:41,418 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-16 02:34:41,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:41,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1329117492, now seen corresponding path program 1 times [2021-10-16 02:34:41,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:41,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265568324] [2021-10-16 02:34:41,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:41,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:41,521 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:41,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265568324] [2021-10-16 02:34:41,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265568324] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:41,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:41,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 02:34:41,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368098501] [2021-10-16 02:34:41,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 02:34:41,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:41,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 02:34:41,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:34:41,523 INFO L87 Difference]: Start difference. First operand 104 states and 114 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-10-16 02:34:41,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:41,629 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2021-10-16 02:34:41,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:34:41,630 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-10-16 02:34:41,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:41,631 INFO L225 Difference]: With dead ends: 103 [2021-10-16 02:34:41,631 INFO L226 Difference]: Without dead ends: 103 [2021-10-16 02:34:41,631 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-16 02:34:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-10-16 02:34:41,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-10-16 02:34:41,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 102 states have internal predecessors, (113), 0 states have call successors, (0), 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-10-16 02:34:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2021-10-16 02:34:41,635 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 9 [2021-10-16 02:34:41,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:41,635 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2021-10-16 02:34:41,635 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-10-16 02:34:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2021-10-16 02:34:41,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-16 02:34:41,637 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:41,639 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:41,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-16 02:34:41,640 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-16 02:34:41,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:41,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1806938586, now seen corresponding path program 1 times [2021-10-16 02:34:41,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:41,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78453184] [2021-10-16 02:34:41,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:41,641 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:41,695 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:41,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78453184] [2021-10-16 02:34:41,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78453184] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:41,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:41,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-16 02:34:41,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207234821] [2021-10-16 02:34:41,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 02:34:41,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:41,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 02:34:41,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:34:41,702 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:34:41,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:41,805 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2021-10-16 02:34:41,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-16 02:34:41,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-16 02:34:41,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:41,806 INFO L225 Difference]: With dead ends: 109 [2021-10-16 02:34:41,806 INFO L226 Difference]: Without dead ends: 109 [2021-10-16 02:34:41,807 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 19.6ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-16 02:34:41,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-10-16 02:34:41,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2021-10-16 02:34:41,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.5) internal successors, (111), 100 states have internal predecessors, (111), 0 states have call successors, (0), 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-10-16 02:34:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2021-10-16 02:34:41,809 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 10 [2021-10-16 02:34:41,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:41,810 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2021-10-16 02:34:41,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:34:41,810 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2021-10-16 02:34:41,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-16 02:34:41,811 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:41,811 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:41,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-16 02:34:41,811 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-16 02:34:41,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:41,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1676451459, now seen corresponding path program 1 times [2021-10-16 02:34:41,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:41,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357649462] [2021-10-16 02:34:41,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:41,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:41,840 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:41,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357649462] [2021-10-16 02:34:41,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357649462] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:41,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:41,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:34:41,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271211935] [2021-10-16 02:34:41,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:34:41,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:41,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:34:41,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:34:41,842 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-10-16 02:34:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:41,937 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2021-10-16 02:34:41,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:34:41,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-10-16 02:34:41,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:41,939 INFO L225 Difference]: With dead ends: 150 [2021-10-16 02:34:41,939 INFO L226 Difference]: Without dead ends: 150 [2021-10-16 02:34:41,939 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:34:41,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-10-16 02:34:41,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 99. [2021-10-16 02:34:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 98 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:34:41,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2021-10-16 02:34:41,942 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 11 [2021-10-16 02:34:41,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:41,943 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2021-10-16 02:34:41,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-10-16 02:34:41,943 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2021-10-16 02:34:41,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-16 02:34:41,944 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:41,944 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:41,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-16 02:34:41,944 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-16 02:34:41,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:41,944 INFO L82 PathProgramCache]: Analyzing trace with hash 935207482, now seen corresponding path program 1 times [2021-10-16 02:34:41,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:41,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957962143] [2021-10-16 02:34:41,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:41,945 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-16 02:34:41,963 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-16 02:34:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-16 02:34:42,021 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-16 02:34:42,022 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-16 02:34:42,023 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:42,024 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-16 02:34:42,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-16 02:34:42,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-16 02:34:42,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-16 02:34:42,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-16 02:34:42,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-16 02:34:42,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-16 02:34:42,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-16 02:34:42,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-16 02:34:42,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-16 02:34:42,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:42,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-16 02:34:42,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-16 02:34:42,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-16 02:34:42,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-16 02:34:42,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-16 02:34:42,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-16 02:34:42,028 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-16 02:34:42,028 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-16 02:34:42,028 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:42,028 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-16 02:34:42,028 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-16 02:34:42,028 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-16 02:34:42,029 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-16 02:34:42,029 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:42,029 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-16 02:34:42,029 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-16 02:34:42,029 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-16 02:34:42,029 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-16 02:34:42,030 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-16 02:34:42,030 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-16 02:34:42,030 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-10-16 02:34:42,030 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-16 02:34:42,030 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:42,030 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-16 02:34:42,031 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-16 02:34:42,031 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-16 02:34:42,031 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-16 02:34:42,031 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:42,031 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:42,032 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:42,032 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-16 02:34:42,032 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-16 02:34:42,032 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:42,032 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-16 02:34:42,032 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-16 02:34:42,033 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:42,033 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:42,033 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:42,033 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:42,033 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:42,034 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:42,034 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:42,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-16 02:34:42,040 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-16 02:34:42,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 02:34:42 BoogieIcfgContainer [2021-10-16 02:34:42,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-16 02:34:42,062 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-16 02:34:42,062 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-16 02:34:42,063 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-16 02:34:42,063 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:34:39" (3/4) ... [2021-10-16 02:34:42,065 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-16 02:34:42,097 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d3671f-f8f6-4080-963c-58eac4e3e719/bin/utaipan-mTDlp9Zugs/witness.graphml [2021-10-16 02:34:42,097 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-16 02:34:42,099 INFO L168 Benchmark]: Toolchain (without parser) took 3972.34 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 52.7 MB in the beginning and 77.7 MB in the end (delta: -25.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 02:34:42,099 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 94.4 MB. Free memory is still 70.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 02:34:42,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.36 ms. Allocated memory is still 94.4 MB. Free memory was 52.5 MB in the beginning and 61.3 MB in the end (delta: -8.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-16 02:34:42,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.21 ms. Allocated memory is still 94.4 MB. Free memory was 61.3 MB in the beginning and 59.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-16 02:34:42,100 INFO L168 Benchmark]: Boogie Preprocessor took 31.83 ms. Allocated memory is still 94.4 MB. Free memory was 59.3 MB in the beginning and 57.7 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 02:34:42,100 INFO L168 Benchmark]: RCFGBuilder took 758.58 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 57.7 MB in the beginning and 87.3 MB in the end (delta: -29.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 16.1 GB. [2021-10-16 02:34:42,100 INFO L168 Benchmark]: TraceAbstraction took 2666.15 ms. Allocated memory is still 113.2 MB. Free memory was 87.3 MB in the beginning and 79.8 MB in the end (delta: 7.5 MB). Peak memory consumption was 6.0 MB. Max. memory is 16.1 GB. [2021-10-16 02:34:42,101 INFO L168 Benchmark]: Witness Printer took 34.97 ms. Allocated memory is still 113.2 MB. Free memory was 79.8 MB in the beginning and 77.7 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 02:34:42,103 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.24 ms. Allocated memory is still 94.4 MB. Free memory is still 70.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 431.36 ms. Allocated memory is still 94.4 MB. Free memory was 52.5 MB in the beginning and 61.3 MB in the end (delta: -8.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.21 ms. Allocated memory is still 94.4 MB. Free memory was 61.3 MB in the beginning and 59.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.83 ms. Allocated memory is still 94.4 MB. Free memory was 59.3 MB in the beginning and 57.7 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 758.58 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 57.7 MB in the beginning and 87.3 MB in the end (delta: -29.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 2666.15 ms. Allocated memory is still 113.2 MB. Free memory was 87.3 MB in the beginning and 79.8 MB in the end (delta: 7.5 MB). Peak memory consumption was 6.0 MB. Max. memory is 16.1 GB. * Witness Printer took 34.97 ms. Allocated memory is still 113.2 MB. Free memory was 79.8 MB in the beginning and 77.7 MB in the end (delta: 2.1 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.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1031]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1003] SLL* head = malloc(sizeof(SLL)); [L1004] head->next = ((void*)0) [L1005] head->data = 0 [L1007] SLL* x = head; [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1018] x->data = 1 [L1019] x->next = malloc(sizeof(SLL)) [L1020] EXPR x->next [L1020] x->next->data = 2 [L1022] x = head [L1024] COND FALSE !(!(((void*)0) != x)) [L1026] EXPR x->data [L1026] COND FALSE !(1 != x->data) [L1031] EXPR x->data [L1031] COND TRUE !(2 == x->data) [L1031] reach_error() - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: 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: 1028]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: 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, 108 locations, 54 error locations. Started 1 CEGAR loops. OverallTime: 2588.3ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 15.1ms, AutomataDifference: 1380.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 656 SDtfs, 711 SDslu, 827 SDs, 0 SdLazy, 1009 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 850.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 183.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=4, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 100.1ms AutomataMinimizationTime, 10 MinimizatonAttempts, 181 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 36.1ms SsaConstructionTime, 206.0ms SatisfiabilityAnalysisTime, 524.3ms InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-16 02:34:42,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d3671f-f8f6-4080-963c-58eac4e3e719/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...