./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8f03aacd6a0ba176a4c5bf885e9983ba429f85c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8f03aacd6a0ba176a4c5bf885e9983ba429f85c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 06:59:24,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 06:59:24,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 06:59:24,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 06:59:24,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 06:59:24,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 06:59:24,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 06:59:24,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 06:59:24,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 06:59:24,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 06:59:24,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 06:59:24,606 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 06:59:24,606 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 06:59:24,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 06:59:24,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 06:59:24,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 06:59:24,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 06:59:24,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 06:59:24,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 06:59:24,636 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 06:59:24,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 06:59:24,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 06:59:24,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 06:59:24,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 06:59:24,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 06:59:24,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 06:59:24,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 06:59:24,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 06:59:24,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 06:59:24,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 06:59:24,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 06:59:24,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 06:59:24,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 06:59:24,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 06:59:24,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 06:59:24,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 06:59:24,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 06:59:24,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 06:59:24,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 06:59:24,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 06:59:24,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 06:59:24,679 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-10-13 06:59:24,738 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 06:59:24,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 06:59:24,743 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 06:59:24,743 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 06:59:24,744 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 06:59:24,751 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 06:59:24,751 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 06:59:24,752 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 06:59:24,752 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 06:59:24,752 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 06:59:24,754 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 06:59:24,754 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 06:59:24,755 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 06:59:24,755 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 06:59:24,755 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 06:59:24,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 06:59:24,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 06:59:24,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 06:59:24,757 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 06:59:24,757 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 06:59:24,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 06:59:24,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 06:59:24,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 06:59:24,758 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 06:59:24,758 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 06:59:24,759 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-13 06:59:24,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 06:59:24,761 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 06:59:24,762 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 06:59:24,762 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 06:59:24,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 06:59:24,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 06:59:24,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 06:59:24,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 06:59:24,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 06:59:24,764 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 06:59:24,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 06:59:24,764 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 06:59:24,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 06:59:24,765 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_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/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_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8f03aacd6a0ba176a4c5bf885e9983ba429f85c [2021-10-13 06:59:25,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 06:59:25,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 06:59:25,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 06:59:25,188 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 06:59:25,189 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 06:59:25,191 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/forester-heap/dll-reverse.i [2021-10-13 06:59:25,268 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/data/a60e76cca/192230302fd64b4495749a140ef8fc02/FLAGa13bc87f6 [2021-10-13 06:59:26,055 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 06:59:26,055 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/sv-benchmarks/c/forester-heap/dll-reverse.i [2021-10-13 06:59:26,087 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/data/a60e76cca/192230302fd64b4495749a140ef8fc02/FLAGa13bc87f6 [2021-10-13 06:59:26,269 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/data/a60e76cca/192230302fd64b4495749a140ef8fc02 [2021-10-13 06:59:26,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 06:59:26,274 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 06:59:26,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 06:59:26,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 06:59:26,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 06:59:26,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:59:26" (1/1) ... [2021-10-13 06:59:26,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6796eb6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26, skipping insertion in model container [2021-10-13 06:59:26,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:59:26" (1/1) ... [2021-10-13 06:59:26,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 06:59:26,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 06:59:26,732 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_6905da26-484a-4eab-9597-33cd21a98390/sv-benchmarks/c/forester-heap/dll-reverse.i[22309,22322] [2021-10-13 06:59:26,736 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_6905da26-484a-4eab-9597-33cd21a98390/sv-benchmarks/c/forester-heap/dll-reverse.i[22394,22407] [2021-10-13 06:59:26,744 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_6905da26-484a-4eab-9597-33cd21a98390/sv-benchmarks/c/forester-heap/dll-reverse.i[22924,22937] [2021-10-13 06:59:26,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 06:59:26,761 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 06:59:26,804 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_6905da26-484a-4eab-9597-33cd21a98390/sv-benchmarks/c/forester-heap/dll-reverse.i[22309,22322] [2021-10-13 06:59:26,807 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_6905da26-484a-4eab-9597-33cd21a98390/sv-benchmarks/c/forester-heap/dll-reverse.i[22394,22407] [2021-10-13 06:59:26,813 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_6905da26-484a-4eab-9597-33cd21a98390/sv-benchmarks/c/forester-heap/dll-reverse.i[22924,22937] [2021-10-13 06:59:26,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 06:59:26,853 INFO L208 MainTranslator]: Completed translation [2021-10-13 06:59:26,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26 WrapperNode [2021-10-13 06:59:26,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 06:59:26,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 06:59:26,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 06:59:26,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 06:59:26,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2021-10-13 06:59:26,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2021-10-13 06:59:26,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 06:59:26,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 06:59:26,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 06:59:26,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 06:59:26,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2021-10-13 06:59:26,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2021-10-13 06:59:26,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2021-10-13 06:59:26,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2021-10-13 06:59:26,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2021-10-13 06:59:26,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2021-10-13 06:59:26,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2021-10-13 06:59:26,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 06:59:26,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 06:59:26,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 06:59:26,970 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 06:59:26,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2021-10-13 06:59:26,995 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 06:59:27,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:59:27,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 06:59:27,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 06:59:27,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-13 06:59:27,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 06:59:27,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 06:59:27,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 06:59:27,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 06:59:27,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 06:59:27,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 06:59:27,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 06:59:27,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 06:59:27,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 06:59:28,141 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 06:59:28,142 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-10-13 06:59:28,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:59:28 BoogieIcfgContainer [2021-10-13 06:59:28,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 06:59:28,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 06:59:28,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 06:59:28,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 06:59:28,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:59:26" (1/3) ... [2021-10-13 06:59:28,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f350fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:59:28, skipping insertion in model container [2021-10-13 06:59:28,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (2/3) ... [2021-10-13 06:59:28,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f350fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:59:28, skipping insertion in model container [2021-10-13 06:59:28,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:59:28" (3/3) ... [2021-10-13 06:59:28,180 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2021-10-13 06:59:28,186 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 06:59:28,186 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 69 error locations. [2021-10-13 06:59:28,238 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 06:59:28,245 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-13 06:59:28,246 INFO L340 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2021-10-13 06:59:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 56 states have (on average 2.5714285714285716) internal successors, (144), 125 states have internal predecessors, (144), 0 states have call successors, (0), 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-13 06:59:28,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-13 06:59:28,275 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:59:28,276 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-13 06:59:28,276 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 06:59:28,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:59:28,284 INFO L82 PathProgramCache]: Analyzing trace with hash 9273, now seen corresponding path program 1 times [2021-10-13 06:59:28,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:59:28,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109435743] [2021-10-13 06:59:28,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:59:28,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:59:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:59:28,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:59:28,494 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:59:28,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109435743] [2021-10-13 06:59:28,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109435743] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:59:28,495 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:59:28,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 06:59:28,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087968776] [2021-10-13 06:59:28,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:59:28,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:59:28,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:59:28,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:59:28,533 INFO L87 Difference]: Start difference. First operand has 126 states, 56 states have (on average 2.5714285714285716) internal successors, (144), 125 states have internal predecessors, (144), 0 states have call successors, (0), 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-13 06:59:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:59:28,743 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2021-10-13 06:59:28,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:59:28,745 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-13 06:59:28,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:59:28,765 INFO L225 Difference]: With dead ends: 123 [2021-10-13 06:59:28,765 INFO L226 Difference]: Without dead ends: 122 [2021-10-13 06:59:28,767 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:59:28,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-10-13 06:59:28,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-10-13 06:59:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 56 states have (on average 2.3035714285714284) internal successors, (129), 121 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-13 06:59:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2021-10-13 06:59:28,833 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 2 [2021-10-13 06:59:28,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:59:28,834 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2021-10-13 06:59:28,834 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-13 06:59:28,834 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2021-10-13 06:59:28,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-13 06:59:28,835 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:59:28,835 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-13 06:59:28,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 06:59:28,836 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 06:59:28,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:59:28,840 INFO L82 PathProgramCache]: Analyzing trace with hash 9274, now seen corresponding path program 1 times [2021-10-13 06:59:28,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:59:28,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879754409] [2021-10-13 06:59:28,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:59:28,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:59:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:59:28,944 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-13 06:59:28,945 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:59:28,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879754409] [2021-10-13 06:59:28,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879754409] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:59:28,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:59:28,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 06:59:28,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167375061] [2021-10-13 06:59:28,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:59:28,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:59:28,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:59:28,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:59:28,953 INFO L87 Difference]: Start difference. First operand 122 states and 129 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-13 06:59:29,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:59:29,125 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2021-10-13 06:59:29,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:59:29,126 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-13 06:59:29,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:59:29,130 INFO L225 Difference]: With dead ends: 119 [2021-10-13 06:59:29,131 INFO L226 Difference]: Without dead ends: 119 [2021-10-13 06:59:29,133 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:59:29,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-10-13 06:59:29,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-10-13 06:59:29,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 56 states have (on average 2.25) internal successors, (126), 118 states have internal predecessors, (126), 0 states have call successors, (0), 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-13 06:59:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2021-10-13 06:59:29,154 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 2 [2021-10-13 06:59:29,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:59:29,155 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2021-10-13 06:59:29,159 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-13 06:59:29,159 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2021-10-13 06:59:29,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 06:59:29,160 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:59:29,160 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:59:29,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 06:59:29,162 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 06:59:29,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:59:29,163 INFO L82 PathProgramCache]: Analyzing trace with hash -824554840, now seen corresponding path program 1 times [2021-10-13 06:59:29,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:59:29,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728257906] [2021-10-13 06:59:29,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:59:29,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:59:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:59:29,286 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-13 06:59:29,287 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:59:29,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728257906] [2021-10-13 06:59:29,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728257906] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:59:29,288 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:59:29,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 06:59:29,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734800111] [2021-10-13 06:59:29,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:59:29,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:59:29,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:59:29,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:59:29,291 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:29,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:59:29,578 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2021-10-13 06:59:29,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:59:29,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-13 06:59:29,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:59:29,582 INFO L225 Difference]: With dead ends: 109 [2021-10-13 06:59:29,582 INFO L226 Difference]: Without dead ends: 109 [2021-10-13 06:59:29,582 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:59:29,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-10-13 06:59:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2021-10-13 06:59:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 60 states have (on average 1.95) internal successors, (117), 105 states have internal predecessors, (117), 0 states have call successors, (0), 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-13 06:59:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2021-10-13 06:59:29,593 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 7 [2021-10-13 06:59:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:59:29,594 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2021-10-13 06:59:29,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2021-10-13 06:59:29,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 06:59:29,595 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:59:29,595 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:59:29,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 06:59:29,596 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 06:59:29,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:59:29,597 INFO L82 PathProgramCache]: Analyzing trace with hash -824554839, now seen corresponding path program 1 times [2021-10-13 06:59:29,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:59:29,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853510484] [2021-10-13 06:59:29,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:59:29,598 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:59:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:59:29,688 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-13 06:59:29,689 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:59:29,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853510484] [2021-10-13 06:59:29,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853510484] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:59:29,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:59:29,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 06:59:29,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062373037] [2021-10-13 06:59:29,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:59:29,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:59:29,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:59:29,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:59:29,693 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:30,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:59:30,000 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2021-10-13 06:59:30,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:59:30,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-13 06:59:30,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:59:30,004 INFO L225 Difference]: With dead ends: 141 [2021-10-13 06:59:30,005 INFO L226 Difference]: Without dead ends: 141 [2021-10-13 06:59:30,006 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:59:30,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-10-13 06:59:30,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 128. [2021-10-13 06:59:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.7804878048780488) internal successors, (146), 127 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2021-10-13 06:59:30,017 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 7 [2021-10-13 06:59:30,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:59:30,018 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2021-10-13 06:59:30,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2021-10-13 06:59:30,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 06:59:30,019 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:59:30,020 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:59:30,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 06:59:30,020 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 06:59:30,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:59:30,021 INFO L82 PathProgramCache]: Analyzing trace with hash -2122975735, now seen corresponding path program 1 times [2021-10-13 06:59:30,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:59:30,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700120308] [2021-10-13 06:59:30,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:59:30,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:59:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:59:30,127 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-13 06:59:30,128 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:59:30,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700120308] [2021-10-13 06:59:30,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700120308] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:59:30,129 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:59:30,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 06:59:30,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398420137] [2021-10-13 06:59:30,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:59:30,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:59:30,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:59:30,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:59:30,132 INFO L87 Difference]: Start difference. First operand 128 states and 146 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-13 06:59:30,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:59:30,394 INFO L93 Difference]: Finished difference Result 127 states and 144 transitions. [2021-10-13 06:59:30,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:59:30,395 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-13 06:59:30,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:59:30,396 INFO L225 Difference]: With dead ends: 127 [2021-10-13 06:59:30,396 INFO L226 Difference]: Without dead ends: 127 [2021-10-13 06:59:30,397 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:59:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-10-13 06:59:30,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-10-13 06:59:30,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 82 states have (on average 1.7560975609756098) internal successors, (144), 126 states have internal predecessors, (144), 0 states have call successors, (0), 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-13 06:59:30,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2021-10-13 06:59:30,405 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 9 [2021-10-13 06:59:30,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:59:30,405 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2021-10-13 06:59:30,406 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-13 06:59:30,406 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2021-10-13 06:59:30,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 06:59:30,407 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:59:30,407 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:59:30,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 06:59:30,407 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 06:59:30,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:59:30,408 INFO L82 PathProgramCache]: Analyzing trace with hash -2122975736, now seen corresponding path program 1 times [2021-10-13 06:59:30,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:59:30,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004645969] [2021-10-13 06:59:30,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:59:30,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:59:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:59:30,480 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-13 06:59:30,480 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:59:30,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004645969] [2021-10-13 06:59:30,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004645969] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:59:30,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:59:30,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 06:59:30,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32978869] [2021-10-13 06:59:30,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:59:30,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:59:30,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:59:30,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:59:30,484 INFO L87 Difference]: Start difference. First operand 127 states and 144 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-13 06:59:30,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:59:30,682 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2021-10-13 06:59:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:59:30,683 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-13 06:59:30,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:59:30,684 INFO L225 Difference]: With dead ends: 126 [2021-10-13 06:59:30,684 INFO L226 Difference]: Without dead ends: 126 [2021-10-13 06:59:30,684 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:59:30,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-10-13 06:59:30,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-10-13 06:59:30,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 82 states have (on average 1.7317073170731707) internal successors, (142), 125 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2021-10-13 06:59:30,691 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 9 [2021-10-13 06:59:30,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:59:30,692 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2021-10-13 06:59:30,692 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-13 06:59:30,692 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2021-10-13 06:59:30,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 06:59:30,693 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:59:30,693 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:59:30,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 06:59:30,693 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 06:59:30,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:59:30,694 INFO L82 PathProgramCache]: Analyzing trace with hash -331180861, now seen corresponding path program 1 times [2021-10-13 06:59:30,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:59:30,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868668802] [2021-10-13 06:59:30,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:59:30,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:59:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:59:30,742 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-13 06:59:30,743 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:59:30,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868668802] [2021-10-13 06:59:30,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868668802] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:59:30,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:59:30,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:59:30,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163379422] [2021-10-13 06:59:30,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:59:30,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:59:30,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:59:30,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:59:30,746 INFO L87 Difference]: Start difference. First operand 126 states and 142 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-13 06:59:30,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:59:30,927 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2021-10-13 06:59:30,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:59:30,928 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-13 06:59:30,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:59:30,929 INFO L225 Difference]: With dead ends: 133 [2021-10-13 06:59:30,929 INFO L226 Difference]: Without dead ends: 133 [2021-10-13 06:59:30,930 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:59:30,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-10-13 06:59:30,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 126. [2021-10-13 06:59:30,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 82 states have (on average 1.6951219512195121) internal successors, (139), 125 states have internal predecessors, (139), 0 states have call successors, (0), 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-13 06:59:30,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2021-10-13 06:59:30,935 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 11 [2021-10-13 06:59:30,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:59:30,935 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2021-10-13 06:59:30,936 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-13 06:59:30,936 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2021-10-13 06:59:30,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 06:59:30,936 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:59:30,937 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:59:30,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 06:59:30,937 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 06:59:30,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:59:30,938 INFO L82 PathProgramCache]: Analyzing trace with hash -69979259, now seen corresponding path program 1 times [2021-10-13 06:59:30,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:59:30,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331601973] [2021-10-13 06:59:30,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:59:30,939 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:59:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:59:31,075 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-13 06:59:31,076 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:59:31,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331601973] [2021-10-13 06:59:31,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331601973] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:59:31,076 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:59:31,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 06:59:31,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603065782] [2021-10-13 06:59:31,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 06:59:31,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:59:31,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 06:59:31,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-13 06:59:31,079 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:31,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:59:31,459 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2021-10-13 06:59:31,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 06:59:31,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-10-13 06:59:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:59:31,461 INFO L225 Difference]: With dead ends: 126 [2021-10-13 06:59:31,461 INFO L226 Difference]: Without dead ends: 126 [2021-10-13 06:59:31,462 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 110.2ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-10-13 06:59:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-10-13 06:59:31,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2021-10-13 06:59:31,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 82 states have (on average 1.6829268292682926) internal successors, (138), 124 states have internal predecessors, (138), 0 states have call successors, (0), 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-13 06:59:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2021-10-13 06:59:31,466 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 11 [2021-10-13 06:59:31,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:59:31,466 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2021-10-13 06:59:31,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:31,467 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2021-10-13 06:59:31,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 06:59:31,468 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:59:31,468 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:59:31,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 06:59:31,468 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 06:59:31,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:59:31,469 INFO L82 PathProgramCache]: Analyzing trace with hash -69979258, now seen corresponding path program 1 times [2021-10-13 06:59:31,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:59:31,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645232917] [2021-10-13 06:59:31,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:59:31,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:59:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:59:31,642 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-13 06:59:31,642 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:59:31,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645232917] [2021-10-13 06:59:31,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645232917] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:59:31,643 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:59:31,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 06:59:31,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204098919] [2021-10-13 06:59:31,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 06:59:31,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:59:31,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 06:59:31,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-13 06:59:31,645 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:32,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:59:32,205 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2021-10-13 06:59:32,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 06:59:32,206 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-10-13 06:59:32,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:59:32,207 INFO L225 Difference]: With dead ends: 122 [2021-10-13 06:59:32,207 INFO L226 Difference]: Without dead ends: 122 [2021-10-13 06:59:32,208 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 293.6ms TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-10-13 06:59:32,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-10-13 06:59:32,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2021-10-13 06:59:32,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 76 states have (on average 1.6578947368421053) internal successors, (126), 113 states have internal predecessors, (126), 0 states have call successors, (0), 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-13 06:59:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2021-10-13 06:59:32,212 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 11 [2021-10-13 06:59:32,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:59:32,212 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2021-10-13 06:59:32,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:32,212 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2021-10-13 06:59:32,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 06:59:32,213 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:59:32,213 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:59:32,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 06:59:32,214 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 06:59:32,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:59:32,214 INFO L82 PathProgramCache]: Analyzing trace with hash -435983961, now seen corresponding path program 1 times [2021-10-13 06:59:32,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:59:32,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980847696] [2021-10-13 06:59:32,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:59:32,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:59:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:59:32,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:59:32,309 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:59:32,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980847696] [2021-10-13 06:59:32,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980847696] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:59:32,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:59:32,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 06:59:32,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689401328] [2021-10-13 06:59:32,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:59:32,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:59:32,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:59:32,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:59:32,313 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:59:32,516 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2021-10-13 06:59:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 06:59:32,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-13 06:59:32,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:59:32,526 INFO L225 Difference]: With dead ends: 131 [2021-10-13 06:59:32,526 INFO L226 Difference]: Without dead ends: 131 [2021-10-13 06:59:32,527 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 06:59:32,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-10-13 06:59:32,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 119. [2021-10-13 06:59:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 81 states have (on average 1.6296296296296295) internal successors, (132), 118 states have internal predecessors, (132), 0 states have call successors, (0), 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-13 06:59:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2021-10-13 06:59:32,531 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 13 [2021-10-13 06:59:32,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:59:32,532 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2021-10-13 06:59:32,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:32,534 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2021-10-13 06:59:32,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 06:59:32,535 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:59:32,535 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:59:32,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 06:59:32,539 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 06:59:32,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:59:32,540 INFO L82 PathProgramCache]: Analyzing trace with hash 750440743, now seen corresponding path program 1 times [2021-10-13 06:59:32,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:59:32,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066416264] [2021-10-13 06:59:32,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:59:32,540 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:59:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:59:32,688 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-13 06:59:32,688 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:59:32,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066416264] [2021-10-13 06:59:32,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066416264] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:59:32,689 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:59:32,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 06:59:32,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508300638] [2021-10-13 06:59:32,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:59:32,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:59:32,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:59:32,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:59:32,693 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:32,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:59:32,887 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2021-10-13 06:59:32,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 06:59:32,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-13 06:59:32,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:59:32,889 INFO L225 Difference]: With dead ends: 127 [2021-10-13 06:59:32,889 INFO L226 Difference]: Without dead ends: 127 [2021-10-13 06:59:32,890 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 50.0ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-13 06:59:32,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-10-13 06:59:32,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2021-10-13 06:59:32,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 86 states have (on average 1.5930232558139534) internal successors, (137), 123 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:32,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2021-10-13 06:59:32,894 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 16 [2021-10-13 06:59:32,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:59:32,895 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2021-10-13 06:59:32,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:32,895 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2021-10-13 06:59:32,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 06:59:32,897 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:59:32,897 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:59:32,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 06:59:32,898 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 06:59:32,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:59:32,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1788261859, now seen corresponding path program 1 times [2021-10-13 06:59:32,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:59:32,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321594885] [2021-10-13 06:59:32,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:59:32,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:59:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:59:32,989 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-13 06:59:32,990 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:59:32,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321594885] [2021-10-13 06:59:32,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321594885] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:59:32,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:59:32,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 06:59:32,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397882559] [2021-10-13 06:59:32,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:59:32,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:59:32,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:59:32,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:59:32,998 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:33,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:59:33,173 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2021-10-13 06:59:33,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:59:33,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-13 06:59:33,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:59:33,175 INFO L225 Difference]: With dead ends: 123 [2021-10-13 06:59:33,175 INFO L226 Difference]: Without dead ends: 123 [2021-10-13 06:59:33,175 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:59:33,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-10-13 06:59:33,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-10-13 06:59:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.569767441860465) internal successors, (135), 122 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2021-10-13 06:59:33,180 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 17 [2021-10-13 06:59:33,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:59:33,180 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2021-10-13 06:59:33,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:33,181 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2021-10-13 06:59:33,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 06:59:33,182 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:59:33,182 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:59:33,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 06:59:33,182 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 06:59:33,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:59:33,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1788261860, now seen corresponding path program 1 times [2021-10-13 06:59:33,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:59:33,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079999669] [2021-10-13 06:59:33,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:59:33,184 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:59:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:59:33,251 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-13 06:59:33,251 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:59:33,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079999669] [2021-10-13 06:59:33,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079999669] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:59:33,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:59:33,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 06:59:33,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932608607] [2021-10-13 06:59:33,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:59:33,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:59:33,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:59:33,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:59:33,254 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:33,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:59:33,451 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2021-10-13 06:59:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:59:33,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-13 06:59:33,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:59:33,453 INFO L225 Difference]: With dead ends: 122 [2021-10-13 06:59:33,453 INFO L226 Difference]: Without dead ends: 122 [2021-10-13 06:59:33,453 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:59:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-10-13 06:59:33,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-10-13 06:59:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.5465116279069768) internal successors, (133), 121 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2021-10-13 06:59:33,458 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 17 [2021-10-13 06:59:33,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:59:33,458 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2021-10-13 06:59:33,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:33,459 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2021-10-13 06:59:33,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 06:59:33,460 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:59:33,460 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:59:33,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 06:59:33,460 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 06:59:33,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:59:33,461 INFO L82 PathProgramCache]: Analyzing trace with hash 532879792, now seen corresponding path program 1 times [2021-10-13 06:59:33,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:59:33,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720190226] [2021-10-13 06:59:33,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:59:33,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:59:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:59:33,593 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-13 06:59:33,594 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:59:33,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720190226] [2021-10-13 06:59:33,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720190226] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:59:33,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:59:33,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 06:59:33,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635065175] [2021-10-13 06:59:33,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 06:59:33,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:59:33,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 06:59:33,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-13 06:59:33,596 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:33,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:59:33,901 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2021-10-13 06:59:33,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 06:59:33,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 06:59:33,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:59:33,903 INFO L225 Difference]: With dead ends: 122 [2021-10-13 06:59:33,903 INFO L226 Difference]: Without dead ends: 122 [2021-10-13 06:59:33,903 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 96.8ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-10-13 06:59:33,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-10-13 06:59:33,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2021-10-13 06:59:33,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 86 states have (on average 1.5348837209302326) internal successors, (132), 120 states have internal predecessors, (132), 0 states have call successors, (0), 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-13 06:59:33,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2021-10-13 06:59:33,907 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 19 [2021-10-13 06:59:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:59:33,907 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2021-10-13 06:59:33,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2021-10-13 06:59:33,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 06:59:33,909 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:59:33,909 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:59:33,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 06:59:33,909 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 06:59:33,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:59:33,910 INFO L82 PathProgramCache]: Analyzing trace with hash 532879793, now seen corresponding path program 1 times [2021-10-13 06:59:33,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:59:33,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070617274] [2021-10-13 06:59:33,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:59:33,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:59:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:59:34,059 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-13 06:59:34,060 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:59:34,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070617274] [2021-10-13 06:59:34,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070617274] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:59:34,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:59:34,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 06:59:34,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450419683] [2021-10-13 06:59:34,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 06:59:34,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:59:34,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 06:59:34,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-13 06:59:34,063 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:59:34,612 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2021-10-13 06:59:34,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 06:59:34,613 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 06:59:34,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:59:34,614 INFO L225 Difference]: With dead ends: 121 [2021-10-13 06:59:34,614 INFO L226 Difference]: Without dead ends: 121 [2021-10-13 06:59:34,614 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 179.4ms TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-10-13 06:59:34,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-10-13 06:59:34,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2021-10-13 06:59:34,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 86 states have (on average 1.5116279069767442) 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-13 06:59:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2021-10-13 06:59:34,618 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 19 [2021-10-13 06:59:34,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:59:34,618 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2021-10-13 06:59:34,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:59:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2021-10-13 06:59:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 06:59:34,620 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:59:34,627 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:59:34,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 06:59:34,627 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 06:59:34,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:59:34,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1376534989, now seen corresponding path program 1 times [2021-10-13 06:59:34,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:59:34,628 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404597852] [2021-10-13 06:59:34,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:59:34,629 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:59:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:59:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:59:34,920 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:59:34,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404597852] [2021-10-13 06:59:34,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404597852] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:59:34,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617120597] [2021-10-13 06:59:34,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:59:34,924 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:59:34,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:59:34,932 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:59:34,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 06:59:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:59:35,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 25 conjunts are in the unsatisfiable core [2021-10-13 06:59:35,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:59:35,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 06:59:35,380 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-10-13 06:59:35,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-10-13 06:59:35,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-10-13 06:59:35,621 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-10-13 06:59:35,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2021-10-13 06:59:35,878 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-10-13 06:59:35,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 48 [2021-10-13 06:59:35,994 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-10-13 06:59:35,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 45 [2021-10-13 06:59:36,416 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-10-13 06:59:36,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 33 [2021-10-13 06:59:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:59:36,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:59:36,668 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:59:36,671 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-10-13 07:00:03,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6558 treesize of output 6526 [2021-10-13 07:00:03,276 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 07:00:03,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [742321309] [2021-10-13 07:00:03,313 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-10-13 07:00:03,313 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 07:00:03,323 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-13 07:00:03,333 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-13 07:00:03,334 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-13 07:00:03,404 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:00:03,406 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 07:00:03,407 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:00:03,407 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-13 07:00:03,408 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 07:00:03,409 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:00:03,410 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-10-13 07:00:03,412 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-10-13 07:00:03,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:00:03,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:00:03,467 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-10-13 07:00:03,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 26 [2021-10-13 07:00:03,469 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:00:03,471 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-10-13 07:00:03,472 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:00:03,473 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-10-13 07:00:03,474 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-13 07:00:03,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:00:03,491 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:00:03,493 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:00:03,495 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 98 [2021-10-13 07:00:03,495 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-13 07:00:03,496 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:110, output treesize:98 [2021-10-13 07:00:03,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:00:03,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:00:03,725 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: No corresponding IProgramVar for |v_#length_114| at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.constructTermVarsProc(BasicPredicateFactory.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:81) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.predicate(SymbolicTools.java:174) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-13 07:00:03,728 INFO L168 Benchmark]: Toolchain (without parser) took 37453.71 ms. Allocated memory was 113.2 MB in the beginning and 182.5 MB in the end (delta: 69.2 MB). Free memory was 73.7 MB in the beginning and 99.3 MB in the end (delta: -25.6 MB). Peak memory consumption was 42.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:00:03,728 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 113.2 MB. Free memory is still 91.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:00:03,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 578.01 ms. Allocated memory is still 113.2 MB. Free memory was 73.5 MB in the beginning and 80.3 MB in the end (delta: -6.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 07:00:03,729 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.89 ms. Allocated memory is still 113.2 MB. Free memory was 80.0 MB in the beginning and 77.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:00:03,730 INFO L168 Benchmark]: Boogie Preprocessor took 47.53 ms. Allocated memory is still 113.2 MB. Free memory was 77.9 MB in the beginning and 76.1 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:00:03,730 INFO L168 Benchmark]: RCFGBuilder took 1175.82 ms. Allocated memory is still 113.2 MB. Free memory was 75.8 MB in the beginning and 46.8 MB in the end (delta: 29.0 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2021-10-13 07:00:03,731 INFO L168 Benchmark]: TraceAbstraction took 35557.42 ms. Allocated memory was 113.2 MB in the beginning and 182.5 MB in the end (delta: 69.2 MB). Free memory was 88.5 MB in the beginning and 99.3 MB in the end (delta: -10.8 MB). Peak memory consumption was 57.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:00:03,733 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 113.2 MB. Free memory is still 91.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 578.01 ms. Allocated memory is still 113.2 MB. Free memory was 73.5 MB in the beginning and 80.3 MB in the end (delta: -6.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.89 ms. Allocated memory is still 113.2 MB. Free memory was 80.0 MB in the beginning and 77.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 47.53 ms. Allocated memory is still 113.2 MB. Free memory was 77.9 MB in the beginning and 76.1 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 1175.82 ms. Allocated memory is still 113.2 MB. Free memory was 75.8 MB in the beginning and 46.8 MB in the end (delta: 29.0 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 35557.42 ms. Allocated memory was 113.2 MB in the beginning and 182.5 MB in the end (delta: 69.2 MB). Free memory was 88.5 MB in the beginning and 99.3 MB in the end (delta: -10.8 MB). Peak memory consumption was 57.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: No corresponding IProgramVar for |v_#length_114| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: No corresponding IProgramVar for |v_#length_114|: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-10-13 07:00:03,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:00:06,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:00:06,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:00:06,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:00:06,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:00:06,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:00:06,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:00:06,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:00:06,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:00:06,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:00:06,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:00:06,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:00:06,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:00:06,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:00:06,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:00:06,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:00:06,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:00:06,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:00:06,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:00:06,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:00:06,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:00:06,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:00:06,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:00:06,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:00:06,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:00:06,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:00:06,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:00:06,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:00:06,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:00:06,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:00:06,736 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:00:06,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:00:06,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:00:06,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:00:06,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:00:06,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:00:06,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:00:06,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:00:06,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:00:06,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:00:06,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:00:06,753 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-10-13 07:00:06,803 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:00:06,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:00:06,806 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:00:06,806 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:00:06,806 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:00:06,807 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:00:06,807 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:00:06,807 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:00:06,809 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:00:06,811 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 07:00:06,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 07:00:06,812 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:00:06,813 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:00:06,813 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 07:00:06,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:00:06,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:00:06,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:00:06,814 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 07:00:06,815 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 07:00:06,815 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-13 07:00:06,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:00:06,815 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:00:06,816 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-13 07:00:06,816 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-13 07:00:06,816 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:00:06,817 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:00:06,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:00:06,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 07:00:06,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:00:06,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:00:06,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:00:06,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:00:06,819 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-13 07:00:06,820 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-13 07:00:06,820 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:00:06,820 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:00:06,820 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/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_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8f03aacd6a0ba176a4c5bf885e9983ba429f85c [2021-10-13 07:00:07,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:00:07,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:00:07,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:00:07,395 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:00:07,397 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:00:07,398 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/forester-heap/dll-reverse.i [2021-10-13 07:00:07,490 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/data/352b76c25/802ee860a6974178ba99afb0bdfd5bcc/FLAG4c0dcb4aa [2021-10-13 07:00:08,277 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:00:08,277 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/sv-benchmarks/c/forester-heap/dll-reverse.i [2021-10-13 07:00:08,293 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/data/352b76c25/802ee860a6974178ba99afb0bdfd5bcc/FLAG4c0dcb4aa [2021-10-13 07:00:08,544 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/data/352b76c25/802ee860a6974178ba99afb0bdfd5bcc [2021-10-13 07:00:08,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:00:08,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:00:08,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:00:08,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:00:08,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:00:08,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:00:08" (1/1) ... [2021-10-13 07:00:08,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d2d060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:08, skipping insertion in model container [2021-10-13 07:00:08,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:00:08" (1/1) ... [2021-10-13 07:00:08,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:00:08,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:00:09,050 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_6905da26-484a-4eab-9597-33cd21a98390/sv-benchmarks/c/forester-heap/dll-reverse.i[22309,22322] [2021-10-13 07:00:09,054 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_6905da26-484a-4eab-9597-33cd21a98390/sv-benchmarks/c/forester-heap/dll-reverse.i[22394,22407] [2021-10-13 07:00:09,073 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_6905da26-484a-4eab-9597-33cd21a98390/sv-benchmarks/c/forester-heap/dll-reverse.i[22924,22937] [2021-10-13 07:00:09,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:00:09,122 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:00:09,190 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_6905da26-484a-4eab-9597-33cd21a98390/sv-benchmarks/c/forester-heap/dll-reverse.i[22309,22322] [2021-10-13 07:00:09,198 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_6905da26-484a-4eab-9597-33cd21a98390/sv-benchmarks/c/forester-heap/dll-reverse.i[22394,22407] [2021-10-13 07:00:09,215 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_6905da26-484a-4eab-9597-33cd21a98390/sv-benchmarks/c/forester-heap/dll-reverse.i[22924,22937] [2021-10-13 07:00:09,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:00:09,278 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:00:09,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:09 WrapperNode [2021-10-13 07:00:09,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:00:09,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:00:09,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:00:09,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:00:09,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:09" (1/1) ... [2021-10-13 07:00:09,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:09" (1/1) ... [2021-10-13 07:00:09,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:00:09,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:00:09,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:00:09,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:00:09,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:09" (1/1) ... [2021-10-13 07:00:09,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:09" (1/1) ... [2021-10-13 07:00:09,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:09" (1/1) ... [2021-10-13 07:00:09,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:09" (1/1) ... [2021-10-13 07:00:09,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:09" (1/1) ... [2021-10-13 07:00:09,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:09" (1/1) ... [2021-10-13 07:00:09,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:09" (1/1) ... [2021-10-13 07:00:09,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:00:09,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:00:09,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:00:09,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:00:09,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:09" (1/1) ... [2021-10-13 07:00:09,508 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:00:09,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:00:09,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:00:09,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:00:09,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-10-13 07:00:09,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 07:00:09,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 07:00:09,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:00:09,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 07:00:09,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 07:00:09,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-10-13 07:00:09,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-13 07:00:09,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:00:09,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:00:10,725 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:00:10,725 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-10-13 07:00:10,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:00:10 BoogieIcfgContainer [2021-10-13 07:00:10,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:00:10,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:00:10,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:00:10,734 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:00:10,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:00:08" (1/3) ... [2021-10-13 07:00:10,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222b0cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:00:10, skipping insertion in model container [2021-10-13 07:00:10,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:00:09" (2/3) ... [2021-10-13 07:00:10,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222b0cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:00:10, skipping insertion in model container [2021-10-13 07:00:10,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:00:10" (3/3) ... [2021-10-13 07:00:10,739 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2021-10-13 07:00:10,745 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:00:10,746 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 69 error locations. [2021-10-13 07:00:10,801 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:00:10,809 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-13 07:00:10,809 INFO L340 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2021-10-13 07:00:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 146 states, 76 states have (on average 2.1973684210526314) internal successors, (167), 145 states have internal predecessors, (167), 0 states have call successors, (0), 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-13 07:00:10,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 07:00:10,838 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:00:10,839 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 07:00:10,839 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 07:00:10,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:00:10,846 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-10-13 07:00:10,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:00:10,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806309574] [2021-10-13 07:00:10,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:00:10,863 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:00:10,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:00:10,868 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:00:10,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-13 07:00:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:00:10,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:00:10,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:00:11,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:00:11,110 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-13 07:00:11,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:00:11,130 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-13 07:00:11,132 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:00:11,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806309574] [2021-10-13 07:00:11,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806309574] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:00:11,133 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:00:11,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-13 07:00:11,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991351419] [2021-10-13 07:00:11,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:00:11,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:00:11,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:00:11,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:00:11,163 INFO L87 Difference]: Start difference. First operand has 146 states, 76 states have (on average 2.1973684210526314) internal successors, (167), 145 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:11,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:00:11,575 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2021-10-13 07:00:11,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:00:11,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-13 07:00:11,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:00:11,590 INFO L225 Difference]: With dead ends: 143 [2021-10-13 07:00:11,590 INFO L226 Difference]: Without dead ends: 141 [2021-10-13 07:00:11,592 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:00:11,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-10-13 07:00:11,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-10-13 07:00:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 75 states have (on average 1.9733333333333334) internal successors, (148), 140 states have internal predecessors, (148), 0 states have call successors, (0), 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-13 07:00:11,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 148 transitions. [2021-10-13 07:00:11,644 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 148 transitions. Word has length 3 [2021-10-13 07:00:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:00:11,645 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 148 transitions. [2021-10-13 07:00:11,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 148 transitions. [2021-10-13 07:00:11,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 07:00:11,646 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:00:11,646 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 07:00:11,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:00:11,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:00:11,860 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 07:00:11,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:00:11,861 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-10-13 07:00:11,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:00:11,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496601989] [2021-10-13 07:00:11,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:00:11,863 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:00:11,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:00:11,869 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:00:11,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-13 07:00:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:00:11,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 07:00:11,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:00:11,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:00:11,977 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-13 07:00:11,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:00:12,055 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-13 07:00:12,055 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:00:12,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496601989] [2021-10-13 07:00:12,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1496601989] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:00:12,056 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:00:12,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-13 07:00:12,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109496276] [2021-10-13 07:00:12,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:00:12,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:00:12,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:00:12,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:00:12,060 INFO L87 Difference]: Start difference. First operand 141 states and 148 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:00:12,618 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2021-10-13 07:00:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:00:12,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-13 07:00:12,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:00:12,623 INFO L225 Difference]: With dead ends: 138 [2021-10-13 07:00:12,623 INFO L226 Difference]: Without dead ends: 138 [2021-10-13 07:00:12,624 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:00:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-10-13 07:00:12,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-10-13 07:00:12,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 75 states have (on average 1.9333333333333333) internal successors, (145), 137 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:12,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2021-10-13 07:00:12,653 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 3 [2021-10-13 07:00:12,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:00:12,654 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2021-10-13 07:00:12,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2021-10-13 07:00:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-13 07:00:12,658 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:00:12,658 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:00:12,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-10-13 07:00:12,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:00:12,872 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 07:00:12,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:00:12,873 INFO L82 PathProgramCache]: Analyzing trace with hash 59261803, now seen corresponding path program 1 times [2021-10-13 07:00:12,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:00:12,875 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310980495] [2021-10-13 07:00:12,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:00:12,875 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:00:12,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:00:12,879 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:00:12,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-13 07:00:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:00:12,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 07:00:12,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:00:13,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:00:13,078 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-10-13 07:00:13,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 22 [2021-10-13 07:00:13,130 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-13 07:00:13,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:00:13,187 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-13 07:00:13,188 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:00:13,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310980495] [2021-10-13 07:00:13,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310980495] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:00:13,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:00:13,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:00:13,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041684763] [2021-10-13 07:00:13,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:00:13,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:00:13,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:00:13,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:00:13,192 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:00:13,828 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2021-10-13 07:00:13,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:00:13,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-10-13 07:00:13,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:00:13,831 INFO L225 Difference]: With dead ends: 129 [2021-10-13 07:00:13,831 INFO L226 Difference]: Without dead ends: 129 [2021-10-13 07:00:13,831 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 49.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:00:13,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-10-13 07:00:13,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2021-10-13 07:00:13,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 79 states have (on average 1.7215189873417722) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2021-10-13 07:00:13,859 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 8 [2021-10-13 07:00:13,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:00:13,859 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2021-10-13 07:00:13,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:13,860 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2021-10-13 07:00:13,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-13 07:00:13,861 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:00:13,861 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:00:13,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-10-13 07:00:14,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:00:14,079 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 07:00:14,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:00:14,080 INFO L82 PathProgramCache]: Analyzing trace with hash 59261804, now seen corresponding path program 1 times [2021-10-13 07:00:14,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:00:14,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152990460] [2021-10-13 07:00:14,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:00:14,082 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:00:14,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:00:14,084 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:00:14,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-13 07:00:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:00:14,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 07:00:14,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:00:14,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:00:14,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:00:14,389 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-10-13 07:00:14,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2021-10-13 07:00:14,405 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-13 07:00:14,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2021-10-13 07:00:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:00:14,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:00:17,410 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-13 07:00:17,411 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:00:17,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152990460] [2021-10-13 07:00:17,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152990460] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:00:17,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:00:17,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-10-13 07:00:17,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860357655] [2021-10-13 07:00:17,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 07:00:17,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:00:17,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 07:00:17,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2021-10-13 07:00:17,415 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:30,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:00:30,204 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2021-10-13 07:00:30,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:00:30,205 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-10-13 07:00:30,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:00:30,207 INFO L225 Difference]: With dead ends: 169 [2021-10-13 07:00:30,207 INFO L226 Difference]: Without dead ends: 169 [2021-10-13 07:00:30,207 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 12931.2ms TimeCoverageRelationStatistics Valid=51, Invalid=79, Unknown=2, NotChecked=0, Total=132 [2021-10-13 07:00:30,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-10-13 07:00:30,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 128. [2021-10-13 07:00:30,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 92 states have (on average 1.5434782608695652) internal successors, (142), 127 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 142 transitions. [2021-10-13 07:00:30,220 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 142 transitions. Word has length 8 [2021-10-13 07:00:30,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:00:30,221 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 142 transitions. [2021-10-13 07:00:30,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:30,221 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2021-10-13 07:00:30,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 07:00:30,222 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:00:30,222 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:00:30,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-10-13 07:00:30,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:00:30,437 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 07:00:30,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:00:30,437 INFO L82 PathProgramCache]: Analyzing trace with hash 236809587, now seen corresponding path program 1 times [2021-10-13 07:00:30,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:00:30,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140234571] [2021-10-13 07:00:30,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:00:30,446 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:00:30,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:00:30,447 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:00:30,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-13 07:00:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:00:30,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 07:00:30,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:00:30,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:00:30,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-10-13 07:00:30,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-10-13 07:00:30,661 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-13 07:00:30,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:00:30,736 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-13 07:00:30,736 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:00:30,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140234571] [2021-10-13 07:00:30,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140234571] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:00:30,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:00:30,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-10-13 07:00:30,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217515705] [2021-10-13 07:00:30,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:00:30,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:00:30,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:00:30,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:00:30,739 INFO L87 Difference]: Start difference. First operand 128 states and 142 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:31,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:00:31,578 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2021-10-13 07:00:31,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:00:31,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-10-13 07:00:31,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:00:31,580 INFO L225 Difference]: With dead ends: 127 [2021-10-13 07:00:31,581 INFO L226 Difference]: Without dead ends: 127 [2021-10-13 07:00:31,581 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 90.0ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:00:31,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-10-13 07:00:31,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-10-13 07:00:31,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 92 states have (on average 1.5326086956521738) internal successors, (141), 126 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:31,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2021-10-13 07:00:31,591 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 11 [2021-10-13 07:00:31,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:00:31,592 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2021-10-13 07:00:31,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:31,593 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2021-10-13 07:00:31,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 07:00:31,593 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:00:31,594 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:00:31,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-13 07:00:31,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:00:31,808 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 07:00:31,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:00:31,808 INFO L82 PathProgramCache]: Analyzing trace with hash 236809588, now seen corresponding path program 1 times [2021-10-13 07:00:31,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:00:31,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258625956] [2021-10-13 07:00:31,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:00:31,810 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:00:31,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:00:31,811 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:00:31,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-13 07:00:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:00:31,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-13 07:00:31,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:00:31,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:00:32,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-13 07:00:32,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-10-13 07:00:32,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-10-13 07:00:32,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-10-13 07:00:32,122 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-13 07:00:32,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:00:32,510 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-13 07:00:32,510 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:00:32,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258625956] [2021-10-13 07:00:32,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258625956] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:00:32,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:00:32,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-10-13 07:00:32,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838363862] [2021-10-13 07:00:32,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 07:00:32,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:00:32,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 07:00:32,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-13 07:00:32,513 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:34,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:00:34,317 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2021-10-13 07:00:34,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 07:00:34,318 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-10-13 07:00:34,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:00:34,319 INFO L225 Difference]: With dead ends: 126 [2021-10-13 07:00:34,319 INFO L226 Difference]: Without dead ends: 126 [2021-10-13 07:00:34,320 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 448.1ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-10-13 07:00:34,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-10-13 07:00:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-10-13 07:00:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 92 states have (on average 1.5217391304347827) internal successors, (140), 125 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2021-10-13 07:00:34,328 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 11 [2021-10-13 07:00:34,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:00:34,328 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2021-10-13 07:00:34,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2021-10-13 07:00:34,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 07:00:34,330 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:00:34,330 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:00:34,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-10-13 07:00:34,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:00:34,545 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 07:00:34,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:00:34,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1283125910, now seen corresponding path program 1 times [2021-10-13 07:00:34,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:00:34,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555274959] [2021-10-13 07:00:34,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:00:34,547 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:00:34,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:00:34,548 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:00:34,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-13 07:00:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:00:34,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 07:00:34,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:00:34,743 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-13 07:00:34,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:00:34,804 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-13 07:00:34,804 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:00:34,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555274959] [2021-10-13 07:00:34,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1555274959] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:00:34,805 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:00:34,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-10-13 07:00:34,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283613374] [2021-10-13 07:00:34,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:00:34,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:00:34,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:00:34,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:00:34,808 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:35,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:00:35,322 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2021-10-13 07:00:35,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:00:35,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-13 07:00:35,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:00:35,325 INFO L225 Difference]: With dead ends: 157 [2021-10-13 07:00:35,325 INFO L226 Difference]: Without dead ends: 157 [2021-10-13 07:00:35,325 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:00:35,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-10-13 07:00:35,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 127. [2021-10-13 07:00:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 93 states have (on average 1.4946236559139785) internal successors, (139), 126 states have internal predecessors, (139), 0 states have call successors, (0), 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-13 07:00:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2021-10-13 07:00:35,333 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 12 [2021-10-13 07:00:35,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:00:35,333 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2021-10-13 07:00:35,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2021-10-13 07:00:35,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 07:00:35,335 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:00:35,335 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:00:35,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-13 07:00:35,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:00:35,549 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 07:00:35,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:00:35,549 INFO L82 PathProgramCache]: Analyzing trace with hash -356692446, now seen corresponding path program 1 times [2021-10-13 07:00:35,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:00:35,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068328025] [2021-10-13 07:00:35,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:00:35,550 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:00:35,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:00:35,552 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:00:35,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-13 07:00:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:00:35,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2021-10-13 07:00:35,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:00:35,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-13 07:00:35,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-13 07:00:35,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:00:35,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-13 07:00:35,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:00:35,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-13 07:00:35,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:00:35,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:00:35,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:00:35,938 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:00:35,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2021-10-13 07:00:35,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:00:35,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:00:35,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:00:35,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-10-13 07:00:36,187 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:00:36,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 31 [2021-10-13 07:00:36,196 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:00:36,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2021-10-13 07:00:36,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:00:36,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:00:36,428 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:00:36,431 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-10-13 07:00:36,435 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:00:36,436 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-10-13 07:00:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:00:36,517 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:00:36,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068328025] [2021-10-13 07:00:36,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068328025] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:00:36,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:00:36,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 9 [2021-10-13 07:00:36,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256557900] [2021-10-13 07:00:36,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 07:00:36,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:00:36,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 07:00:36,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:00:36,520 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:00:37,725 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2021-10-13 07:00:37,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 07:00:37,726 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-10-13 07:00:37,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:00:37,727 INFO L225 Difference]: With dead ends: 147 [2021-10-13 07:00:37,727 INFO L226 Difference]: Without dead ends: 147 [2021-10-13 07:00:37,728 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 374.0ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-10-13 07:00:37,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-10-13 07:00:37,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2021-10-13 07:00:37,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 97 states have (on average 1.4845360824742269) internal successors, (144), 130 states have internal predecessors, (144), 0 states have call successors, (0), 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-13 07:00:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2021-10-13 07:00:37,733 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 15 [2021-10-13 07:00:37,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:00:37,733 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2021-10-13 07:00:37,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:37,734 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2021-10-13 07:00:37,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 07:00:37,735 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:00:37,735 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:00:37,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-13 07:00:37,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:00:37,937 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 07:00:37,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:00:37,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1108053835, now seen corresponding path program 1 times [2021-10-13 07:00:37,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:00:37,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49074295] [2021-10-13 07:00:37,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:00:37,938 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:00:37,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:00:37,939 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:00:37,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-13 07:00:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:00:38,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 07:00:38,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:00:38,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:00:38,202 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 07:00:38,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2021-10-13 07:00:38,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-10-13 07:00:38,481 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-10-13 07:00:38,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2021-10-13 07:00:38,691 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-10-13 07:00:38,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 42 [2021-10-13 07:00:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:00:38,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:00:40,917 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|) c_ULTIMATE.start_main_~x~0.base)) c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))))))) (_ bv1 1)))) is different from false [2021-10-13 07:00:42,933 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|) c_ULTIMATE.start_main_~x~0.base))) c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))))))))))))) is different from false [2021-10-13 07:00:43,062 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-13 07:00:43,062 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:00:43,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49074295] [2021-10-13 07:00:43,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49074295] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:00:43,062 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:00:43,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [] total 14 [2021-10-13 07:00:43,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769078651] [2021-10-13 07:00:43,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 07:00:43,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:00:43,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 07:00:43,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=119, Unknown=2, NotChecked=46, Total=210 [2021-10-13 07:00:43,064 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:45,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:00:45,601 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2021-10-13 07:00:45,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 07:00:45,602 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-10-13 07:00:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:00:45,604 INFO L225 Difference]: With dead ends: 151 [2021-10-13 07:00:45,604 INFO L226 Difference]: Without dead ends: 151 [2021-10-13 07:00:45,604 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 5041.0ms TimeCoverageRelationStatistics Valid=134, Invalid=334, Unknown=2, NotChecked=82, Total=552 [2021-10-13 07:00:45,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-10-13 07:00:45,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 130. [2021-10-13 07:00:45,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 97 states have (on average 1.4742268041237114) internal successors, (143), 129 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:45,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2021-10-13 07:00:45,610 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 15 [2021-10-13 07:00:45,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:00:45,610 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2021-10-13 07:00:45,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:00:45,611 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2021-10-13 07:00:45,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 07:00:45,611 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:00:45,612 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:00:45,628 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-13 07:00:45,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:00:45,812 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 07:00:45,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:00:45,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1108053834, now seen corresponding path program 1 times [2021-10-13 07:00:45,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:00:45,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873336019] [2021-10-13 07:00:45,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:00:45,814 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:00:45,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:00:45,831 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:00:45,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-10-13 07:00:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:00:46,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2021-10-13 07:00:46,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:00:46,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:00:46,152 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-13 07:00:46,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2021-10-13 07:00:46,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:00:46,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-13 07:00:46,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-10-13 07:00:46,449 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-10-13 07:00:46,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 49 [2021-10-13 07:00:46,488 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-10-13 07:00:46,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2021-10-13 07:00:46,667 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-10-13 07:00:46,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 42 [2021-10-13 07:00:46,676 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-10-13 07:00:46,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 19 [2021-10-13 07:00:46,778 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-13 07:00:46,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:00:59,945 WARN L207 SmtUtils]: Spent 6.07 s on a formula simplification that was a NOOP. DAG size: 26 [2021-10-13 07:01:02,000 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset)) (.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 c_ULTIMATE.start_main_~x~0.offset)) c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 c_ULTIMATE.start_main_~x~0.base)) c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))))) (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse2 (select (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))) (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|) c_ULTIMATE.start_main_~x~0.offset))) c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) is different from false [2021-10-13 07:01:02,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:01:02,125 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:01:02,332 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-13 07:01:02,333 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:01:02,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873336019] [2021-10-13 07:01:02,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873336019] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:01:02,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:01:02,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2021-10-13 07:01:02,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297888456] [2021-10-13 07:01:02,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-13 07:01:02,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:01:02,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-13 07:01:02,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=172, Unknown=3, NotChecked=26, Total=240 [2021-10-13 07:01:02,335 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:01:29,603 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))) (and (= (select |c_#length| c_ULTIMATE.start_main_~x~0.base) (_ bv12 32)) (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base|) .cse0 c_ULTIMATE.start_main_~x~0.offset)) c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base|) .cse0 c_ULTIMATE.start_main_~x~0.base)) c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))))) (= (select |c_#length| .cse1) (_ bv12 32)) (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|) c_ULTIMATE.start_main_~x~0.offset)) c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset) (_ bv0 32)) (not (= c_ULTIMATE.start_main_~x~0.base .cse1)) (exists ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset)) (.cse4 (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) c_ULTIMATE.start_main_~x~0.offset) (= c_ULTIMATE.start_main_~x~0.base (select (select |c_#memory_$Pointer$.base| .cse3) .cse4))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| c_ULTIMATE.start_main_~head~0.base))) (_ bv1 1))) (= (_ bv0 32) c_ULTIMATE.start_main_~x~0.offset) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| c_ULTIMATE.start_main_~x~0.base))) (_ bv1 1))))) is different from false [2021-10-13 07:01:41,105 WARN L207 SmtUtils]: Spent 10.16 s on a formula simplification. DAG size of input: 71 DAG size of output: 35 [2021-10-13 07:01:49,673 WARN L207 SmtUtils]: Spent 6.15 s on a formula simplification. DAG size of input: 64 DAG size of output: 28 [2021-10-13 07:01:52,174 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))) (and (= (select |c_#length| c_ULTIMATE.start_main_~x~0.base) (_ bv12 32)) (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base|) .cse0 c_ULTIMATE.start_main_~x~0.offset)) c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base|) .cse0 c_ULTIMATE.start_main_~x~0.base)) c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))))) (= (select |c_#length| .cse1) (_ bv12 32)) (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|) c_ULTIMATE.start_main_~x~0.offset)) c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset) (_ bv0 32)) (not (= c_ULTIMATE.start_main_~x~0.base .cse1)) (exists ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset)) (.cse4 (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) c_ULTIMATE.start_main_~x~0.offset) (= c_ULTIMATE.start_main_~x~0.base (select (select |c_#memory_$Pointer$.base| .cse3) .cse4))))) (= (_ bv0 32) c_ULTIMATE.start_main_~x~0.offset) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| c_ULTIMATE.start_main_~x~0.base))) (_ bv1 1))))) is different from false [2021-10-13 07:01:53,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:01:53,275 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2021-10-13 07:01:53,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-10-13 07:01:53,276 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-10-13 07:01:53,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:01:53,277 INFO L225 Difference]: With dead ends: 208 [2021-10-13 07:01:53,278 INFO L226 Difference]: Without dead ends: 208 [2021-10-13 07:01:53,279 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 61025.2ms TimeCoverageRelationStatistics Valid=335, Invalid=1075, Unknown=8, NotChecked=222, Total=1640 [2021-10-13 07:01:53,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-10-13 07:01:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 128. [2021-10-13 07:01:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 127 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:01:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2021-10-13 07:01:53,284 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 15 [2021-10-13 07:01:53,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:01:53,284 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2021-10-13 07:01:53,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:01:53,285 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2021-10-13 07:01:53,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 07:01:53,286 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:01:53,286 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:01:53,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-10-13 07:01:53,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:01:53,499 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 07:01:53,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:01:53,500 INFO L82 PathProgramCache]: Analyzing trace with hash -2134365480, now seen corresponding path program 1 times [2021-10-13 07:01:53,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:01:53,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827437695] [2021-10-13 07:01:53,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:01:53,501 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:01:53,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:01:53,501 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:01:53,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-10-13 07:01:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:01:53,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 07:01:53,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:01:53,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-13 07:01:53,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-13 07:01:53,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:01:53,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-13 07:01:53,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:01:53,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-13 07:01:53,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:01:53,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:01:53,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:01:53,909 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:01:53,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2021-10-13 07:01:53,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:01:53,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:01:53,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:01:53,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-10-13 07:01:54,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:01:54,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:01:54,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:01:54,245 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:01:54,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2021-10-13 07:01:54,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:01:54,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:01:54,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:01:54,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-10-13 07:01:54,315 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:01:54,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 31 [2021-10-13 07:01:54,322 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:01:54,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2021-10-13 07:01:54,365 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-13 07:01:54,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:01:54,442 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:01:54,444 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-10-13 07:01:54,447 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:01:54,451 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-10-13 07:01:54,623 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:01:54,624 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-10-13 07:01:54,628 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:01:54,629 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-10-13 07:01:54,705 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-13 07:01:54,705 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:01:54,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827437695] [2021-10-13 07:01:54,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827437695] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:01:54,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:01:54,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 9 [2021-10-13 07:01:54,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626566670] [2021-10-13 07:01:54,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 07:01:54,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:01:54,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 07:01:54,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:01:54,708 INFO L87 Difference]: Start difference. First operand 128 states and 141 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:01:55,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:01:55,704 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2021-10-13 07:01:55,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 07:01:55,705 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-13 07:01:55,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:01:55,706 INFO L225 Difference]: With dead ends: 140 [2021-10-13 07:01:55,706 INFO L226 Difference]: Without dead ends: 140 [2021-10-13 07:01:55,707 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 399.8ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-10-13 07:01:55,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-10-13 07:01:55,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 133. [2021-10-13 07:01:55,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 102 states have (on average 1.4313725490196079) internal successors, (146), 132 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:01:55,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2021-10-13 07:01:55,712 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 17 [2021-10-13 07:01:55,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:01:55,720 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2021-10-13 07:01:55,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:01:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2021-10-13 07:01:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 07:01:55,721 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:01:55,721 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:01:55,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-10-13 07:01:55,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:01:55,922 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 07:01:55,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:01:55,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1847195620, now seen corresponding path program 1 times [2021-10-13 07:01:55,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:01:55,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170504006] [2021-10-13 07:01:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:01:55,923 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:01:55,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:01:55,923 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:01:55,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-10-13 07:01:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:01:56,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 07:01:56,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:01:56,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:01:56,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-10-13 07:01:56,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-10-13 07:01:56,210 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-13 07:01:56,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:01:56,277 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-13 07:01:56,277 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:01:56,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170504006] [2021-10-13 07:01:56,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170504006] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:01:56,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:01:56,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-10-13 07:01:56,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748164301] [2021-10-13 07:01:56,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:01:56,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:01:56,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:01:56,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:01:56,279 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:01:56,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:01:56,881 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2021-10-13 07:01:56,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:01:56,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 07:01:56,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:01:56,883 INFO L225 Difference]: With dead ends: 132 [2021-10-13 07:01:56,883 INFO L226 Difference]: Without dead ends: 132 [2021-10-13 07:01:56,883 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 73.4ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:01:56,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-10-13 07:01:56,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-10-13 07:01:56,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 131 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:01:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2021-10-13 07:01:56,887 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 19 [2021-10-13 07:01:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:01:56,888 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 145 transitions. [2021-10-13 07:01:56,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:01:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2021-10-13 07:01:56,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 07:01:56,889 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:01:56,889 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:01:56,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-10-13 07:01:57,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:01:57,102 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 07:01:57,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:01:57,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1847195621, now seen corresponding path program 1 times [2021-10-13 07:01:57,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:01:57,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872043644] [2021-10-13 07:01:57,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:01:57,104 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:01:57,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:01:57,105 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:01:57,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-10-13 07:01:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:01:57,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-13 07:01:57,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:01:57,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:01:57,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-10-13 07:01:57,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-13 07:01:57,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-10-13 07:01:57,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-10-13 07:01:57,503 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-13 07:01:57,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:01:57,845 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-13 07:01:57,845 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:01:57,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872043644] [2021-10-13 07:01:57,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872043644] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:01:57,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:01:57,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-10-13 07:01:57,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168078745] [2021-10-13 07:01:57,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 07:01:57,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:01:57,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 07:01:57,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-13 07:01:57,847 INFO L87 Difference]: Start difference. First operand 132 states and 145 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:01:59,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:01:59,441 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2021-10-13 07:01:59,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 07:01:59,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 07:01:59,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:01:59,443 INFO L225 Difference]: With dead ends: 131 [2021-10-13 07:01:59,444 INFO L226 Difference]: Without dead ends: 131 [2021-10-13 07:01:59,444 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 379.0ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-10-13 07:01:59,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-10-13 07:01:59,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-10-13 07:01:59,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.411764705882353) internal successors, (144), 130 states have internal predecessors, (144), 0 states have call successors, (0), 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-13 07:01:59,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2021-10-13 07:01:59,449 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 19 [2021-10-13 07:01:59,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:01:59,449 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2021-10-13 07:01:59,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:01:59,450 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2021-10-13 07:01:59,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 07:01:59,451 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:01:59,451 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:01:59,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-10-13 07:01:59,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:01:59,660 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 07:01:59,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:01:59,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1593684134, now seen corresponding path program 1 times [2021-10-13 07:01:59,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:01:59,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573856254] [2021-10-13 07:01:59,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:01:59,662 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:01:59,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:01:59,663 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:01:59,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-10-13 07:01:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:01:59,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 07:01:59,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:01:59,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:02:00,078 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 07:02:00,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2021-10-13 07:02:00,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-10-13 07:02:00,330 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-10-13 07:02:00,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2021-10-13 07:02:00,458 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-10-13 07:02:00,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 35 [2021-10-13 07:02:00,587 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-13 07:02:00,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:02:10,868 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-13 07:02:10,868 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:02:10,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573856254] [2021-10-13 07:02:10,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573856254] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:02:10,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:02:10,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2021-10-13 07:02:10,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496055564] [2021-10-13 07:02:10,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-13 07:02:10,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:02:10,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-13 07:02:10,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=132, Unknown=5, NotChecked=0, Total=182 [2021-10-13 07:02:10,870 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:02:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:02:14,955 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2021-10-13 07:02:14,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 07:02:14,956 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-13 07:02:14,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:02:14,957 INFO L225 Difference]: With dead ends: 138 [2021-10-13 07:02:14,957 INFO L226 Difference]: Without dead ends: 138 [2021-10-13 07:02:14,958 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 10820.9ms TimeCoverageRelationStatistics Valid=142, Invalid=359, Unknown=5, NotChecked=0, Total=506 [2021-10-13 07:02:14,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-10-13 07:02:14,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2021-10-13 07:02:14,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 129 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:02:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2021-10-13 07:02:14,962 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 23 [2021-10-13 07:02:14,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:02:14,963 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2021-10-13 07:02:14,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:02:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2021-10-13 07:02:14,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 07:02:14,964 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:02:14,965 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:02:14,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-10-13 07:02:15,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:02:15,176 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 07:02:15,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:02:15,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1593684135, now seen corresponding path program 1 times [2021-10-13 07:02:15,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:02:15,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042009515] [2021-10-13 07:02:15,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:02:15,178 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:02:15,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:02:15,179 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:02:15,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-10-13 07:02:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:02:15,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-13 07:02:15,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:02:15,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:02:15,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:02:15,623 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-13 07:02:15,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2021-10-13 07:02:15,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-10-13 07:02:15,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-13 07:02:15,889 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-10-13 07:02:15,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 49 [2021-10-13 07:02:15,919 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-10-13 07:02:15,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2021-10-13 07:02:16,066 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-10-13 07:02:16,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 42 [2021-10-13 07:02:16,079 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-10-13 07:02:16,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 19 [2021-10-13 07:02:16,197 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-13 07:02:16,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:02:22,439 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_#t~mem13.offset| (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))) (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem13.offset|) c_ULTIMATE.start_main_~x~0.offset))) c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|ULTIMATE.start_main_#t~mem13.offset| (_ BitVec 32))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset)) (.cse3 (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem13.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 c_ULTIMATE.start_main_~x~0.offset)) c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse3 c_ULTIMATE.start_main_~x~0.base)) c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset)))))) is different from false [2021-10-13 07:02:22,535 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:02:22,539 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 07:02:22,710 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-13 07:02:22,711 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:02:22,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042009515] [2021-10-13 07:02:22,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042009515] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:02:22,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:02:22,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2021-10-13 07:02:22,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354294169] [2021-10-13 07:02:22,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-13 07:02:22,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:02:22,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-13 07:02:22,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=174, Unknown=1, NotChecked=26, Total=240 [2021-10-13 07:02:22,713 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 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-13 07:02:45,679 WARN L207 SmtUtils]: Spent 9.40 s on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2021-10-13 07:02:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:02:47,503 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2021-10-13 07:02:47,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-13 07:02:47,505 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-13 07:02:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:02:47,506 INFO L225 Difference]: With dead ends: 134 [2021-10-13 07:02:47,507 INFO L226 Difference]: Without dead ends: 134 [2021-10-13 07:02:47,507 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 28104.2ms TimeCoverageRelationStatistics Valid=163, Invalid=538, Unknown=5, NotChecked=50, Total=756 [2021-10-13 07:02:47,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-10-13 07:02:47,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2021-10-13 07:02:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 102 states have (on average 1.3823529411764706) internal successors, (141), 127 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:02:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2021-10-13 07:02:47,512 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 23 [2021-10-13 07:02:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:02:47,512 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2021-10-13 07:02:47,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 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-13 07:02:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2021-10-13 07:02:47,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 07:02:47,514 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:02:47,514 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:02:47,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-10-13 07:02:47,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:02:47,715 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2021-10-13 07:02:47,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:02:47,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1672552343, now seen corresponding path program 1 times [2021-10-13 07:02:47,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:02:47,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242404943] [2021-10-13 07:02:47,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:02:47,716 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:02:47,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:02:47,716 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:02:47,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-10-13 07:02:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:02:48,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-13 07:02:48,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:02:48,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:02:48,158 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 07:02:48,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 32 [2021-10-13 07:02:48,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-10-13 07:02:48,552 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-10-13 07:02:48,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2021-10-13 07:02:51,087 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-10-13 07:02:51,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 63 [2021-10-13 07:02:51,282 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-10-13 07:02:51,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 62 [2021-10-13 07:02:51,722 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-13 07:02:51,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 61 [2021-10-13 07:02:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:02:51,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:02:52,206 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:02:52,208 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-10-13 07:03:17,323 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32)) (v_ULTIMATE.start_main_~x~0.offset_102 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|) c_ULTIMATE.start_main_~x~0.base)))) (let ((.cse1 (select (select .cse0 c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))) (store .cse0 .cse1 (store (store (select .cse0 .cse1) v_ULTIMATE.start_main_~x~0.offset_102 (_ bv0 32)) (bvadd (_ bv8 32) v_ULTIMATE.start_main_~x~0.offset_102) v_DerPreprocessor_7)))) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))))))))))) (_ bv1 1)))) is different from false [2021-10-13 07:03:19,354 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32)) (v_ULTIMATE.start_main_~x~0.offset_102 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|) c_ULTIMATE.start_main_~x~0.base))))) (let ((.cse1 (select (select .cse0 c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))) (store .cse0 .cse1 (store (store (select .cse0 .cse1) v_ULTIMATE.start_main_~x~0.offset_102 (_ bv0 32)) (bvadd (_ bv8 32) v_ULTIMATE.start_main_~x~0.offset_102) v_DerPreprocessor_7)))) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))))))))))) (_ bv1 1)))) is different from false [2021-10-13 07:03:19,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34603 treesize of output 34475 [2021-10-13 07:03:20,722 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:03:20,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242404943] [2021-10-13 07:03:20,725 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 07:03:20,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1556774622] [2021-10-13 07:03:20,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:03:20,725 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:03:20,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:03:20,728 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:03:20,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2021-10-13 07:03:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:03:21,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-13 07:03:21,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:03:21,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:03:21,520 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 07:03:21,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2021-10-13 07:03:21,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-10-13 07:03:22,246 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-10-13 07:03:22,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2021-10-13 07:03:23,821 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-10-13 07:03:23,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 63 [2021-10-13 07:03:24,066 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-10-13 07:03:24,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 60 [2021-10-13 07:03:24,719 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-13 07:03:24,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 52 [2021-10-13 07:03:24,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:03:24,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:03:24,996 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:03:24,997 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-10-13 07:03:39,299 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~x~0.offset (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7.base|) ULTIMATE.start_main_~x~0.offset (_ bv0 32)) (bvadd (_ bv8 32) ULTIMATE.start_main_~x~0.offset) v_DerPreprocessor_7)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)))))))))) (_ bv1 1)))) is different from false [2021-10-13 07:03:41,317 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_ULTIMATE.start_main_~x~0.offset_107 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (store (select |c_#memory_$Pointer$.base| .cse0) v_ULTIMATE.start_main_~x~0.offset_107 (_ bv0 32)) (bvadd (_ bv8 32) v_ULTIMATE.start_main_~x~0.offset_107) v_DerPreprocessor_7))) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)))))))))))) (_ bv1 1)))) is different from false [2021-10-13 07:03:43,350 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32)) (v_ULTIMATE.start_main_~x~0.offset_107 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|) c_ULTIMATE.start_main_~x~0.base)))) (let ((.cse1 (select (select .cse0 c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))) (store .cse0 .cse1 (store (store (select .cse0 .cse1) v_ULTIMATE.start_main_~x~0.offset_107 (_ bv0 32)) (bvadd (_ bv8 32) v_ULTIMATE.start_main_~x~0.offset_107) v_DerPreprocessor_7)))) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))))))))))))))) (_ bv1 1)))) is different from false [2021-10-13 07:03:45,376 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32)) (v_ULTIMATE.start_main_~x~0.offset_107 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|) c_ULTIMATE.start_main_~x~0.base))))) (let ((.cse1 (select (select .cse0 c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))) (store .cse0 .cse1 (store (store (select .cse0 .cse1) v_ULTIMATE.start_main_~x~0.offset_107 (_ bv0 32)) (bvadd (_ bv8 32) v_ULTIMATE.start_main_~x~0.offset_107) v_DerPreprocessor_7)))) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))))))))))))))) (_ bv1 1)))) is different from false [2021-10-13 07:03:45,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15836 treesize of output 15772 [2021-10-13 07:04:30,286 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 07:04:30,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805631570] [2021-10-13 07:04:30,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:04:30,286 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:04:30,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:04:30,288 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:04:30,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-10-13 07:04:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:04:30,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-13 07:04:30,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:04:30,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 07:04:30,676 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-13 07:04:30,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2021-10-13 07:04:30,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-10-13 07:04:31,012 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-10-13 07:04:31,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2021-10-13 07:04:34,537 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-10-13 07:04:34,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 43 [2021-10-13 07:04:34,714 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-10-13 07:04:34,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 49 [2021-10-13 07:04:35,085 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-13 07:04:35,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 25 [2021-10-13 07:04:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:04:35,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:04:35,187 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:04:35,188 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-10-13 07:04:37,311 INFO L354 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2021-10-13 07:04:37,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2021-10-13 07:04:39,324 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~x~0.offset (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32))) (= c_ULTIMATE.start_main_~x~0.base (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset (_ bv0 32)) (bvadd (_ bv8 32) ULTIMATE.start_main_~x~0.offset) v_DerPreprocessor_7)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) is different from false [2021-10-13 07:04:41,340 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~x~0.offset (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32))) (= |c_ULTIMATE.start_main_#t~mem7.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7.base|) ULTIMATE.start_main_~x~0.offset (_ bv0 32)) (bvadd (_ bv8 32) ULTIMATE.start_main_~x~0.offset) v_DerPreprocessor_7)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset))) is different from false [2021-10-13 07:05:01,959 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32)) (v_ULTIMATE.start_main_~x~0.offset_112 (_ BitVec 32))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|) c_ULTIMATE.start_main_~x~0.base)))) (let ((.cse1 (select (select .cse0 c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))) (= (select (select (store .cse0 .cse1 (store (store (select .cse0 .cse1) v_ULTIMATE.start_main_~x~0.offset_112 (_ bv0 32)) (bvadd (_ bv8 32) v_ULTIMATE.start_main_~x~0.offset_112) v_DerPreprocessor_7)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset) .cse1)))) is different from false [2021-10-13 07:05:03,993 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32)) (v_ULTIMATE.start_main_~x~0.offset_112 (_ BitVec 32))) (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|) c_ULTIMATE.start_main_~x~0.base))))) (let ((.cse1 (select (select .cse0 c_ULTIMATE.start_main_~x~0.base) c_ULTIMATE.start_main_~x~0.offset))) (= (select (select (store .cse0 .cse1 (store (store (select .cse0 .cse1) v_ULTIMATE.start_main_~x~0.offset_112 (_ bv0 32)) (bvadd (_ bv8 32) v_ULTIMATE.start_main_~x~0.offset_112) v_DerPreprocessor_7)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset) .cse1)))) is different from false [2021-10-13 07:05:04,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11966 treesize of output 11830 [2021-10-13 07:05:06,388 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 07:05:06,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:06,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-10-13 07:05:06,389 ERROR L172 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2021-10-13 07:05:06,389 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-10-13 07:05:06,394 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-13 07:05:06,395 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-13 07:05:06,396 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-13 07:05:06,396 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-13 07:05:06,396 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-13 07:05:06,396 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-13 07:05:06,396 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-13 07:05:06,397 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-13 07:05:06,397 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-13 07:05:06,397 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-13 07:05:06,397 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-13 07:05:06,397 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-13 07:05:06,397 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-13 07:05:06,398 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-13 07:05:06,398 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-13 07:05:06,398 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-13 07:05:06,398 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-13 07:05:06,398 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-13 07:05:06,399 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-13 07:05:06,399 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-13 07:05:06,399 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:05:06,399 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-13 07:05:06,399 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-13 07:05:06,400 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:05:06,400 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-13 07:05:06,400 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-13 07:05:06,400 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-13 07:05:06,400 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-13 07:05:06,401 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-13 07:05:06,401 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-13 07:05:06,401 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-13 07:05:06,401 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-13 07:05:06,401 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-10-13 07:05:06,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-13 07:05:06,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-13 07:05:06,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-13 07:05:06,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-13 07:05:06,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-13 07:05:06,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-13 07:05:06,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-13 07:05:06,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-13 07:05:06,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-13 07:05:06,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-13 07:05:06,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-13 07:05:06,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-10-13 07:05:06,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-13 07:05:06,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-13 07:05:06,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-10-13 07:05:06,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-10-13 07:05:06,405 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-13 07:05:06,405 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-13 07:05:06,405 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-10-13 07:05:06,405 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-10-13 07:05:06,405 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-10-13 07:05:06,405 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-13 07:05:06,406 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-10-13 07:05:06,406 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:05:06,406 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION [2021-10-13 07:05:06,406 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-10-13 07:05:06,406 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-13 07:05:06,407 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-10-13 07:05:06,407 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION [2021-10-13 07:05:06,407 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION [2021-10-13 07:05:06,407 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-10-13 07:05:06,407 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION [2021-10-13 07:05:06,408 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:05:06,408 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:05:06,408 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:05:06,408 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:05:06,440 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-10-13 07:05:06,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-10-13 07:05:06,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2021-10-13 07:05:07,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt [2021-10-13 07:05:07,031 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 07:05:07,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:05:07 BoogieIcfgContainer [2021-10-13 07:05:07,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 07:05:07,044 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 07:05:07,044 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 07:05:07,044 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 07:05:07,044 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:00:10" (3/4) ... [2021-10-13 07:05:07,047 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-13 07:05:07,047 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 07:05:07,048 INFO L168 Benchmark]: Toolchain (without parser) took 298498.84 ms. Allocated memory was 58.7 MB in the beginning and 293.6 MB in the end (delta: 234.9 MB). Free memory was 35.8 MB in the beginning and 185.3 MB in the end (delta: -149.5 MB). Peak memory consumption was 85.7 MB. Max. memory is 16.1 GB. [2021-10-13 07:05:07,048 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 58.7 MB. Free memory was 40.3 MB in the beginning and 40.2 MB in the end (delta: 44.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:05:07,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.98 ms. Allocated memory was 58.7 MB in the beginning and 90.2 MB in the end (delta: 31.5 MB). Free memory was 35.6 MB in the beginning and 65.7 MB in the end (delta: -30.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-13 07:05:07,049 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.61 ms. Allocated memory is still 90.2 MB. Free memory was 65.7 MB in the beginning and 63.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:05:07,049 INFO L168 Benchmark]: Boogie Preprocessor took 93.45 ms. Allocated memory is still 90.2 MB. Free memory was 63.4 MB in the beginning and 61.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:05:07,049 INFO L168 Benchmark]: RCFGBuilder took 1238.69 ms. Allocated memory is still 90.2 MB. Free memory was 61.3 MB in the beginning and 60.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:05:07,049 INFO L168 Benchmark]: TraceAbstraction took 296312.71 ms. Allocated memory was 90.2 MB in the beginning and 293.6 MB in the end (delta: 203.4 MB). Free memory was 59.8 MB in the beginning and 185.3 MB in the end (delta: -125.5 MB). Peak memory consumption was 176.0 MB. Max. memory is 16.1 GB. [2021-10-13 07:05:07,049 INFO L168 Benchmark]: Witness Printer took 3.35 ms. Allocated memory is still 293.6 MB. Free memory is still 185.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:05:07,051 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.33 ms. Allocated memory is still 58.7 MB. Free memory was 40.3 MB in the beginning and 40.2 MB in the end (delta: 44.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 727.98 ms. Allocated memory was 58.7 MB in the beginning and 90.2 MB in the end (delta: 31.5 MB). Free memory was 35.6 MB in the beginning and 65.7 MB in the end (delta: -30.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 113.61 ms. Allocated memory is still 90.2 MB. Free memory was 65.7 MB in the beginning and 63.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 93.45 ms. Allocated memory is still 90.2 MB. Free memory was 63.4 MB in the beginning and 61.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1238.69 ms. Allocated memory is still 90.2 MB. Free memory was 61.3 MB in the beginning and 60.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 296312.71 ms. Allocated memory was 90.2 MB in the beginning and 293.6 MB in the end (delta: 203.4 MB). Free memory was 59.8 MB in the beginning and 185.3 MB in the end (delta: -125.5 MB). Peak memory consumption was 176.0 MB. Max. memory is 16.1 GB. * Witness Printer took 3.35 ms. Allocated memory is still 293.6 MB. Free memory is still 185.3 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 - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L996] DLL* head = malloc(sizeof(DLL)); [L997] head->next = ((void*)0) [L998] head->prev = ((void*)0) [L999] head->data = 0 [L1001] DLL* x = head; [L1004] COND TRUE __VERIFIER_nondet_int() [L1004] x->next = malloc(sizeof(DLL)) [L1004] EXPR x->next [L1004] x->next->prev = x [L1004] EXPR x->next [L1004] x = x->next [L1004] x->next = ((void*)0) [L1004] x->data = 0 [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1007] x = head [L1008] EXPR x->next [L1008] COND TRUE x->next != ((void*)0) && __VERIFIER_nondet_int() [L1010] COND FALSE !(!(x != ((void*)0))) [L1011] EXPR x->next [L1011] x = x->next [L1008] x->next - UnprovableResult [Line: 997]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 997]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: 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: 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: 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: 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: 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: 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: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: 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 all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 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: 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: 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: 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: 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: 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: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 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: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1053]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1053]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 993]: 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, 146 locations, 69 error locations. Started 1 CEGAR loops. OverallTime: 296230.2ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 26.6ms, AutomataDifference: 104397.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1298 SDtfs, 1985 SDslu, 2870 SDs, 0 SdLazy, 4364 SolverSat, 337 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 21872.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 453 GetRequests, 262 SyntacticMatches, 16 SemanticMatches, 175 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 119809.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=0, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 164.1ms AutomataMinimizationTime, 15 MinimizatonAttempts, 213 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 159.9ms SsaConstructionTime, 734.1ms SatisfiabilityAnalysisTime, 46653.5ms InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 374 ConstructedInterpolants, 28 QuantifiedInterpolants, 4527 SizeOfPredicates, 85 NumberOfNonLiveVariables, 1104 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-10-13 07:05:07,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6905da26-484a-4eab-9597-33cd21a98390/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...