./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 57096758 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-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 b6c3d2366b1caeb6e7a3192ace7ebb6cdc580141 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-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 b6c3d2366b1caeb6e7a3192ace7ebb6cdc580141 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-5709675 [2021-10-16 02:54:24,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 02:54:24,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 02:54:24,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 02:54:24,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 02:54:24,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 02:54:24,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 02:54:24,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 02:54:24,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 02:54:24,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 02:54:24,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 02:54:24,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 02:54:24,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 02:54:24,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 02:54:24,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 02:54:24,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 02:54:24,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 02:54:24,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 02:54:24,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 02:54:24,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 02:54:24,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 02:54:24,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 02:54:24,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 02:54:24,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 02:54:24,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 02:54:24,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 02:54:24,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 02:54:24,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 02:54:24,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 02:54:24,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 02:54:24,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 02:54:24,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 02:54:24,601 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 02:54:24,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 02:54:24,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 02:54:24,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 02:54:24,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 02:54:24,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 02:54:24,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 02:54:24,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 02:54:24,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 02:54:24,610 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-10-16 02:54:24,662 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 02:54:24,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 02:54:24,664 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 02:54:24,671 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 02:54:24,671 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 02:54:24,672 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 02:54:24,672 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-16 02:54:24,672 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 02:54:24,673 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 02:54:24,673 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-16 02:54:24,674 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-16 02:54:24,675 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 02:54:24,675 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-16 02:54:24,675 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-16 02:54:24,676 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-16 02:54:24,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-16 02:54:24,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-16 02:54:24,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 02:54:24,677 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 02:54:24,678 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-16 02:54:24,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-16 02:54:24,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 02:54:24,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 02:54:24,679 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-16 02:54:24,679 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-16 02:54:24,679 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-16 02:54:24,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 02:54:24,682 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 02:54:24,682 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 02:54:24,682 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 02:54:24,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 02:54:24,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 02:54:24,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:54:24,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 02:54:24,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 02:54:24,684 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-16 02:54:24,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-16 02:54:24,685 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 02:54:24,685 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 02:54:24,685 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_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> b6c3d2366b1caeb6e7a3192ace7ebb6cdc580141 [2021-10-16 02:54:25,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 02:54:25,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 02:54:25,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 02:54:25,046 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 02:54:25,047 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 02:54:25,048 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2021-10-16 02:54:25,141 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/data/97b5b27b1/844c6324d9c043408c31cef6bc084c31/FLAG4ffcc613f [2021-10-16 02:54:25,805 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 02:54:25,811 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2021-10-16 02:54:25,839 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/data/97b5b27b1/844c6324d9c043408c31cef6bc084c31/FLAG4ffcc613f [2021-10-16 02:54:26,080 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/data/97b5b27b1/844c6324d9c043408c31cef6bc084c31 [2021-10-16 02:54:26,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 02:54:26,087 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 02:54:26,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 02:54:26,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 02:54:26,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 02:54:26,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:54:26" (1/1) ... [2021-10-16 02:54:26,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1844ec04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:54:26, skipping insertion in model container [2021-10-16 02:54:26,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:54:26" (1/1) ... [2021-10-16 02:54:26,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 02:54:26,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 02:54:26,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:54:26,699 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 02:54:26,796 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:54:26,826 INFO L208 MainTranslator]: Completed translation [2021-10-16 02:54:26,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:54:26 WrapperNode [2021-10-16 02:54:26,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 02:54:26,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 02:54:26,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 02:54:26,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 02:54:26,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:54:26" (1/1) ... [2021-10-16 02:54:26,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:54:26" (1/1) ... [2021-10-16 02:54:26,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 02:54:26,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 02:54:26,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 02:54:26,904 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 02:54:26,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:54:26" (1/1) ... [2021-10-16 02:54:26,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:54:26" (1/1) ... [2021-10-16 02:54:26,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:54:26" (1/1) ... [2021-10-16 02:54:26,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:54:26" (1/1) ... [2021-10-16 02:54:26,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:54:26" (1/1) ... [2021-10-16 02:54:27,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:54:26" (1/1) ... [2021-10-16 02:54:27,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:54:26" (1/1) ... [2021-10-16 02:54:27,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 02:54:27,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 02:54:27,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 02:54:27,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 02:54:27,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:54:26" (1/1) ... [2021-10-16 02:54:27,056 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:54:27,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:54:27,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 02:54:27,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 02:54:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-16 02:54:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-16 02:54:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-16 02:54:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-16 02:54:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 02:54:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-16 02:54:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-16 02:54:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-16 02:54:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 02:54:27,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 02:54:29,596 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 02:54:29,596 INFO L299 CfgBuilder]: Removed 47 assume(true) statements. [2021-10-16 02:54:29,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:54:29 BoogieIcfgContainer [2021-10-16 02:54:29,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 02:54:29,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 02:54:29,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 02:54:29,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 02:54:29,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:54:26" (1/3) ... [2021-10-16 02:54:29,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b47e27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:54:29, skipping insertion in model container [2021-10-16 02:54:29,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:54:26" (2/3) ... [2021-10-16 02:54:29,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b47e27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:54:29, skipping insertion in model container [2021-10-16 02:54:29,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:54:29" (3/3) ... [2021-10-16 02:54:29,613 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-1.i [2021-10-16 02:54:29,620 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 02:54:29,620 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 485 error locations. [2021-10-16 02:54:29,666 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 02:54:29,673 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-16 02:54:29,673 INFO L340 AbstractCegarLoop]: Starting to check reachability of 485 error locations. [2021-10-16 02:54:29,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 820 states, 334 states have (on average 2.6167664670658684) internal successors, (874), 819 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:29,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-16 02:54:29,715 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:54:29,715 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-16 02:54:29,716 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:54:29,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:54:29,722 INFO L82 PathProgramCache]: Analyzing trace with hash 40428, now seen corresponding path program 1 times [2021-10-16 02:54:29,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:54:29,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644176753] [2021-10-16 02:54:29,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:54:29,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:54:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:54:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:54:29,894 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:54:29,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644176753] [2021-10-16 02:54:29,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644176753] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:54:29,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:54:29,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-16 02:54:29,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183567246] [2021-10-16 02:54:29,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:54:29,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:54:29,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:54:29,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:54:29,934 INFO L87 Difference]: Start difference. First operand has 820 states, 334 states have (on average 2.6167664670658684) internal successors, (874), 819 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:54:30,909 INFO L93 Difference]: Finished difference Result 1022 states and 1086 transitions. [2021-10-16 02:54:30,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:54:30,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-16 02:54:30,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:54:30,934 INFO L225 Difference]: With dead ends: 1022 [2021-10-16 02:54:30,934 INFO L226 Difference]: Without dead ends: 1021 [2021-10-16 02:54:30,936 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:54:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2021-10-16 02:54:31,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 890. [2021-10-16 02:54:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 408 states have (on average 2.549019607843137) internal successors, (1040), 889 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1040 transitions. [2021-10-16 02:54:31,026 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1040 transitions. Word has length 2 [2021-10-16 02:54:31,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:54:31,027 INFO L470 AbstractCegarLoop]: Abstraction has 890 states and 1040 transitions. [2021-10-16 02:54:31,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1040 transitions. [2021-10-16 02:54:31,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-16 02:54:31,028 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:54:31,028 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-16 02:54:31,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-16 02:54:31,029 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:54:31,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:54:31,030 INFO L82 PathProgramCache]: Analyzing trace with hash 40429, now seen corresponding path program 1 times [2021-10-16 02:54:31,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:54:31,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709798358] [2021-10-16 02:54:31,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:54:31,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:54:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:54:31,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:54:31,083 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:54:31,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709798358] [2021-10-16 02:54:31,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709798358] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:54:31,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:54:31,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-16 02:54:31,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764502375] [2021-10-16 02:54:31,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:54:31,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:54:31,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:54:31,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:54:31,088 INFO L87 Difference]: Start difference. First operand 890 states and 1040 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:31,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:54:31,785 INFO L93 Difference]: Finished difference Result 890 states and 1041 transitions. [2021-10-16 02:54:31,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:54:31,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-16 02:54:31,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:54:31,792 INFO L225 Difference]: With dead ends: 890 [2021-10-16 02:54:31,792 INFO L226 Difference]: Without dead ends: 890 [2021-10-16 02:54:31,793 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:54:31,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2021-10-16 02:54:31,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2021-10-16 02:54:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 408 states have (on average 2.5441176470588234) internal successors, (1038), 887 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:31,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1038 transitions. [2021-10-16 02:54:31,836 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1038 transitions. Word has length 2 [2021-10-16 02:54:31,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:54:31,837 INFO L470 AbstractCegarLoop]: Abstraction has 888 states and 1038 transitions. [2021-10-16 02:54:31,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:31,837 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1038 transitions. [2021-10-16 02:54:31,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-16 02:54:31,838 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:54:31,838 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-16 02:54:31,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-16 02:54:31,842 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:54:31,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:54:31,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1282379395, now seen corresponding path program 1 times [2021-10-16 02:54:31,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:54:31,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024942015] [2021-10-16 02:54:31,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:54:31,845 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:54:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:54:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:54:31,934 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:54:31,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024942015] [2021-10-16 02:54:31,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024942015] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:54:31,934 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:54:31,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:54:31,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045346504] [2021-10-16 02:54:31,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:54:31,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:54:31,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:54:31,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:54:31,937 INFO L87 Difference]: Start difference. First operand 888 states and 1038 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:32,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:54:32,722 INFO L93 Difference]: Finished difference Result 951 states and 1016 transitions. [2021-10-16 02:54:32,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:54:32,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-16 02:54:32,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:54:32,729 INFO L225 Difference]: With dead ends: 951 [2021-10-16 02:54:32,729 INFO L226 Difference]: Without dead ends: 951 [2021-10-16 02:54:32,729 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:54:32,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2021-10-16 02:54:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 818. [2021-10-16 02:54:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 408 states have (on average 2.372549019607843) internal successors, (968), 817 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 968 transitions. [2021-10-16 02:54:32,750 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 968 transitions. Word has length 6 [2021-10-16 02:54:32,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:54:32,751 INFO L470 AbstractCegarLoop]: Abstraction has 818 states and 968 transitions. [2021-10-16 02:54:32,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:32,751 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 968 transitions. [2021-10-16 02:54:32,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-16 02:54:32,751 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:54:32,752 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-16 02:54:32,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-16 02:54:32,752 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:54:32,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:54:32,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1282379394, now seen corresponding path program 1 times [2021-10-16 02:54:32,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:54:32,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406616388] [2021-10-16 02:54:32,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:54:32,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:54:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:54:32,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:54:32,797 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:54:32,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406616388] [2021-10-16 02:54:32,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406616388] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:54:32,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:54:32,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:54:32,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223859389] [2021-10-16 02:54:32,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:54:32,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:54:32,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:54:32,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:54:32,800 INFO L87 Difference]: Start difference. First operand 818 states and 968 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:33,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:54:33,448 INFO L93 Difference]: Finished difference Result 750 states and 901 transitions. [2021-10-16 02:54:33,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:54:33,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-16 02:54:33,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:54:33,457 INFO L225 Difference]: With dead ends: 750 [2021-10-16 02:54:33,458 INFO L226 Difference]: Without dead ends: 750 [2021-10-16 02:54:33,458 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:54:33,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2021-10-16 02:54:33,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 748. [2021-10-16 02:54:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 408 states have (on average 2.200980392156863) internal successors, (898), 747 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 898 transitions. [2021-10-16 02:54:33,501 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 898 transitions. Word has length 6 [2021-10-16 02:54:33,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:54:33,502 INFO L470 AbstractCegarLoop]: Abstraction has 748 states and 898 transitions. [2021-10-16 02:54:33,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 898 transitions. [2021-10-16 02:54:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-16 02:54:33,503 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:54:33,503 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:54:33,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-16 02:54:33,504 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:54:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:54:33,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1099055580, now seen corresponding path program 1 times [2021-10-16 02:54:33,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:54:33,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283495898] [2021-10-16 02:54:33,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:54:33,505 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:54:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:54:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:54:33,588 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:54:33,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283495898] [2021-10-16 02:54:33,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283495898] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:54:33,589 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:54:33,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:54:33,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009686120] [2021-10-16 02:54:33,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 02:54:33,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:54:33,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 02:54:33,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:54:33,591 INFO L87 Difference]: Start difference. First operand 748 states and 898 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:34,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:54:34,611 INFO L93 Difference]: Finished difference Result 780 states and 845 transitions. [2021-10-16 02:54:34,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:54:34,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-16 02:54:34,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:54:34,616 INFO L225 Difference]: With dead ends: 780 [2021-10-16 02:54:34,617 INFO L226 Difference]: Without dead ends: 780 [2021-10-16 02:54:34,617 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 31.7ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-16 02:54:34,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2021-10-16 02:54:34,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 648. [2021-10-16 02:54:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 408 states have (on average 1.9534313725490196) internal successors, (797), 647 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 797 transitions. [2021-10-16 02:54:34,635 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 797 transitions. Word has length 7 [2021-10-16 02:54:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:54:34,635 INFO L470 AbstractCegarLoop]: Abstraction has 648 states and 797 transitions. [2021-10-16 02:54:34,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 797 transitions. [2021-10-16 02:54:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-16 02:54:34,636 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:54:34,637 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:54:34,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-16 02:54:34,637 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:54:34,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:54:34,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1099055581, now seen corresponding path program 1 times [2021-10-16 02:54:34,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:54:34,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596760917] [2021-10-16 02:54:34,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:54:34,639 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:54:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:54:34,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-16 02:54:34,705 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:54:34,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596760917] [2021-10-16 02:54:34,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596760917] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:54:34,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:54:34,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:54:34,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199035809] [2021-10-16 02:54:34,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 02:54:34,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:54:34,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 02:54:34,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:54:34,709 INFO L87 Difference]: Start difference. First operand 648 states and 797 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:35,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:54:35,477 INFO L93 Difference]: Finished difference Result 682 states and 747 transitions. [2021-10-16 02:54:35,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:54:35,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-16 02:54:35,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:54:35,482 INFO L225 Difference]: With dead ends: 682 [2021-10-16 02:54:35,482 INFO L226 Difference]: Without dead ends: 682 [2021-10-16 02:54:35,482 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-16 02:54:35,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2021-10-16 02:54:35,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 550. [2021-10-16 02:54:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 408 states have (on average 1.713235294117647) internal successors, (699), 549 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 699 transitions. [2021-10-16 02:54:35,497 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 699 transitions. Word has length 7 [2021-10-16 02:54:35,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:54:35,497 INFO L470 AbstractCegarLoop]: Abstraction has 550 states and 699 transitions. [2021-10-16 02:54:35,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:35,497 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 699 transitions. [2021-10-16 02:54:35,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-16 02:54:35,498 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:54:35,498 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:54:35,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-16 02:54:35,499 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:54:35,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:54:35,499 INFO L82 PathProgramCache]: Analyzing trace with hash 542418554, now seen corresponding path program 1 times [2021-10-16 02:54:35,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:54:35,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622075692] [2021-10-16 02:54:35,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:54:35,505 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:54:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:54:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:54:35,649 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:54:35,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622075692] [2021-10-16 02:54:35,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622075692] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:54:35,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:54:35,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-16 02:54:35,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617850476] [2021-10-16 02:54:35,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 02:54:35,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:54:35,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 02:54:35,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-16 02:54:35,651 INFO L87 Difference]: Start difference. First operand 550 states and 699 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:36,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:54:36,365 INFO L93 Difference]: Finished difference Result 565 states and 716 transitions. [2021-10-16 02:54:36,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-16 02:54:36,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-10-16 02:54:36,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:54:36,369 INFO L225 Difference]: With dead ends: 565 [2021-10-16 02:54:36,369 INFO L226 Difference]: Without dead ends: 565 [2021-10-16 02:54:36,369 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 51.5ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-10-16 02:54:36,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-10-16 02:54:36,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 555. [2021-10-16 02:54:36,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 413 states have (on average 1.7070217917675545) internal successors, (705), 554 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:36,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 705 transitions. [2021-10-16 02:54:36,383 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 705 transitions. Word has length 14 [2021-10-16 02:54:36,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:54:36,383 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 705 transitions. [2021-10-16 02:54:36,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:36,384 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 705 transitions. [2021-10-16 02:54:36,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-16 02:54:36,384 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:54:36,384 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:54:36,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-16 02:54:36,385 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:54:36,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:54:36,385 INFO L82 PathProgramCache]: Analyzing trace with hash 987317716, now seen corresponding path program 1 times [2021-10-16 02:54:36,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:54:36,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083497509] [2021-10-16 02:54:36,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:54:36,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:54:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:54:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:54:36,543 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:54:36,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083497509] [2021-10-16 02:54:36,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083497509] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:54:36,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:54:36,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-16 02:54:36,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274075931] [2021-10-16 02:54:36,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-16 02:54:36,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:54:36,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-16 02:54:36,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-16 02:54:36,546 INFO L87 Difference]: Start difference. First operand 555 states and 705 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:37,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:54:37,827 INFO L93 Difference]: Finished difference Result 689 states and 754 transitions. [2021-10-16 02:54:37,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-16 02:54:37,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-10-16 02:54:37,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:54:37,832 INFO L225 Difference]: With dead ends: 689 [2021-10-16 02:54:37,832 INFO L226 Difference]: Without dead ends: 689 [2021-10-16 02:54:37,832 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 85.9ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-16 02:54:37,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2021-10-16 02:54:37,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 557. [2021-10-16 02:54:37,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 415 states have (on average 1.7036144578313253) internal successors, (707), 556 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:37,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 707 transitions. [2021-10-16 02:54:37,868 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 707 transitions. Word has length 15 [2021-10-16 02:54:37,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:54:37,868 INFO L470 AbstractCegarLoop]: Abstraction has 557 states and 707 transitions. [2021-10-16 02:54:37,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:37,869 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 707 transitions. [2021-10-16 02:54:37,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-16 02:54:37,870 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:54:37,870 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, 1] [2021-10-16 02:54:37,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-16 02:54:37,870 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:54:37,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:54:37,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1209667245, now seen corresponding path program 1 times [2021-10-16 02:54:37,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:54:37,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830859301] [2021-10-16 02:54:37,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:54:37,872 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:54:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:54:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:54:38,411 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:54:38,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830859301] [2021-10-16 02:54:38,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830859301] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:54:38,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:54:38,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-16 02:54:38,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498170694] [2021-10-16 02:54:38,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-16 02:54:38,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:54:38,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-16 02:54:38,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-10-16 02:54:38,414 INFO L87 Difference]: Start difference. First operand 557 states and 707 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:54:40,317 INFO L93 Difference]: Finished difference Result 885 states and 964 transitions. [2021-10-16 02:54:40,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-16 02:54:40,318 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-10-16 02:54:40,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:54:40,333 INFO L225 Difference]: With dead ends: 885 [2021-10-16 02:54:40,333 INFO L226 Difference]: Without dead ends: 885 [2021-10-16 02:54:40,338 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 276.1ms TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2021-10-16 02:54:40,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2021-10-16 02:54:40,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 543. [2021-10-16 02:54:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 415 states have (on average 1.6698795180722892) internal successors, (693), 542 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:40,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 693 transitions. [2021-10-16 02:54:40,356 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 693 transitions. Word has length 26 [2021-10-16 02:54:40,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:54:40,357 INFO L470 AbstractCegarLoop]: Abstraction has 543 states and 693 transitions. [2021-10-16 02:54:40,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:40,357 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 693 transitions. [2021-10-16 02:54:40,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-16 02:54:40,358 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:54:40,359 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, 1] [2021-10-16 02:54:40,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-16 02:54:40,359 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:54:40,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:54:40,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1209667244, now seen corresponding path program 1 times [2021-10-16 02:54:40,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:54:40,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429821887] [2021-10-16 02:54:40,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:54:40,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:54:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:54:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:54:40,896 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:54:40,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429821887] [2021-10-16 02:54:40,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429821887] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:54:40,897 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:54:40,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-16 02:54:40,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950710248] [2021-10-16 02:54:40,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-16 02:54:40,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:54:40,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-16 02:54:40,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-10-16 02:54:40,899 INFO L87 Difference]: Start difference. First operand 543 states and 693 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:54:42,750 INFO L93 Difference]: Finished difference Result 661 states and 726 transitions. [2021-10-16 02:54:42,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-16 02:54:42,750 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-10-16 02:54:42,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:54:42,757 INFO L225 Difference]: With dead ends: 661 [2021-10-16 02:54:42,757 INFO L226 Difference]: Without dead ends: 661 [2021-10-16 02:54:42,757 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 322.0ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-10-16 02:54:42,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2021-10-16 02:54:42,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 529. [2021-10-16 02:54:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 415 states have (on average 1.636144578313253) internal successors, (679), 528 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 679 transitions. [2021-10-16 02:54:42,773 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 679 transitions. Word has length 26 [2021-10-16 02:54:42,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:54:42,773 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 679 transitions. [2021-10-16 02:54:42,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 679 transitions. [2021-10-16 02:54:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-10-16 02:54:42,791 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:54:42,792 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:54:42,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-16 02:54:42,792 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:54:42,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:54:42,793 INFO L82 PathProgramCache]: Analyzing trace with hash 23661925, now seen corresponding path program 1 times [2021-10-16 02:54:42,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:54:42,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828259344] [2021-10-16 02:54:42,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:54:42,796 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:54:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:54:42,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:54:42,965 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:54:42,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828259344] [2021-10-16 02:54:42,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828259344] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:54:42,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:54:42,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:54:42,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408230495] [2021-10-16 02:54:42,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:54:42,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:54:42,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:54:42,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:54:42,970 INFO L87 Difference]: Start difference. First operand 529 states and 679 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 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-16 02:54:43,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:54:43,098 INFO L93 Difference]: Finished difference Result 543 states and 693 transitions. [2021-10-16 02:54:43,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:54:43,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 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) Word has length 141 [2021-10-16 02:54:43,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:54:43,102 INFO L225 Difference]: With dead ends: 543 [2021-10-16 02:54:43,103 INFO L226 Difference]: Without dead ends: 543 [2021-10-16 02:54:43,103 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:54:43,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-10-16 02:54:43,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2021-10-16 02:54:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 429 states have (on average 1.6153846153846154) internal successors, (693), 542 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 693 transitions. [2021-10-16 02:54:43,117 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 693 transitions. Word has length 141 [2021-10-16 02:54:43,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:54:43,120 INFO L470 AbstractCegarLoop]: Abstraction has 543 states and 693 transitions. [2021-10-16 02:54:43,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 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-16 02:54:43,120 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 693 transitions. [2021-10-16 02:54:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-10-16 02:54:43,124 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:54:43,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:54:43,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-16 02:54:43,125 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:54:43,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:54:43,126 INFO L82 PathProgramCache]: Analyzing trace with hash 369862224, now seen corresponding path program 1 times [2021-10-16 02:54:43,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:54:43,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005022382] [2021-10-16 02:54:43,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:54:43,127 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:54:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:54:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:54:43,719 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:54:43,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005022382] [2021-10-16 02:54:43,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005022382] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:54:43,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:54:43,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-16 02:54:43,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933874623] [2021-10-16 02:54:43,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-16 02:54:43,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:54:43,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-16 02:54:43,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-10-16 02:54:43,722 INFO L87 Difference]: Start difference. First operand 543 states and 693 transitions. Second operand has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:54:44,937 INFO L93 Difference]: Finished difference Result 598 states and 637 transitions. [2021-10-16 02:54:44,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-16 02:54:44,938 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2021-10-16 02:54:44,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:54:44,942 INFO L225 Difference]: With dead ends: 598 [2021-10-16 02:54:44,942 INFO L226 Difference]: Without dead ends: 598 [2021-10-16 02:54:44,942 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 190.5ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-10-16 02:54:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2021-10-16 02:54:44,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 463. [2021-10-16 02:54:44,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 349 states have (on average 1.67621776504298) internal successors, (585), 462 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 585 transitions. [2021-10-16 02:54:44,955 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 585 transitions. Word has length 154 [2021-10-16 02:54:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:54:44,956 INFO L470 AbstractCegarLoop]: Abstraction has 463 states and 585 transitions. [2021-10-16 02:54:44,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:54:44,956 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 585 transitions. [2021-10-16 02:54:44,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-10-16 02:54:44,958 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:54:44,959 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:54:44,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-16 02:54:44,959 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:54:44,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:54:44,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1863193678, now seen corresponding path program 1 times [2021-10-16 02:54:44,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:54:44,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146363010] [2021-10-16 02:54:44,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:54:44,961 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:54:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:54:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:54:58,594 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:54:58,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146363010] [2021-10-16 02:54:58,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146363010] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:54:58,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:54:58,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-10-16 02:54:58,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650780966] [2021-10-16 02:54:58,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-10-16 02:54:58,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:54:58,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-10-16 02:54:58,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2021-10-16 02:54:58,599 INFO L87 Difference]: Start difference. First operand 463 states and 585 transitions. Second operand has 33 states, 32 states have (on average 5.21875) internal successors, (167), 32 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-16 02:55:00,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:55:00,493 INFO L93 Difference]: Finished difference Result 584 states and 622 transitions. [2021-10-16 02:55:00,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-16 02:55:00,494 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 5.21875) internal successors, (167), 32 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) Word has length 167 [2021-10-16 02:55:00,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:55:00,499 INFO L225 Difference]: With dead ends: 584 [2021-10-16 02:55:00,499 INFO L226 Difference]: Without dead ends: 584 [2021-10-16 02:55:00,500 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 53 SyntacticMatches, 29 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 1265.6ms TimeCoverageRelationStatistics Valid=272, Invalid=918, Unknown=0, NotChecked=0, Total=1190 [2021-10-16 02:55:00,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2021-10-16 02:55:00,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 462. [2021-10-16 02:55:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 354 states have (on average 1.6638418079096045) internal successors, (589), 461 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:55:00,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 589 transitions. [2021-10-16 02:55:00,513 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 589 transitions. Word has length 167 [2021-10-16 02:55:00,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:55:00,514 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 589 transitions. [2021-10-16 02:55:00,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 5.21875) internal successors, (167), 32 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-16 02:55:00,515 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 589 transitions. [2021-10-16 02:55:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-10-16 02:55:00,518 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:55:00,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:55:00,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-16 02:55:00,518 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr371REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:55:00,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:55:00,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1863193677, now seen corresponding path program 1 times [2021-10-16 02:55:00,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:55:00,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333045129] [2021-10-16 02:55:00,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:55:00,520 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:55:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:56:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:56:52,782 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:56:52,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333045129] [2021-10-16 02:56:52,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333045129] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:56:52,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:56:52,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-10-16 02:56:52,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081271920] [2021-10-16 02:56:52,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-10-16 02:56:52,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:56:52,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-10-16 02:56:52,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=555, Invalid=2415, Unknown=0, NotChecked=0, Total=2970 [2021-10-16 02:56:52,788 INFO L87 Difference]: Start difference. First operand 462 states and 589 transitions. Second operand has 55 states, 54 states have (on average 3.0925925925925926) internal successors, (167), 54 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-16 02:56:57,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:56:57,024 INFO L93 Difference]: Finished difference Result 576 states and 614 transitions. [2021-10-16 02:56:57,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-16 02:56:57,025 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 3.0925925925925926) internal successors, (167), 54 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) Word has length 167 [2021-10-16 02:56:57,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:56:57,028 INFO L225 Difference]: With dead ends: 576 [2021-10-16 02:56:57,028 INFO L226 Difference]: Without dead ends: 576 [2021-10-16 02:56:57,030 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 27 SyntacticMatches, 33 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2613 ImplicationChecksByTransitivity, 3083.5ms TimeCoverageRelationStatistics Valid=710, Invalid=2712, Unknown=0, NotChecked=0, Total=3422 [2021-10-16 02:56:57,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-10-16 02:56:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 466. [2021-10-16 02:56:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 359 states have (on average 1.6378830083565459) internal successors, (588), 465 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:56:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 588 transitions. [2021-10-16 02:56:57,043 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 588 transitions. Word has length 167 [2021-10-16 02:56:57,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:56:57,043 INFO L470 AbstractCegarLoop]: Abstraction has 466 states and 588 transitions. [2021-10-16 02:56:57,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 3.0925925925925926) internal successors, (167), 54 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-16 02:56:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 588 transitions. [2021-10-16 02:56:57,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-10-16 02:56:57,046 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:56:57,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 02:56:57,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-16 02:56:57,047 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:56:57,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:56:57,048 INFO L82 PathProgramCache]: Analyzing trace with hash 472631344, now seen corresponding path program 1 times [2021-10-16 02:56:57,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:56:57,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557095945] [2021-10-16 02:56:57,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:56:57,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:56:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:56:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:56:57,244 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:56:57,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557095945] [2021-10-16 02:56:57,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557095945] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:56:57,249 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:56:57,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:56:57,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210963209] [2021-10-16 02:56:57,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:56:57,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:56:57,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:56:57,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:56:57,251 INFO L87 Difference]: Start difference. First operand 466 states and 588 transitions. Second operand has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:56:57,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:56:57,985 INFO L93 Difference]: Finished difference Result 656 states and 702 transitions. [2021-10-16 02:56:57,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:56:57,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2021-10-16 02:56:57,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:56:57,995 INFO L225 Difference]: With dead ends: 656 [2021-10-16 02:56:57,995 INFO L226 Difference]: Without dead ends: 656 [2021-10-16 02:56:57,998 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:56:58,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2021-10-16 02:56:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 461. [2021-10-16 02:56:58,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 359 states have (on average 1.607242339832869) internal successors, (577), 460 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:56:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 577 transitions. [2021-10-16 02:56:58,017 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 577 transitions. Word has length 169 [2021-10-16 02:56:58,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:56:58,018 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 577 transitions. [2021-10-16 02:56:58,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:56:58,019 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 577 transitions. [2021-10-16 02:56:58,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-10-16 02:56:58,021 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:56:58,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 02:56:58,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-16 02:56:58,022 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:56:58,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:56:58,022 INFO L82 PathProgramCache]: Analyzing trace with hash 472631345, now seen corresponding path program 1 times [2021-10-16 02:56:58,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:56:58,023 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768494422] [2021-10-16 02:56:58,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:56:58,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:04,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:04,380 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:04,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768494422] [2021-10-16 02:57:04,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768494422] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:04,380 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:04,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-10-16 02:57:04,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796802033] [2021-10-16 02:57:04,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-10-16 02:57:04,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:04,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-10-16 02:57:04,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=910, Unknown=0, NotChecked=0, Total=1190 [2021-10-16 02:57:04,383 INFO L87 Difference]: Start difference. First operand 461 states and 577 transitions. Second operand has 35 states, 34 states have (on average 4.970588235294118) internal successors, (169), 34 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:06,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:06,089 INFO L93 Difference]: Finished difference Result 678 states and 722 transitions. [2021-10-16 02:57:06,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-16 02:57:06,090 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.970588235294118) internal successors, (169), 34 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2021-10-16 02:57:06,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:06,093 INFO L225 Difference]: With dead ends: 678 [2021-10-16 02:57:06,094 INFO L226 Difference]: Without dead ends: 678 [2021-10-16 02:57:06,095 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 19 SyntacticMatches, 62 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1864 ImplicationChecksByTransitivity, 1374.9ms TimeCoverageRelationStatistics Valid=460, Invalid=1346, Unknown=0, NotChecked=0, Total=1806 [2021-10-16 02:57:06,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2021-10-16 02:57:06,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 461. [2021-10-16 02:57:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 359 states have (on average 1.6044568245125348) internal successors, (576), 460 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:06,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 576 transitions. [2021-10-16 02:57:06,109 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 576 transitions. Word has length 169 [2021-10-16 02:57:06,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:06,109 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 576 transitions. [2021-10-16 02:57:06,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.970588235294118) internal successors, (169), 34 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 576 transitions. [2021-10-16 02:57:06,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-10-16 02:57:06,112 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:06,112 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:06,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-16 02:57:06,113 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr375REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:57:06,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:06,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1067434434, now seen corresponding path program 1 times [2021-10-16 02:57:06,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:06,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113986602] [2021-10-16 02:57:06,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:06,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:06,309 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:06,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113986602] [2021-10-16 02:57:06,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113986602] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:06,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:06,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 02:57:06,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502030375] [2021-10-16 02:57:06,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 02:57:06,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:06,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 02:57:06,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:57:06,312 INFO L87 Difference]: Start difference. First operand 461 states and 576 transitions. Second operand has 5 states, 4 states have (on average 42.75) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:07,274 INFO L93 Difference]: Finished difference Result 810 states and 867 transitions. [2021-10-16 02:57:07,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-16 02:57:07,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 42.75) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2021-10-16 02:57:07,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:07,281 INFO L225 Difference]: With dead ends: 810 [2021-10-16 02:57:07,282 INFO L226 Difference]: Without dead ends: 810 [2021-10-16 02:57:07,282 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.8ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-16 02:57:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2021-10-16 02:57:07,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 461. [2021-10-16 02:57:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 359 states have (on average 1.5905292479108635) internal successors, (571), 460 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 571 transitions. [2021-10-16 02:57:07,298 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 571 transitions. Word has length 171 [2021-10-16 02:57:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:07,299 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 571 transitions. [2021-10-16 02:57:07,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 42.75) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 571 transitions. [2021-10-16 02:57:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-10-16 02:57:07,302 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:07,302 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:07,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-16 02:57:07,303 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:57:07,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:07,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1269271748, now seen corresponding path program 1 times [2021-10-16 02:57:07,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:07,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117259692] [2021-10-16 02:57:07,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:07,304 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:23,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:23,803 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:23,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117259692] [2021-10-16 02:57:23,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117259692] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:23,803 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:23,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2021-10-16 02:57:23,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39725096] [2021-10-16 02:57:23,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-10-16 02:57:23,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:23,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-10-16 02:57:23,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=2271, Unknown=0, NotChecked=0, Total=2652 [2021-10-16 02:57:23,807 INFO L87 Difference]: Start difference. First operand 461 states and 571 transitions. Second operand has 52 states, 52 states have (on average 3.3076923076923075) internal successors, (172), 51 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:32,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:32,798 INFO L93 Difference]: Finished difference Result 694 states and 739 transitions. [2021-10-16 02:57:32,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-16 02:57:32,799 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.3076923076923075) internal successors, (172), 51 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2021-10-16 02:57:32,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:32,802 INFO L225 Difference]: With dead ends: 694 [2021-10-16 02:57:32,802 INFO L226 Difference]: Without dead ends: 694 [2021-10-16 02:57:32,804 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 15 SyntacticMatches, 53 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2623 ImplicationChecksByTransitivity, 6990.9ms TimeCoverageRelationStatistics Valid=905, Invalid=4351, Unknown=0, NotChecked=0, Total=5256 [2021-10-16 02:57:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2021-10-16 02:57:32,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 459. [2021-10-16 02:57:32,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 357 states have (on average 1.5854341736694677) internal successors, (566), 458 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 566 transitions. [2021-10-16 02:57:32,819 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 566 transitions. Word has length 172 [2021-10-16 02:57:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:32,820 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 566 transitions. [2021-10-16 02:57:32,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.3076923076923075) internal successors, (172), 51 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:32,820 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 566 transitions. [2021-10-16 02:57:32,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 02:57:32,823 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:32,823 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:32,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-16 02:57:32,824 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr380REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:57:32,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:32,824 INFO L82 PathProgramCache]: Analyzing trace with hash 8085008, now seen corresponding path program 1 times [2021-10-16 02:57:32,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:32,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637500903] [2021-10-16 02:57:32,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:32,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:32,997 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:32,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637500903] [2021-10-16 02:57:32,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637500903] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:32,997 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:32,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 02:57:32,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907159263] [2021-10-16 02:57:32,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:57:32,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:32,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:57:33,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:57:33,000 INFO L87 Difference]: Start difference. First operand 459 states and 566 transitions. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:33,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:33,028 INFO L93 Difference]: Finished difference Result 556 states and 664 transitions. [2021-10-16 02:57:33,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:57:33,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 02:57:33,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:33,033 INFO L225 Difference]: With dead ends: 556 [2021-10-16 02:57:33,033 INFO L226 Difference]: Without dead ends: 556 [2021-10-16 02:57:33,034 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:57:33,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-10-16 02:57:33,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 458. [2021-10-16 02:57:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 356 states have (on average 1.5730337078651686) internal successors, (560), 457 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:33,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 560 transitions. [2021-10-16 02:57:33,047 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 560 transitions. Word has length 174 [2021-10-16 02:57:33,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:33,048 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 560 transitions. [2021-10-16 02:57:33,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 560 transitions. [2021-10-16 02:57:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-10-16 02:57:33,051 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:33,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:33,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-16 02:57:33,052 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr387REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:57:33,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:33,052 INFO L82 PathProgramCache]: Analyzing trace with hash -808731296, now seen corresponding path program 1 times [2021-10-16 02:57:33,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:33,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772476628] [2021-10-16 02:57:33,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:33,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:33,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:33,226 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:33,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772476628] [2021-10-16 02:57:33,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772476628] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:33,226 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:33,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 02:57:33,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447751448] [2021-10-16 02:57:33,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:57:33,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:33,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:57:33,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:57:33,229 INFO L87 Difference]: Start difference. First operand 458 states and 560 transitions. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:33,255 INFO L93 Difference]: Finished difference Result 528 states and 627 transitions. [2021-10-16 02:57:33,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:57:33,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2021-10-16 02:57:33,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:33,260 INFO L225 Difference]: With dead ends: 528 [2021-10-16 02:57:33,260 INFO L226 Difference]: Without dead ends: 528 [2021-10-16 02:57:33,261 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:57:33,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-10-16 02:57:33,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 456. [2021-10-16 02:57:33,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 354 states have (on average 1.5564971751412429) internal successors, (551), 455 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 551 transitions. [2021-10-16 02:57:33,273 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 551 transitions. Word has length 176 [2021-10-16 02:57:33,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:33,274 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 551 transitions. [2021-10-16 02:57:33,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:33,275 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 551 transitions. [2021-10-16 02:57:33,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-10-16 02:57:33,277 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:33,278 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:33,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-16 02:57:33,278 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr394REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:57:33,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:33,279 INFO L82 PathProgramCache]: Analyzing trace with hash 212678225, now seen corresponding path program 1 times [2021-10-16 02:57:33,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:33,280 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654397960] [2021-10-16 02:57:33,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:33,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:33,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:33,454 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:33,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654397960] [2021-10-16 02:57:33,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654397960] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:33,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:33,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 02:57:33,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314384206] [2021-10-16 02:57:33,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:57:33,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:33,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:57:33,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:57:33,459 INFO L87 Difference]: Start difference. First operand 456 states and 551 transitions. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:33,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:33,486 INFO L93 Difference]: Finished difference Result 493 states and 581 transitions. [2021-10-16 02:57:33,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:57:33,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2021-10-16 02:57:33,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:33,490 INFO L225 Difference]: With dead ends: 493 [2021-10-16 02:57:33,491 INFO L226 Difference]: Without dead ends: 493 [2021-10-16 02:57:33,491 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:57:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2021-10-16 02:57:33,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 453. [2021-10-16 02:57:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 351 states have (on average 1.5356125356125356) internal successors, (539), 452 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 539 transitions. [2021-10-16 02:57:33,503 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 539 transitions. Word has length 178 [2021-10-16 02:57:33,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:33,504 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 539 transitions. [2021-10-16 02:57:33,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 539 transitions. [2021-10-16 02:57:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-10-16 02:57:33,507 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:33,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:33,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-16 02:57:33,508 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr404REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:57:33,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:33,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1757418362, now seen corresponding path program 1 times [2021-10-16 02:57:33,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:33,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953700704] [2021-10-16 02:57:33,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:33,510 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:33,693 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:33,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953700704] [2021-10-16 02:57:33,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953700704] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:33,694 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:33,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 02:57:33,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235958335] [2021-10-16 02:57:33,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:57:33,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:33,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:57:33,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:57:33,697 INFO L87 Difference]: Start difference. First operand 453 states and 539 transitions. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:33,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:33,721 INFO L93 Difference]: Finished difference Result 451 states and 526 transitions. [2021-10-16 02:57:33,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:57:33,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2021-10-16 02:57:33,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:33,726 INFO L225 Difference]: With dead ends: 451 [2021-10-16 02:57:33,726 INFO L226 Difference]: Without dead ends: 451 [2021-10-16 02:57:33,729 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:57:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-10-16 02:57:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 449. [2021-10-16 02:57:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 347 states have (on average 1.5100864553314122) internal successors, (524), 448 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 524 transitions. [2021-10-16 02:57:33,741 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 524 transitions. Word has length 180 [2021-10-16 02:57:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:33,742 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 524 transitions. [2021-10-16 02:57:33,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 524 transitions. [2021-10-16 02:57:33,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-10-16 02:57:33,746 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:33,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:33,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-16 02:57:33,747 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr417ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:57:33,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:33,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1273810777, now seen corresponding path program 1 times [2021-10-16 02:57:33,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:33,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630975748] [2021-10-16 02:57:33,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:33,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:40,113 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:40,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630975748] [2021-10-16 02:57:40,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630975748] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:40,114 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:40,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-16 02:57:40,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498602179] [2021-10-16 02:57:40,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-10-16 02:57:40,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:40,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-10-16 02:57:40,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2021-10-16 02:57:40,117 INFO L87 Difference]: Start difference. First operand 449 states and 524 transitions. Second operand has 31 states, 30 states have (on average 6.1) internal successors, (183), 30 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:41,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:41,873 INFO L93 Difference]: Finished difference Result 511 states and 543 transitions. [2021-10-16 02:57:41,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-16 02:57:41,873 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 6.1) internal successors, (183), 30 states have internal predecessors, (183), 0 states have call successors, (0), 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 183 [2021-10-16 02:57:41,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:41,876 INFO L225 Difference]: With dead ends: 511 [2021-10-16 02:57:41,876 INFO L226 Difference]: Without dead ends: 511 [2021-10-16 02:57:41,877 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 45 SyntacticMatches, 39 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 1397.0ms TimeCoverageRelationStatistics Valid=300, Invalid=890, Unknown=0, NotChecked=0, Total=1190 [2021-10-16 02:57:41,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-10-16 02:57:41,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 454. [2021-10-16 02:57:41,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 352 states have (on average 1.5028409090909092) internal successors, (529), 453 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 529 transitions. [2021-10-16 02:57:41,887 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 529 transitions. Word has length 183 [2021-10-16 02:57:41,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:41,888 INFO L470 AbstractCegarLoop]: Abstraction has 454 states and 529 transitions. [2021-10-16 02:57:41,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 6.1) internal successors, (183), 30 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:41,889 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 529 transitions. [2021-10-16 02:57:41,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-10-16 02:57:41,891 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:41,891 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:41,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-16 02:57:41,892 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr424REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:57:41,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:41,893 INFO L82 PathProgramCache]: Analyzing trace with hash 823717848, now seen corresponding path program 1 times [2021-10-16 02:57:41,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:41,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486526706] [2021-10-16 02:57:41,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:41,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:42,037 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:42,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486526706] [2021-10-16 02:57:42,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486526706] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:42,037 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:42,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:57:42,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855865100] [2021-10-16 02:57:42,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:57:42,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:42,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:57:42,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:42,040 INFO L87 Difference]: Start difference. First operand 454 states and 529 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:42,057 INFO L93 Difference]: Finished difference Result 424 states and 447 transitions. [2021-10-16 02:57:42,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:57:42,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-10-16 02:57:42,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:42,061 INFO L225 Difference]: With dead ends: 424 [2021-10-16 02:57:42,061 INFO L226 Difference]: Without dead ends: 424 [2021-10-16 02:57:42,061 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:57:42,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2021-10-16 02:57:42,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 408. [2021-10-16 02:57:42,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 306 states have (on average 1.408496732026144) internal successors, (431), 407 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 431 transitions. [2021-10-16 02:57:42,071 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 431 transitions. Word has length 184 [2021-10-16 02:57:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:42,072 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 431 transitions. [2021-10-16 02:57:42,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 431 transitions. [2021-10-16 02:57:42,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-10-16 02:57:42,074 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:42,074 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:42,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-16 02:57:42,075 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr484ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:57:42,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:42,075 INFO L82 PathProgramCache]: Analyzing trace with hash 2061825509, now seen corresponding path program 1 times [2021-10-16 02:57:42,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:42,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606931908] [2021-10-16 02:57:42,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:42,076 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:57:44,290 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:44,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606931908] [2021-10-16 02:57:44,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606931908] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:57:44,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:57:44,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-16 02:57:44,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303233289] [2021-10-16 02:57:44,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-16 02:57:44,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:57:44,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-16 02:57:44,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-10-16 02:57:44,293 INFO L87 Difference]: Start difference. First operand 408 states and 431 transitions. Second operand has 13 states, 13 states have (on average 14.307692307692308) internal successors, (186), 13 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:45,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:57:45,324 INFO L93 Difference]: Finished difference Result 411 states and 434 transitions. [2021-10-16 02:57:45,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-16 02:57:45,325 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 14.307692307692308) internal successors, (186), 13 states have internal predecessors, (186), 0 states have call successors, (0), 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 186 [2021-10-16 02:57:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:57:45,327 INFO L225 Difference]: With dead ends: 411 [2021-10-16 02:57:45,327 INFO L226 Difference]: Without dead ends: 411 [2021-10-16 02:57:45,328 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 329.6ms TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2021-10-16 02:57:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2021-10-16 02:57:45,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 410. [2021-10-16 02:57:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 308 states have (on average 1.405844155844156) internal successors, (433), 409 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 433 transitions. [2021-10-16 02:57:45,338 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 433 transitions. Word has length 186 [2021-10-16 02:57:45,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:57:45,339 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 433 transitions. [2021-10-16 02:57:45,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.307692307692308) internal successors, (186), 13 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:57:45,340 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 433 transitions. [2021-10-16 02:57:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-10-16 02:57:45,341 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:57:45,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:57:45,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-16 02:57:45,342 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:57:45,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:57:45,343 INFO L82 PathProgramCache]: Analyzing trace with hash -507926207, now seen corresponding path program 1 times [2021-10-16 02:57:45,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:57:45,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297568712] [2021-10-16 02:57:45,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:45,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:57:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:57:58,012 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-16 02:57:58,012 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:57:58,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297568712] [2021-10-16 02:57:58,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297568712] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-16 02:57:58,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629472248] [2021-10-16 02:57:58,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:57:58,013 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:57:58,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:57:58,015 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 02:57:58,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-16 02:58:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:58:00,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 358 conjunts are in the unsatisfiable core [2021-10-16 02:58:00,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:58:00,775 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-10-16 02:58:00,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2021-10-16 02:58:00,815 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-16 02:58:01,023 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-10-16 02:58:01,029 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-16 02:58:01,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-10-16 02:58:01,418 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-16 02:58:01,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 16 [2021-10-16 02:58:01,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-16 02:58:01,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-16 02:58:01,590 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 22 treesize of output 17 [2021-10-16 02:58:01,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2021-10-16 02:58:01,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:01,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:01,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:01,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:01,661 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 40 treesize of output 34 [2021-10-16 02:58:01,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:01,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:01,686 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 23 treesize of output 22 [2021-10-16 02:58:01,854 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:58:01,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 74 [2021-10-16 02:58:01,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:01,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:01,866 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:58:01,867 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 90 treesize of output 88 [2021-10-16 02:58:02,181 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-10-16 02:58:02,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-10-16 02:58:02,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:02,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:02,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:02,400 INFO L354 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2021-10-16 02:58:02,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 111 treesize of output 87 [2021-10-16 02:58:02,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:02,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:02,432 INFO L354 Elim1Store]: treesize reduction 80, result has 22.3 percent of original size [2021-10-16 02:58:02,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 90 [2021-10-16 02:58:02,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:03,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:03,019 INFO L354 Elim1Store]: treesize reduction 80, result has 22.3 percent of original size [2021-10-16 02:58:03,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 112 [2021-10-16 02:58:03,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:03,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:03,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:03,067 INFO L354 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2021-10-16 02:58:03,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 94 treesize of output 81 [2021-10-16 02:58:03,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:03,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:03,204 INFO L354 Elim1Store]: treesize reduction 80, result has 22.3 percent of original size [2021-10-16 02:58:03,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 112 [2021-10-16 02:58:03,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:03,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:03,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:03,235 INFO L354 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2021-10-16 02:58:03,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 103 treesize of output 90 [2021-10-16 02:58:03,580 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:58:03,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 25 [2021-10-16 02:58:03,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:03,786 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:58:03,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:03,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:03,821 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-10-16 02:58:03,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 93 treesize of output 71 [2021-10-16 02:58:04,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:04,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:04,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:04,064 INFO L354 Elim1Store]: treesize reduction 93, result has 8.8 percent of original size [2021-10-16 02:58:04,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 108 treesize of output 72 [2021-10-16 02:58:04,328 INFO L354 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2021-10-16 02:58:04,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2021-10-16 02:58:04,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:04,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:04,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:04,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:04,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:04,677 INFO L354 Elim1Store]: treesize reduction 138, result has 19.8 percent of original size [2021-10-16 02:58:04,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 114 treesize of output 86 [2021-10-16 02:58:05,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:05,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:05,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:05,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:05,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:05,570 INFO L354 Elim1Store]: treesize reduction 138, result has 19.8 percent of original size [2021-10-16 02:58:05,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 116 treesize of output 99 [2021-10-16 02:58:05,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:05,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:05,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:05,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:05,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:05,799 INFO L354 Elim1Store]: treesize reduction 140, result has 18.6 percent of original size [2021-10-16 02:58:05,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 116 treesize of output 97 [2021-10-16 02:58:06,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:06,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:58:06,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:06,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:06,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:06,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:06,710 INFO L354 Elim1Store]: treesize reduction 276, result has 18.1 percent of original size [2021-10-16 02:58:06,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 22 case distinctions, treesize of input 138 treesize of output 117 [2021-10-16 02:58:07,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:07,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:07,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:07,206 INFO L354 Elim1Store]: treesize reduction 200, result has 8.7 percent of original size [2021-10-16 02:58:07,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 16 case distinctions, treesize of input 202 treesize of output 106 [2021-10-16 02:58:07,558 INFO L354 Elim1Store]: treesize reduction 148, result has 33.0 percent of original size [2021-10-16 02:58:07,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 50 treesize of output 93 [2021-10-16 02:58:07,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:07,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:07,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:07,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:07,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:07,966 INFO L354 Elim1Store]: treesize reduction 256, result has 11.4 percent of original size [2021-10-16 02:58:07,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 18 case distinctions, treesize of input 206 treesize of output 118 [2021-10-16 02:58:08,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:08,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:08,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:08,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:08,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:09,005 INFO L354 Elim1Store]: treesize reduction 256, result has 11.4 percent of original size [2021-10-16 02:58:09,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 18 case distinctions, treesize of input 204 treesize of output 127 [2021-10-16 02:58:09,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:09,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:09,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:09,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:09,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:09,316 INFO L354 Elim1Store]: treesize reduction 256, result has 11.4 percent of original size [2021-10-16 02:58:09,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 18 case distinctions, treesize of input 204 treesize of output 127 [2021-10-16 02:58:10,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:10,118 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-16 02:58:10,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:10,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:10,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:10,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:10,265 INFO L354 Elim1Store]: treesize reduction 388, result has 17.4 percent of original size [2021-10-16 02:58:10,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 30 case distinctions, treesize of input 284 treesize of output 171 [2021-10-16 02:58:11,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:11,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:11,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:11,481 INFO L354 Elim1Store]: treesize reduction 324, result has 8.0 percent of original size [2021-10-16 02:58:11,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 295 treesize of output 143 [2021-10-16 02:58:12,013 INFO L354 Elim1Store]: treesize reduction 270, result has 32.8 percent of original size [2021-10-16 02:58:12,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 187 treesize of output 273 [2021-10-16 02:58:12,227 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: No corresponding IProgramVar for |v_ULTIMATE.start_append_#t~mem62.offset_135| [2021-10-16 02:58:12,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [742020328] [2021-10-16 02:58:12,259 INFO L159 IcfgInterpreter]: Started Sifa with 186 locations of interest [2021-10-16 02:58:12,260 INFO L166 IcfgInterpreter]: Building call graph [2021-10-16 02:58:12,266 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-16 02:58:12,273 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-16 02:58:12,273 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-16 02:58:12,959 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:58:12,961 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-16 02:58:12,962 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:58:12,962 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-10-16 02:58:12,963 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-16 02:58:12,964 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:58:12,964 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-16 02:58:12,969 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-10-16 02:58:12,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:12,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:12,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:58:12,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2021-10-16 02:58:13,005 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:58:13,006 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-16 02:58:13,007 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:58:13,007 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-16 02:58:13,008 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-16 02:58:13,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:58:13,026 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:58:13,027 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:58:13,029 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-10-16 02:58:13,030 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-16 02:58:13,030 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:110, output treesize:113 [2021-10-16 02:58:13,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-16 02:58:13,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-10-16 02:58:13,245 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: No corresponding IProgramVar for |v_#valid_706| 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-16 02:58:13,248 INFO L168 Benchmark]: Toolchain (without parser) took 227160.91 ms. Allocated memory was 94.4 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 57.0 MB in the beginning and 737.9 MB in the end (delta: -680.9 MB). Peak memory consumption was 793.9 MB. Max. memory is 16.1 GB. [2021-10-16 02:58:13,248 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 94.4 MB. Free memory was 66.5 MB in the beginning and 66.5 MB in the end (delta: 27.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 02:58:13,248 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.61 ms. Allocated memory is still 94.4 MB. Free memory was 56.8 MB in the beginning and 58.7 MB in the end (delta: -1.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-16 02:58:13,249 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.26 ms. Allocated memory is still 94.4 MB. Free memory was 58.7 MB in the beginning and 53.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-16 02:58:13,249 INFO L168 Benchmark]: Boogie Preprocessor took 142.29 ms. Allocated memory is still 94.4 MB. Free memory was 53.9 MB in the beginning and 49.0 MB in the end (delta: 4.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-16 02:58:13,250 INFO L168 Benchmark]: RCFGBuilder took 2554.91 ms. Allocated memory was 94.4 MB in the beginning and 119.5 MB in the end (delta: 25.2 MB). Free memory was 49.0 MB in the beginning and 64.4 MB in the end (delta: -15.5 MB). Peak memory consumption was 38.0 MB. Max. memory is 16.1 GB. [2021-10-16 02:58:13,250 INFO L168 Benchmark]: TraceAbstraction took 223643.66 ms. Allocated memory was 119.5 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 64.4 MB in the beginning and 737.9 MB in the end (delta: -673.4 MB). Peak memory consumption was 777.3 MB. Max. memory is 16.1 GB. [2021-10-16 02:58:13,255 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.29 ms. Allocated memory is still 94.4 MB. Free memory was 66.5 MB in the beginning and 66.5 MB in the end (delta: 27.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 737.61 ms. Allocated memory is still 94.4 MB. Free memory was 56.8 MB in the beginning and 58.7 MB in the end (delta: -1.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 75.26 ms. Allocated memory is still 94.4 MB. Free memory was 58.7 MB in the beginning and 53.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 142.29 ms. Allocated memory is still 94.4 MB. Free memory was 53.9 MB in the beginning and 49.0 MB in the end (delta: 4.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2554.91 ms. Allocated memory was 94.4 MB in the beginning and 119.5 MB in the end (delta: 25.2 MB). Free memory was 49.0 MB in the beginning and 64.4 MB in the end (delta: -15.5 MB). Peak memory consumption was 38.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 223643.66 ms. Allocated memory was 119.5 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 64.4 MB in the beginning and 737.9 MB in the end (delta: -673.4 MB). Peak memory consumption was 777.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: No corresponding IProgramVar for |v_#valid_706| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: No corresponding IProgramVar for |v_#valid_706|: 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-16 02:58:13,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-5709675 [2021-10-16 02:58:16,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 02:58:16,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 02:58:16,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 02:58:16,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 02:58:16,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 02:58:16,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 02:58:16,406 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 02:58:16,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 02:58:16,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 02:58:16,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 02:58:16,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 02:58:16,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 02:58:16,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 02:58:16,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 02:58:16,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 02:58:16,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 02:58:16,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 02:58:16,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 02:58:16,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 02:58:16,463 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 02:58:16,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 02:58:16,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 02:58:16,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 02:58:16,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 02:58:16,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 02:58:16,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 02:58:16,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 02:58:16,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 02:58:16,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 02:58:16,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 02:58:16,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 02:58:16,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 02:58:16,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 02:58:16,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 02:58:16,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 02:58:16,501 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 02:58:16,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 02:58:16,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 02:58:16,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 02:58:16,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 02:58:16,513 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-10-16 02:58:16,569 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 02:58:16,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 02:58:16,571 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 02:58:16,571 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 02:58:16,572 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 02:58:16,572 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 02:58:16,572 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 02:58:16,573 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 02:58:16,573 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 02:58:16,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-16 02:58:16,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-16 02:58:16,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 02:58:16,576 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 02:58:16,577 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-16 02:58:16,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-16 02:58:16,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 02:58:16,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 02:58:16,578 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-16 02:58:16,578 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-16 02:58:16,578 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-16 02:58:16,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 02:58:16,579 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 02:58:16,579 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-16 02:58:16,579 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-16 02:58:16,579 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 02:58:16,580 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 02:58:16,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 02:58:16,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-16 02:58:16,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 02:58:16,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:58:16,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 02:58:16,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 02:58:16,582 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-16 02:58:16,582 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-16 02:58:16,582 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 02:58:16,583 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 02:58:16,583 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_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> b6c3d2366b1caeb6e7a3192ace7ebb6cdc580141 [2021-10-16 02:58:17,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 02:58:17,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 02:58:17,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 02:58:17,061 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 02:58:17,062 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 02:58:17,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2021-10-16 02:58:17,140 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/data/a54b0d4d7/9808bf5011094363adf3773c75614247/FLAG5ab679004 [2021-10-16 02:58:17,806 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 02:58:17,808 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2021-10-16 02:58:17,832 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/data/a54b0d4d7/9808bf5011094363adf3773c75614247/FLAG5ab679004 [2021-10-16 02:58:18,053 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/data/a54b0d4d7/9808bf5011094363adf3773c75614247 [2021-10-16 02:58:18,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 02:58:18,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 02:58:18,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 02:58:18,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 02:58:18,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 02:58:18,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:58:18" (1/1) ... [2021-10-16 02:58:18,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5788009d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:58:18, skipping insertion in model container [2021-10-16 02:58:18,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:58:18" (1/1) ... [2021-10-16 02:58:18,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 02:58:18,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 02:58:18,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:58:18,540 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 02:58:18,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:58:18,665 INFO L208 MainTranslator]: Completed translation [2021-10-16 02:58:18,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:58:18 WrapperNode [2021-10-16 02:58:18,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 02:58:18,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 02:58:18,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 02:58:18,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 02:58:18,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:58:18" (1/1) ... [2021-10-16 02:58:18,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:58:18" (1/1) ... [2021-10-16 02:58:18,783 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 02:58:18,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 02:58:18,784 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 02:58:18,784 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 02:58:18,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:58:18" (1/1) ... [2021-10-16 02:58:18,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:58:18" (1/1) ... [2021-10-16 02:58:18,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:58:18" (1/1) ... [2021-10-16 02:58:18,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:58:18" (1/1) ... [2021-10-16 02:58:18,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:58:18" (1/1) ... [2021-10-16 02:58:18,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:58:18" (1/1) ... [2021-10-16 02:58:18,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:58:18" (1/1) ... [2021-10-16 02:58:18,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 02:58:18,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 02:58:18,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 02:58:18,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 02:58:18,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:58:18" (1/1) ... [2021-10-16 02:58:18,900 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:58:18,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:58:18,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 02:58:18,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 02:58:18,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-10-16 02:58:18,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-16 02:58:18,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-16 02:58:18,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 02:58:18,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-16 02:58:18,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-10-16 02:58:18,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-16 02:58:18,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-16 02:58:18,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 02:58:18,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 02:58:23,656 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 02:58:23,665 INFO L299 CfgBuilder]: Removed 47 assume(true) statements. [2021-10-16 02:58:23,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:58:23 BoogieIcfgContainer [2021-10-16 02:58:23,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 02:58:23,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 02:58:23,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 02:58:23,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 02:58:23,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:58:18" (1/3) ... [2021-10-16 02:58:23,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15fd2c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:58:23, skipping insertion in model container [2021-10-16 02:58:23,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:58:18" (2/3) ... [2021-10-16 02:58:23,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15fd2c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:58:23, skipping insertion in model container [2021-10-16 02:58:23,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:58:23" (3/3) ... [2021-10-16 02:58:23,681 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-1.i [2021-10-16 02:58:23,689 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 02:58:23,690 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 485 error locations. [2021-10-16 02:58:23,767 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 02:58:23,778 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-16 02:58:23,778 INFO L340 AbstractCegarLoop]: Starting to check reachability of 485 error locations. [2021-10-16 02:58:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand has 902 states, 416 states have (on average 2.3125) internal successors, (962), 901 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:58:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-16 02:58:23,872 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:58:23,873 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-16 02:58:23,874 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:58:23,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:58:23,880 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-10-16 02:58:23,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:58:23,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699902936] [2021-10-16 02:58:23,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:58:23,895 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:58:23,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:58:23,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:58:23,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-16 02:58:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:58:24,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:58:24,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:58:24,217 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-16 02:58:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:58:24,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:58:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:58:24,281 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:58:24,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699902936] [2021-10-16 02:58:24,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699902936] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:58:24,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:58:24,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-16 02:58:24,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982187965] [2021-10-16 02:58:24,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:58:24,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:58:24,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:58:24,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:58:24,333 INFO L87 Difference]: Start difference. First operand has 902 states, 416 states have (on average 2.3125) internal successors, (962), 901 states have internal predecessors, (962), 0 states have call successors, (0), 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-16 02:58:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:58:27,056 INFO L93 Difference]: Finished difference Result 1123 states and 1187 transitions. [2021-10-16 02:58:27,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:58:27,059 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-16 02:58:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:58:27,085 INFO L225 Difference]: With dead ends: 1123 [2021-10-16 02:58:27,085 INFO L226 Difference]: Without dead ends: 1121 [2021-10-16 02:58:27,087 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-16 02:58:27,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2021-10-16 02:58:27,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 985. [2021-10-16 02:58:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 503 states have (on average 2.256461232604374) internal successors, (1135), 984 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:58:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1135 transitions. [2021-10-16 02:58:27,202 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1135 transitions. Word has length 3 [2021-10-16 02:58:27,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:58:27,202 INFO L470 AbstractCegarLoop]: Abstraction has 985 states and 1135 transitions. [2021-10-16 02:58:27,203 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-16 02:58:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1135 transitions. [2021-10-16 02:58:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-16 02:58:27,204 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:58:27,204 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-16 02:58:27,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-16 02:58:27,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:58:27,422 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:58:27,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:58:27,423 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-10-16 02:58:27,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:58:27,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431205534] [2021-10-16 02:58:27,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:58:27,424 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:58:27,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:58:27,426 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:58:27,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-16 02:58:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:58:27,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 02:58:27,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:58:27,526 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-16 02:58:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:58:27,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:58:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:58:27,630 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:58:27,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431205534] [2021-10-16 02:58:27,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431205534] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:58:27,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:58:27,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-16 02:58:27,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95645098] [2021-10-16 02:58:27,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:58:27,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:58:27,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:58:27,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:58:27,640 INFO L87 Difference]: Start difference. First operand 985 states and 1135 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-16 02:58:32,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:58:32,136 INFO L93 Difference]: Finished difference Result 1036 states and 1191 transitions. [2021-10-16 02:58:32,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:58:32,138 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-16 02:58:32,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:58:32,145 INFO L225 Difference]: With dead ends: 1036 [2021-10-16 02:58:32,146 INFO L226 Difference]: Without dead ends: 1036 [2021-10-16 02:58:32,147 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:58:32,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2021-10-16 02:58:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 983. [2021-10-16 02:58:32,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 503 states have (on average 2.2524850894632205) internal successors, (1133), 982 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:58:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1133 transitions. [2021-10-16 02:58:32,205 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1133 transitions. Word has length 3 [2021-10-16 02:58:32,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:58:32,206 INFO L470 AbstractCegarLoop]: Abstraction has 983 states and 1133 transitions. [2021-10-16 02:58:32,206 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-16 02:58:32,213 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1133 transitions. [2021-10-16 02:58:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-16 02:58:32,214 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:58:32,215 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:58:32,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-16 02:58:32,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:58:32,428 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:58:32,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:58:32,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1837144844, now seen corresponding path program 1 times [2021-10-16 02:58:32,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:58:32,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134519274] [2021-10-16 02:58:32,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:58:32,437 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:58:32,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:58:32,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:58:32,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-16 02:58:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:58:32,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:58:32,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:58:32,584 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-16 02:58:32,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:58:32,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:58:32,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:58:32,616 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:58:32,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134519274] [2021-10-16 02:58:32,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134519274] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:58:32,617 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:58:32,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-16 02:58:32,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494445255] [2021-10-16 02:58:32,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:58:32,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:58:32,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:58:32,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:58:32,630 INFO L87 Difference]: Start difference. First operand 983 states and 1133 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:58:34,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:58:34,863 INFO L93 Difference]: Finished difference Result 1052 states and 1117 transitions. [2021-10-16 02:58:34,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:58:34,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-16 02:58:34,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:58:34,872 INFO L225 Difference]: With dead ends: 1052 [2021-10-16 02:58:34,874 INFO L226 Difference]: Without dead ends: 1052 [2021-10-16 02:58:34,875 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:58:34,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2021-10-16 02:58:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 913. [2021-10-16 02:58:34,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 503 states have (on average 2.113320079522863) internal successors, (1063), 912 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:58:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1063 transitions. [2021-10-16 02:58:34,905 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1063 transitions. Word has length 9 [2021-10-16 02:58:34,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:58:34,906 INFO L470 AbstractCegarLoop]: Abstraction has 913 states and 1063 transitions. [2021-10-16 02:58:34,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:58:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1063 transitions. [2021-10-16 02:58:34,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-16 02:58:34,907 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:58:34,907 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:58:34,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-16 02:58:35,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:58:35,121 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:58:35,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:58:35,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1837144845, now seen corresponding path program 1 times [2021-10-16 02:58:35,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:58:35,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742466165] [2021-10-16 02:58:35,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:58:35,123 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:58:35,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:58:35,127 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:58:35,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-16 02:58:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:58:35,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 02:58:35,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:58:35,272 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-16 02:58:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:58:35,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:58:35,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:58:35,375 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:58:35,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742466165] [2021-10-16 02:58:35,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742466165] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:58:35,375 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:58:35,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-16 02:58:35,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962969265] [2021-10-16 02:58:35,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:58:35,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:58:35,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:58:35,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:58:35,377 INFO L87 Difference]: Start difference. First operand 913 states and 1063 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:58:37,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:58:37,970 INFO L93 Difference]: Finished difference Result 846 states and 997 transitions. [2021-10-16 02:58:37,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:58:37,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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 9 [2021-10-16 02:58:37,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:58:37,976 INFO L225 Difference]: With dead ends: 846 [2021-10-16 02:58:37,976 INFO L226 Difference]: Without dead ends: 846 [2021-10-16 02:58:37,977 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:58:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2021-10-16 02:58:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 843. [2021-10-16 02:58:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 503 states have (on average 1.974155069582505) internal successors, (993), 842 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:58:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 993 transitions. [2021-10-16 02:58:38,001 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 993 transitions. Word has length 9 [2021-10-16 02:58:38,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:58:38,002 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 993 transitions. [2021-10-16 02:58:38,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:58:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 993 transitions. [2021-10-16 02:58:38,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-16 02:58:38,003 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:58:38,003 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:58:38,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-10-16 02:58:38,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:58:38,234 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:58:38,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:58:38,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1116915317, now seen corresponding path program 1 times [2021-10-16 02:58:38,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:58:38,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924062466] [2021-10-16 02:58:38,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:58:38,236 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:58:38,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:58:38,237 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:58:38,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-16 02:58:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:58:38,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-16 02:58:38,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:58:38,375 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-16 02:58:38,385 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-16 02:58:38,541 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-10-16 02:58:38,542 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 28 treesize of output 30 [2021-10-16 02:58:38,553 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-10-16 02:58:38,554 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 27 treesize of output 23 [2021-10-16 02:58:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:58:38,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:58:39,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:58:39,280 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:58:39,280 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924062466] [2021-10-16 02:58:39,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924062466] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:58:39,281 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:58:39,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-10-16 02:58:39,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883279131] [2021-10-16 02:58:39,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 02:58:39,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:58:39,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 02:58:39,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-16 02:58:39,284 INFO L87 Difference]: Start difference. First operand 843 states and 993 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-16 02:59:09,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:59:09,604 INFO L93 Difference]: Finished difference Result 1112 states and 1192 transitions. [2021-10-16 02:59:09,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-16 02:59:09,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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 10 [2021-10-16 02:59:09,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:59:09,612 INFO L225 Difference]: With dead ends: 1112 [2021-10-16 02:59:09,612 INFO L226 Difference]: Without dead ends: 1112 [2021-10-16 02:59:09,613 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 388.3ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-16 02:59:09,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2021-10-16 02:59:09,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 744. [2021-10-16 02:59:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 503 states have (on average 1.7753479125248508) internal successors, (893), 743 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:59:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 893 transitions. [2021-10-16 02:59:09,637 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 893 transitions. Word has length 10 [2021-10-16 02:59:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:59:09,638 INFO L470 AbstractCegarLoop]: Abstraction has 744 states and 893 transitions. [2021-10-16 02:59:09,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-16 02:59:09,638 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 893 transitions. [2021-10-16 02:59:09,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-16 02:59:09,639 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:59:09,639 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:59:09,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-16 02:59:09,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:59:09,853 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:59:09,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:59:09,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1116915316, now seen corresponding path program 1 times [2021-10-16 02:59:09,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:59:09,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030486206] [2021-10-16 02:59:09,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:59:09,854 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:59:09,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:59:09,858 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:59:09,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-16 02:59:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:59:09,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-16 02:59:09,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:59:09,999 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-16 02:59:10,111 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-16 02:59:10,111 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 22 treesize of output 29 [2021-10-16 02:59:10,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:59:10,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:59:14,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:59:14,442 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:59:14,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030486206] [2021-10-16 02:59:14,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2030486206] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:59:14,442 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:59:14,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-10-16 02:59:14,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729725737] [2021-10-16 02:59:14,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 02:59:14,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:59:14,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 02:59:14,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=17, Unknown=2, NotChecked=0, Total=30 [2021-10-16 02:59:14,445 INFO L87 Difference]: Start difference. First operand 744 states and 893 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-16 02:59:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:59:18,339 INFO L93 Difference]: Finished difference Result 784 states and 849 transitions. [2021-10-16 02:59:18,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:59:18,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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 10 [2021-10-16 02:59:18,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:59:18,346 INFO L225 Difference]: With dead ends: 784 [2021-10-16 02:59:18,346 INFO L226 Difference]: Without dead ends: 784 [2021-10-16 02:59:18,346 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4117.0ms TimeCoverageRelationStatistics Valid=17, Invalid=23, Unknown=2, NotChecked=0, Total=42 [2021-10-16 02:59:18,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2021-10-16 02:59:18,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 646. [2021-10-16 02:59:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 503 states have (on average 1.58051689860835) internal successors, (795), 645 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:59:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 795 transitions. [2021-10-16 02:59:18,366 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 795 transitions. Word has length 10 [2021-10-16 02:59:18,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:59:18,366 INFO L470 AbstractCegarLoop]: Abstraction has 646 states and 795 transitions. [2021-10-16 02:59:18,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-16 02:59:18,367 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 795 transitions. [2021-10-16 02:59:18,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-16 02:59:18,367 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:59:18,368 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-16 02:59:18,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-10-16 02:59:18,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:59:18,582 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:59:18,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:59:18,582 INFO L82 PathProgramCache]: Analyzing trace with hash 94393608, now seen corresponding path program 1 times [2021-10-16 02:59:18,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:59:18,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574128453] [2021-10-16 02:59:18,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:59:18,583 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:59:18,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:59:18,585 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:59:18,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-16 02:59:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:59:18,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-16 02:59:18,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:59:18,753 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-16 02:59:18,777 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-16 02:59:18,793 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-16 02:59:18,862 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-10-16 02:59:18,862 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 21 treesize of output 20 [2021-10-16 02:59:18,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:59:18,886 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-16 02:59:19,141 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-16 02:59:19,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-10-16 02:59:19,321 INFO L354 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2021-10-16 02:59:19,322 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 58 [2021-10-16 02:59:19,375 INFO L354 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2021-10-16 02:59:19,376 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 43 [2021-10-16 02:59:19,483 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-10-16 02:59:19,483 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2021-10-16 02:59:19,492 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-10-16 02:59:19,493 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2021-10-16 02:59:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:59:19,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:59:19,734 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:59:19,736 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-10-16 02:59:19,744 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:59:19,745 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-10-16 02:59:28,317 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_299 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_299)))) (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| v_ULTIMATE.start_append_~node~0.base_299 (store (select |c_#memory_$Pointer$.offset| v_ULTIMATE.start_append_~node~0.base_299) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_2)) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_299 (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_299) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_1)) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32)))))) is different from false [2021-10-16 02:59:30,658 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_299 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_299)))) (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_299 (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_299) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_1))) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32))))) (store .cse1 v_ULTIMATE.start_append_~node~0.base_299 (store (select .cse1 v_ULTIMATE.start_append_~node~0.base_299) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_2))) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32)))))) is different from false [2021-10-16 02:59:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:59:30,727 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:59:30,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574128453] [2021-10-16 02:59:30,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574128453] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:59:30,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:59:30,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 13 [2021-10-16 02:59:30,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780886259] [2021-10-16 02:59:30,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-16 02:59:30,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:59:30,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-16 02:59:30,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=84, Unknown=3, NotChecked=38, Total=156 [2021-10-16 02:59:30,730 INFO L87 Difference]: Start difference. First operand 646 states and 795 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:59:32,830 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_append_~node~0.base_299 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_299)))) (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_299 (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_299) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_1))) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32))))) (store .cse1 v_ULTIMATE.start_append_~node~0.base_299 (store (select .cse1 v_ULTIMATE.start_append_~node~0.base_299) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_2))) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32)))))) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| c_ULTIMATE.start_main_~list~0.base))) (_ bv1 1)))) is different from false [2021-10-16 02:59:44,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:59:44,441 INFO L93 Difference]: Finished difference Result 800 states and 866 transitions. [2021-10-16 02:59:44,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-16 02:59:44,442 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 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-16 02:59:44,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:59:44,448 INFO L225 Difference]: With dead ends: 800 [2021-10-16 02:59:44,448 INFO L226 Difference]: Without dead ends: 800 [2021-10-16 02:59:44,449 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 13058.3ms TimeCoverageRelationStatistics Valid=75, Invalid=173, Unknown=4, NotChecked=90, Total=342 [2021-10-16 02:59:44,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2021-10-16 02:59:44,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 653. [2021-10-16 02:59:44,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 510 states have (on average 1.5745098039215686) internal successors, (803), 652 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:59:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 803 transitions. [2021-10-16 02:59:44,470 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 803 transitions. Word has length 19 [2021-10-16 02:59:44,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:59:44,470 INFO L470 AbstractCegarLoop]: Abstraction has 653 states and 803 transitions. [2021-10-16 02:59:44,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:59:44,471 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 803 transitions. [2021-10-16 02:59:44,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-16 02:59:44,472 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:59:44,472 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] [2021-10-16 02:59:44,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-16 02:59:44,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:59:44,693 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 02:59:44,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:59:44,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1351113909, now seen corresponding path program 1 times [2021-10-16 02:59:44,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:59:44,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673540418] [2021-10-16 02:59:44,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:59:44,694 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:59:44,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:59:44,695 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:59:44,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-16 02:59:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:59:44,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-16 02:59:44,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:59:44,919 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-16 02:59:44,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-16 02:59:44,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-16 02:59:45,130 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-16 02:59:45,131 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 19 treesize of output 19 [2021-10-16 02:59:45,256 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-10-16 02:59:45,256 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 53 treesize of output 41 [2021-10-16 02:59:45,292 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-10-16 02:59:45,293 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 38 treesize of output 26 [2021-10-16 02:59:45,403 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 37 treesize of output 25 [2021-10-16 02:59:45,412 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 22 treesize of output 10 [2021-10-16 02:59:45,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:59:45,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:59:45,635 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:59:45,636 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-10-16 02:59:45,649 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:59:45,651 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-10-16 02:59:47,673 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_append_~node~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_append_~node~0.base) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_3)) c_ULTIMATE.start_append_~head.base) (bvadd (_ bv4 32) c_ULTIMATE.start_append_~head.offset)) (_ bv0 32))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_4)) c_ULTIMATE.start_append_~head.base) (bvadd (_ bv4 32) c_ULTIMATE.start_append_~head.offset)) (_ bv0 32)))) is different from false [2021-10-16 02:59:49,776 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_300 (_ BitVec 32))) (or (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_300 (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_300) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_4)) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (_ bv0 32))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| v_ULTIMATE.start_append_~node~0.base_300 (store (select |c_#memory_$Pointer$.offset| v_ULTIMATE.start_append_~node~0.base_300) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_3)) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (_ bv0 32)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_300)))))) is different from false [2021-10-16 02:59:50,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:59:50,121 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:59:50,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673540418] [2021-10-16 02:59:50,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673540418] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:59:50,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:59:50,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2021-10-16 02:59:50,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882129806] [2021-10-16 02:59:50,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-16 02:59:50,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:59:50,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-16 02:59:50,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=43, Unknown=2, NotChecked=26, Total=90 [2021-10-16 02:59:50,123 INFO L87 Difference]: Start difference. First operand 653 states and 803 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:00:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:00:02,036 INFO L93 Difference]: Finished difference Result 793 states and 858 transitions. [2021-10-16 03:00:02,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-16 03:00:02,037 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-16 03:00:02,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:00:02,045 INFO L225 Difference]: With dead ends: 793 [2021-10-16 03:00:02,046 INFO L226 Difference]: Without dead ends: 793 [2021-10-16 03:00:02,046 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 8479.9ms TimeCoverageRelationStatistics Valid=53, Invalid=109, Unknown=2, NotChecked=46, Total=210 [2021-10-16 03:00:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2021-10-16 03:00:02,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 656. [2021-10-16 03:00:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 513 states have (on average 1.571150097465887) internal successors, (806), 655 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:00:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 806 transitions. [2021-10-16 03:00:02,066 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 806 transitions. Word has length 21 [2021-10-16 03:00:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:00:02,067 INFO L470 AbstractCegarLoop]: Abstraction has 656 states and 806 transitions. [2021-10-16 03:00:02,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 03:00:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 806 transitions. [2021-10-16 03:00:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-16 03:00:02,070 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:00:02,070 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:00:02,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-16 03:00:02,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:00:02,287 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 481 more)] === [2021-10-16 03:00:02,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:00:02,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1113089128, now seen corresponding path program 1 times [2021-10-16 03:00:02,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:00:02,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014058495] [2021-10-16 03:00:02,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:00:02,289 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:00:02,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:00:02,293 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:00:02,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-16 03:00:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:00:02,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 22 conjunts are in the unsatisfiable core [2021-10-16 03:00:02,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:00:02,696 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-16 03:00:02,821 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-16 03:00:02,822 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-16 03:00:03,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-16 03:00:03,496 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 23 treesize of output 22 [2021-10-16 03:00:03,736 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-16 03:00:03,737 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 45 [2021-10-16 03:00:04,078 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-10-16 03:00:04,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 76 [2021-10-16 03:00:04,459 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 03:00:04,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 62 [2021-10-16 03:00:05,280 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 03:00:05,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 73 [2021-10-16 03:00:05,684 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-16 03:00:05,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 82 [2021-10-16 03:00:05,975 INFO L354 Elim1Store]: treesize reduction 92, result has 1.1 percent of original size [2021-10-16 03:00:05,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 76 [2021-10-16 03:00:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:00:06,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:00:10,789 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 03:00:10,790 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-10-16 03:00:18,809 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_301 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_301)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_301 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_301 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_301) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_5) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)))))))))) (_ bv1 1))))) is different from false [2021-10-16 03:00:20,950 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_235 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_301 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_301)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_301 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base) (bvadd c_ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_301 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_301) v_ULTIMATE.start_append_~node~0.offset_235 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_235 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_235 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)))))))))) (_ bv1 1))))) is different from false [2021-10-16 03:00:23,029 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_235 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_301 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_301 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) (_ bv0 32)) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_301 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_301) v_ULTIMATE.start_append_~node~0.offset_235 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_235 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_235 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_301)))))) is different from false [2021-10-16 03:00:23,058 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 172397 treesize of output 172013 [2021-10-16 03:00:24,162 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:00:24,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014058495] [2021-10-16 03:00:24,164 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-16 03:00:24,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1545256309] [2021-10-16 03:00:24,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:00:24,164 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-16 03:00:24,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/cvc4 [2021-10-16 03:00:24,168 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-16 03:00:24,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2021-10-16 03:00:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:00:24,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 24 conjunts are in the unsatisfiable core [2021-10-16 03:00:24,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:00:24,773 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-16 03:00:24,978 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-16 03:00:24,978 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-16 03:00:25,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-16 03:00:25,855 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 23 treesize of output 22 [2021-10-16 03:00:26,099 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-16 03:00:26,099 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 45 [2021-10-16 03:00:26,452 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-10-16 03:00:26,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 63 [2021-10-16 03:00:26,800 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 03:00:26,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 69 [2021-10-16 03:00:27,634 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 03:00:27,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 74 [2021-10-16 03:00:28,076 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-16 03:00:28,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 89 [2021-10-16 03:00:28,399 INFO L354 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2021-10-16 03:00:28,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 72 [2021-10-16 03:00:28,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:00:28,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:00:28,692 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 03:00:28,693 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-10-16 03:00:36,921 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_302 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_302 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_302 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_302) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_5) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_302))))))))) is different from false [2021-10-16 03:00:39,054 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_240 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_302 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_302 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base) (bvadd c_ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_302 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_302) v_ULTIMATE.start_append_~node~0.offset_240 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_240 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_240 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_302))))))))) is different from false [2021-10-16 03:00:41,133 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_240 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_302 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_302 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) (_ bv0 32)) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_302 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_302) v_ULTIMATE.start_append_~node~0.offset_240 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_240 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_240 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_302))))))))) is different from false [2021-10-16 03:00:41,164 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 45648 treesize of output 45552 [2021-10-16 03:00:41,355 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-16 03:00:41,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617661927] [2021-10-16 03:00:41,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:00:41,356 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 03:00:41,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 03:00:41,376 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 03:00:41,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-16 03:00:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:00:41,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-16 03:00:41,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:00:41,868 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-16 03:00:41,869 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-16 03:00:42,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-16 03:00:42,576 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 23 treesize of output 22 [2021-10-16 03:00:42,700 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-16 03:00:42,700 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 45 [2021-10-16 03:00:42,917 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-10-16 03:00:42,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 60 [2021-10-16 03:00:43,208 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 03:00:43,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 69 [2021-10-16 03:00:43,797 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 03:00:43,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 76 [2021-10-16 03:00:44,119 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-16 03:00:44,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 85 [2021-10-16 03:00:44,364 INFO L354 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2021-10-16 03:00:44,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 72 [2021-10-16 03:00:44,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:00:44,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:00:44,712 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 03:00:44,713 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-10-16 03:00:54,177 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_303 (_ BitVec 32)) (ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_303)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_303 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_303 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_303) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_5) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))))))))) (_ bv1 1))))) is different from false [2021-10-16 03:00:56,272 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_303 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_245 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_303)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_303 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base) (bvadd c_ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_303 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_303) v_ULTIMATE.start_append_~node~0.offset_245 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_245 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_245 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))))))))) (_ bv1 1))))) is different from false [2021-10-16 03:00:58,342 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_303 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_245 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_303 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) (_ bv0 32)) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_303 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_303) v_ULTIMATE.start_append_~node~0.offset_245 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_245 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_245 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_303)))))) is different from false [2021-10-16 03:00:58,409 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 50297833 treesize of output 50199529 [2021-10-16 03:02:50,747 WARN L207 SmtUtils]: Spent 1.87 m on a formula simplification that was a NOOP. DAG size: 1944 [2021-10-16 03:02:51,426 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-16 03:02:51,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:02:51,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-10-16 03:02:51,427 ERROR L172 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2021-10-16 03:02:51,427 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-10-16 03:02:51,444 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-10-16 03:02:51,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-16 03:02:51,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-16 03:02:51,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-16 03:02:51,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-16 03:02:51,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-16 03:02:51,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-16 03:02:51,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-16 03:02:51,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-16 03:02:51,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-16 03:02:51,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-16 03:02:51,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-16 03:02:51,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-16 03:02:51,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-16 03:02:51,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-16 03:02:51,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-16 03:02:51,452 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-16 03:02:51,452 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-16 03:02:51,452 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-16 03:02:51,452 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-16 03:02:51,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-16 03:02:51,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-16 03:02:51,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-16 03:02:51,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-16 03:02:51,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-16 03:02:51,454 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-16 03:02:51,454 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-16 03:02:51,454 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-16 03:02:51,454 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-16 03:02:51,455 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-16 03:02:51,455 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-16 03:02:51,455 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-16 03:02:51,455 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-16 03:02:51,455 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-10-16 03:02:51,456 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-16 03:02:51,456 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-16 03:02:51,456 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-16 03:02:51,456 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-16 03:02:51,457 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-16 03:02:51,457 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-16 03:02:51,457 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-16 03:02:51,457 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-16 03:02:51,457 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-16 03:02:51,458 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-16 03:02:51,458 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-16 03:02:51,458 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-10-16 03:02:51,458 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-16 03:02:51,459 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-16 03:02:51,459 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-10-16 03:02:51,459 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-10-16 03:02:51,459 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-16 03:02:51,460 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-16 03:02:51,460 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-10-16 03:02:51,460 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-10-16 03:02:51,460 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-16 03:02:51,461 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-10-16 03:02:51,461 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-10-16 03:02:51,461 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION [2021-10-16 03:02:51,461 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-10-16 03:02:51,461 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-16 03:02:51,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-10-16 03:02:51,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION [2021-10-16 03:02:51,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION [2021-10-16 03:02:51,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-10-16 03:02:51,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION [2021-10-16 03:02:51,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-10-16 03:02:51,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION [2021-10-16 03:02:51,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION [2021-10-16 03:02:51,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION [2021-10-16 03:02:51,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION [2021-10-16 03:02:51,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION [2021-10-16 03:02:51,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-10-16 03:02:51,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION [2021-10-16 03:02:51,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION [2021-10-16 03:02:51,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-10-16 03:02:51,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION [2021-10-16 03:02:51,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATION [2021-10-16 03:02:51,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATION [2021-10-16 03:02:51,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION [2021-10-16 03:02:51,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION [2021-10-16 03:02:51,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATION [2021-10-16 03:02:51,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81REQUIRES_VIOLATION [2021-10-16 03:02:51,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATION [2021-10-16 03:02:51,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATION [2021-10-16 03:02:51,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATION [2021-10-16 03:02:51,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATION [2021-10-16 03:02:51,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATION [2021-10-16 03:02:51,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATION [2021-10-16 03:02:51,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATION [2021-10-16 03:02:51,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89REQUIRES_VIOLATION [2021-10-16 03:02:51,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATION [2021-10-16 03:02:51,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATION [2021-10-16 03:02:51,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92REQUIRES_VIOLATION [2021-10-16 03:02:51,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93REQUIRES_VIOLATION [2021-10-16 03:02:51,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94REQUIRES_VIOLATION [2021-10-16 03:02:51,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95REQUIRES_VIOLATION [2021-10-16 03:02:51,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96REQUIRES_VIOLATION [2021-10-16 03:02:51,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97REQUIRES_VIOLATION [2021-10-16 03:02:51,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98REQUIRES_VIOLATION [2021-10-16 03:02:51,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99REQUIRES_VIOLATION [2021-10-16 03:02:51,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100REQUIRES_VIOLATION [2021-10-16 03:02:51,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101REQUIRES_VIOLATION [2021-10-16 03:02:51,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102REQUIRES_VIOLATION [2021-10-16 03:02:51,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103REQUIRES_VIOLATION [2021-10-16 03:02:51,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104REQUIRES_VIOLATION [2021-10-16 03:02:51,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105REQUIRES_VIOLATION [2021-10-16 03:02:51,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106REQUIRES_VIOLATION [2021-10-16 03:02:51,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107REQUIRES_VIOLATION [2021-10-16 03:02:51,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108REQUIRES_VIOLATION [2021-10-16 03:02:51,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109REQUIRES_VIOLATION [2021-10-16 03:02:51,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110REQUIRES_VIOLATION [2021-10-16 03:02:51,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111REQUIRES_VIOLATION [2021-10-16 03:02:51,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112REQUIRES_VIOLATION [2021-10-16 03:02:51,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113REQUIRES_VIOLATION [2021-10-16 03:02:51,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114REQUIRES_VIOLATION [2021-10-16 03:02:51,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115REQUIRES_VIOLATION [2021-10-16 03:02:51,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116REQUIRES_VIOLATION [2021-10-16 03:02:51,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117REQUIRES_VIOLATION [2021-10-16 03:02:51,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118REQUIRES_VIOLATION [2021-10-16 03:02:51,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119REQUIRES_VIOLATION [2021-10-16 03:02:51,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120REQUIRES_VIOLATION [2021-10-16 03:02:51,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121REQUIRES_VIOLATION [2021-10-16 03:02:51,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122REQUIRES_VIOLATION [2021-10-16 03:02:51,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123REQUIRES_VIOLATION [2021-10-16 03:02:51,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124REQUIRES_VIOLATION [2021-10-16 03:02:51,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125REQUIRES_VIOLATION [2021-10-16 03:02:51,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126REQUIRES_VIOLATION [2021-10-16 03:02:51,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127REQUIRES_VIOLATION [2021-10-16 03:02:51,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128REQUIRES_VIOLATION [2021-10-16 03:02:51,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129REQUIRES_VIOLATION [2021-10-16 03:02:51,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130REQUIRES_VIOLATION [2021-10-16 03:02:51,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131REQUIRES_VIOLATION [2021-10-16 03:02:51,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132REQUIRES_VIOLATION [2021-10-16 03:02:51,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133REQUIRES_VIOLATION [2021-10-16 03:02:51,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134REQUIRES_VIOLATION [2021-10-16 03:02:51,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135REQUIRES_VIOLATION [2021-10-16 03:02:51,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136REQUIRES_VIOLATION [2021-10-16 03:02:51,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137REQUIRES_VIOLATION [2021-10-16 03:02:51,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138REQUIRES_VIOLATION [2021-10-16 03:02:51,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139REQUIRES_VIOLATION [2021-10-16 03:02:51,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140REQUIRES_VIOLATION [2021-10-16 03:02:51,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141REQUIRES_VIOLATION [2021-10-16 03:02:51,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142REQUIRES_VIOLATION [2021-10-16 03:02:51,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143REQUIRES_VIOLATION [2021-10-16 03:02:51,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144REQUIRES_VIOLATION [2021-10-16 03:02:51,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145REQUIRES_VIOLATION [2021-10-16 03:02:51,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr146REQUIRES_VIOLATION [2021-10-16 03:02:51,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr147REQUIRES_VIOLATION [2021-10-16 03:02:51,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr148REQUIRES_VIOLATION [2021-10-16 03:02:51,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr149REQUIRES_VIOLATION [2021-10-16 03:02:51,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr150REQUIRES_VIOLATION [2021-10-16 03:02:51,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr151REQUIRES_VIOLATION [2021-10-16 03:02:51,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr152REQUIRES_VIOLATION [2021-10-16 03:02:51,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr153REQUIRES_VIOLATION [2021-10-16 03:02:51,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr154REQUIRES_VIOLATION [2021-10-16 03:02:51,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr155REQUIRES_VIOLATION [2021-10-16 03:02:51,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr156REQUIRES_VIOLATION [2021-10-16 03:02:51,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr157REQUIRES_VIOLATION [2021-10-16 03:02:51,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr158REQUIRES_VIOLATION [2021-10-16 03:02:51,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr159REQUIRES_VIOLATION [2021-10-16 03:02:51,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr160REQUIRES_VIOLATION [2021-10-16 03:02:51,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr161REQUIRES_VIOLATION [2021-10-16 03:02:51,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr162REQUIRES_VIOLATION [2021-10-16 03:02:51,487 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr163REQUIRES_VIOLATION [2021-10-16 03:02:51,487 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr164REQUIRES_VIOLATION [2021-10-16 03:02:51,487 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr165REQUIRES_VIOLATION [2021-10-16 03:02:51,487 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr166REQUIRES_VIOLATION [2021-10-16 03:02:51,488 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr167REQUIRES_VIOLATION [2021-10-16 03:02:51,488 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr168REQUIRES_VIOLATION [2021-10-16 03:02:51,488 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr169REQUIRES_VIOLATION [2021-10-16 03:02:51,488 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr170REQUIRES_VIOLATION [2021-10-16 03:02:51,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr171REQUIRES_VIOLATION [2021-10-16 03:02:51,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr172REQUIRES_VIOLATION [2021-10-16 03:02:51,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr173REQUIRES_VIOLATION [2021-10-16 03:02:51,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr174REQUIRES_VIOLATION [2021-10-16 03:02:51,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr175REQUIRES_VIOLATION [2021-10-16 03:02:51,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr176REQUIRES_VIOLATION [2021-10-16 03:02:51,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr177REQUIRES_VIOLATION [2021-10-16 03:02:51,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr178REQUIRES_VIOLATION [2021-10-16 03:02:51,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr179REQUIRES_VIOLATION [2021-10-16 03:02:51,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr180REQUIRES_VIOLATION [2021-10-16 03:02:51,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr181REQUIRES_VIOLATION [2021-10-16 03:02:51,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr182REQUIRES_VIOLATION [2021-10-16 03:02:51,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr183REQUIRES_VIOLATION [2021-10-16 03:02:51,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr184REQUIRES_VIOLATION [2021-10-16 03:02:51,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr185REQUIRES_VIOLATION [2021-10-16 03:02:51,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr186REQUIRES_VIOLATION [2021-10-16 03:02:51,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr187REQUIRES_VIOLATION [2021-10-16 03:02:51,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr188REQUIRES_VIOLATION [2021-10-16 03:02:51,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr189REQUIRES_VIOLATION [2021-10-16 03:02:51,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr190REQUIRES_VIOLATION [2021-10-16 03:02:51,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr191REQUIRES_VIOLATION [2021-10-16 03:02:51,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr192REQUIRES_VIOLATION [2021-10-16 03:02:51,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr193REQUIRES_VIOLATION [2021-10-16 03:02:51,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr194REQUIRES_VIOLATION [2021-10-16 03:02:51,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr195REQUIRES_VIOLATION [2021-10-16 03:02:51,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr196REQUIRES_VIOLATION [2021-10-16 03:02:51,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr197REQUIRES_VIOLATION [2021-10-16 03:02:51,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr198REQUIRES_VIOLATION [2021-10-16 03:02:51,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr199REQUIRES_VIOLATION [2021-10-16 03:02:51,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr200REQUIRES_VIOLATION [2021-10-16 03:02:51,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr201REQUIRES_VIOLATION [2021-10-16 03:02:51,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr202REQUIRES_VIOLATION [2021-10-16 03:02:51,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr203REQUIRES_VIOLATION [2021-10-16 03:02:51,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr204REQUIRES_VIOLATION [2021-10-16 03:02:51,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr205REQUIRES_VIOLATION [2021-10-16 03:02:51,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr206REQUIRES_VIOLATION [2021-10-16 03:02:51,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr207REQUIRES_VIOLATION [2021-10-16 03:02:51,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr208REQUIRES_VIOLATION [2021-10-16 03:02:51,498 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr209REQUIRES_VIOLATION [2021-10-16 03:02:51,499 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr210REQUIRES_VIOLATION [2021-10-16 03:02:51,499 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr211REQUIRES_VIOLATION [2021-10-16 03:02:51,500 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr212REQUIRES_VIOLATION [2021-10-16 03:02:51,500 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr213REQUIRES_VIOLATION [2021-10-16 03:02:51,500 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr214REQUIRES_VIOLATION [2021-10-16 03:02:51,501 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr215REQUIRES_VIOLATION [2021-10-16 03:02:51,501 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr216REQUIRES_VIOLATION [2021-10-16 03:02:51,501 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr217REQUIRES_VIOLATION [2021-10-16 03:02:51,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr218REQUIRES_VIOLATION [2021-10-16 03:02:51,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr219REQUIRES_VIOLATION [2021-10-16 03:02:51,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr220REQUIRES_VIOLATION [2021-10-16 03:02:51,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr221REQUIRES_VIOLATION [2021-10-16 03:02:51,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr222REQUIRES_VIOLATION [2021-10-16 03:02:51,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr223REQUIRES_VIOLATION [2021-10-16 03:02:51,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr224REQUIRES_VIOLATION [2021-10-16 03:02:51,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr225REQUIRES_VIOLATION [2021-10-16 03:02:51,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr226REQUIRES_VIOLATION [2021-10-16 03:02:51,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr227REQUIRES_VIOLATION [2021-10-16 03:02:51,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr228REQUIRES_VIOLATION [2021-10-16 03:02:51,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr229REQUIRES_VIOLATION [2021-10-16 03:02:51,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr230REQUIRES_VIOLATION [2021-10-16 03:02:51,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr231REQUIRES_VIOLATION [2021-10-16 03:02:51,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr232REQUIRES_VIOLATION [2021-10-16 03:02:51,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr233REQUIRES_VIOLATION [2021-10-16 03:02:51,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr234REQUIRES_VIOLATION [2021-10-16 03:02:51,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr235REQUIRES_VIOLATION [2021-10-16 03:02:51,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr236REQUIRES_VIOLATION [2021-10-16 03:02:51,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr237REQUIRES_VIOLATION [2021-10-16 03:02:51,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr238REQUIRES_VIOLATION [2021-10-16 03:02:51,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr239REQUIRES_VIOLATION [2021-10-16 03:02:51,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr240REQUIRES_VIOLATION [2021-10-16 03:02:51,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr241REQUIRES_VIOLATION [2021-10-16 03:02:51,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr242REQUIRES_VIOLATION [2021-10-16 03:02:51,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr243REQUIRES_VIOLATION [2021-10-16 03:02:51,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr244REQUIRES_VIOLATION [2021-10-16 03:02:51,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr245REQUIRES_VIOLATION [2021-10-16 03:02:51,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr246REQUIRES_VIOLATION [2021-10-16 03:02:51,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr247REQUIRES_VIOLATION [2021-10-16 03:02:51,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr248REQUIRES_VIOLATION [2021-10-16 03:02:51,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr249REQUIRES_VIOLATION [2021-10-16 03:02:51,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr250REQUIRES_VIOLATION [2021-10-16 03:02:51,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr251REQUIRES_VIOLATION [2021-10-16 03:02:51,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr252REQUIRES_VIOLATION [2021-10-16 03:02:51,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr253REQUIRES_VIOLATION [2021-10-16 03:02:51,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr254REQUIRES_VIOLATION [2021-10-16 03:02:51,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr255REQUIRES_VIOLATION [2021-10-16 03:02:51,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr256REQUIRES_VIOLATION [2021-10-16 03:02:51,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr257REQUIRES_VIOLATION [2021-10-16 03:02:51,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr258REQUIRES_VIOLATION [2021-10-16 03:02:51,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr259REQUIRES_VIOLATION [2021-10-16 03:02:51,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr260REQUIRES_VIOLATION [2021-10-16 03:02:51,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr261REQUIRES_VIOLATION [2021-10-16 03:02:51,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr262REQUIRES_VIOLATION [2021-10-16 03:02:51,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr263REQUIRES_VIOLATION [2021-10-16 03:02:51,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr264REQUIRES_VIOLATION [2021-10-16 03:02:51,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr265REQUIRES_VIOLATION [2021-10-16 03:02:51,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr266REQUIRES_VIOLATION [2021-10-16 03:02:51,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr267REQUIRES_VIOLATION [2021-10-16 03:02:51,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr268REQUIRES_VIOLATION [2021-10-16 03:02:51,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr269REQUIRES_VIOLATION [2021-10-16 03:02:51,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr270REQUIRES_VIOLATION [2021-10-16 03:02:51,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr271REQUIRES_VIOLATION [2021-10-16 03:02:51,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr272REQUIRES_VIOLATION [2021-10-16 03:02:51,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr273REQUIRES_VIOLATION [2021-10-16 03:02:51,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr274REQUIRES_VIOLATION [2021-10-16 03:02:51,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr275REQUIRES_VIOLATION [2021-10-16 03:02:51,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr276REQUIRES_VIOLATION [2021-10-16 03:02:51,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr277REQUIRES_VIOLATION [2021-10-16 03:02:51,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr278REQUIRES_VIOLATION [2021-10-16 03:02:51,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr279REQUIRES_VIOLATION [2021-10-16 03:02:51,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr280REQUIRES_VIOLATION [2021-10-16 03:02:51,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr281REQUIRES_VIOLATION [2021-10-16 03:02:51,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr282REQUIRES_VIOLATION [2021-10-16 03:02:51,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr283REQUIRES_VIOLATION [2021-10-16 03:02:51,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr284REQUIRES_VIOLATION [2021-10-16 03:02:51,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr285REQUIRES_VIOLATION [2021-10-16 03:02:51,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr286REQUIRES_VIOLATION [2021-10-16 03:02:51,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr287REQUIRES_VIOLATION [2021-10-16 03:02:51,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr288REQUIRES_VIOLATION [2021-10-16 03:02:51,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr289REQUIRES_VIOLATION [2021-10-16 03:02:51,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr290REQUIRES_VIOLATION [2021-10-16 03:02:51,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr291REQUIRES_VIOLATION [2021-10-16 03:02:51,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr292REQUIRES_VIOLATION [2021-10-16 03:02:51,523 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr293REQUIRES_VIOLATION [2021-10-16 03:02:51,523 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr294REQUIRES_VIOLATION [2021-10-16 03:02:51,523 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr295REQUIRES_VIOLATION [2021-10-16 03:02:51,523 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr296REQUIRES_VIOLATION [2021-10-16 03:02:51,523 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr297REQUIRES_VIOLATION [2021-10-16 03:02:51,524 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr298REQUIRES_VIOLATION [2021-10-16 03:02:51,524 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr299REQUIRES_VIOLATION [2021-10-16 03:02:51,524 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr300REQUIRES_VIOLATION [2021-10-16 03:02:51,524 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr301REQUIRES_VIOLATION [2021-10-16 03:02:51,524 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr302REQUIRES_VIOLATION [2021-10-16 03:02:51,525 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr303REQUIRES_VIOLATION [2021-10-16 03:02:51,525 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr304REQUIRES_VIOLATION [2021-10-16 03:02:51,525 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr305REQUIRES_VIOLATION [2021-10-16 03:02:51,525 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr306REQUIRES_VIOLATION [2021-10-16 03:02:51,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr307REQUIRES_VIOLATION [2021-10-16 03:02:51,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr308REQUIRES_VIOLATION [2021-10-16 03:02:51,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr309REQUIRES_VIOLATION [2021-10-16 03:02:51,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr310REQUIRES_VIOLATION [2021-10-16 03:02:51,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr311REQUIRES_VIOLATION [2021-10-16 03:02:51,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr312REQUIRES_VIOLATION [2021-10-16 03:02:51,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr313REQUIRES_VIOLATION [2021-10-16 03:02:51,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr314REQUIRES_VIOLATION [2021-10-16 03:02:51,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr315REQUIRES_VIOLATION [2021-10-16 03:02:51,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr316REQUIRES_VIOLATION [2021-10-16 03:02:51,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr317REQUIRES_VIOLATION [2021-10-16 03:02:51,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr318REQUIRES_VIOLATION [2021-10-16 03:02:51,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr319REQUIRES_VIOLATION [2021-10-16 03:02:51,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr320REQUIRES_VIOLATION [2021-10-16 03:02:51,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr321REQUIRES_VIOLATION [2021-10-16 03:02:51,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr322REQUIRES_VIOLATION [2021-10-16 03:02:51,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr323REQUIRES_VIOLATION [2021-10-16 03:02:51,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr324REQUIRES_VIOLATION [2021-10-16 03:02:51,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr325REQUIRES_VIOLATION [2021-10-16 03:02:51,530 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr326REQUIRES_VIOLATION [2021-10-16 03:02:51,530 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr327REQUIRES_VIOLATION [2021-10-16 03:02:51,530 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr328REQUIRES_VIOLATION [2021-10-16 03:02:51,530 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr329REQUIRES_VIOLATION [2021-10-16 03:02:51,530 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr330REQUIRES_VIOLATION [2021-10-16 03:02:51,531 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr331REQUIRES_VIOLATION [2021-10-16 03:02:51,531 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr332REQUIRES_VIOLATION [2021-10-16 03:02:51,531 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr333REQUIRES_VIOLATION [2021-10-16 03:02:51,531 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr334REQUIRES_VIOLATION [2021-10-16 03:02:51,532 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr335REQUIRES_VIOLATION [2021-10-16 03:02:51,532 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr336REQUIRES_VIOLATION [2021-10-16 03:02:51,532 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr337REQUIRES_VIOLATION [2021-10-16 03:02:51,532 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr338REQUIRES_VIOLATION [2021-10-16 03:02:51,532 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr339REQUIRES_VIOLATION [2021-10-16 03:02:51,533 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr340REQUIRES_VIOLATION [2021-10-16 03:02:51,533 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr341REQUIRES_VIOLATION [2021-10-16 03:02:51,533 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr342REQUIRES_VIOLATION [2021-10-16 03:02:51,533 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr343REQUIRES_VIOLATION [2021-10-16 03:02:51,533 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr344REQUIRES_VIOLATION [2021-10-16 03:02:51,534 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr345REQUIRES_VIOLATION [2021-10-16 03:02:51,534 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr346REQUIRES_VIOLATION [2021-10-16 03:02:51,534 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr347REQUIRES_VIOLATION [2021-10-16 03:02:51,534 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr348REQUIRES_VIOLATION [2021-10-16 03:02:51,535 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr349REQUIRES_VIOLATION [2021-10-16 03:02:51,535 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr350REQUIRES_VIOLATION [2021-10-16 03:02:51,535 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr351REQUIRES_VIOLATION [2021-10-16 03:02:51,535 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr352REQUIRES_VIOLATION [2021-10-16 03:02:51,535 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr353REQUIRES_VIOLATION [2021-10-16 03:02:51,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr354REQUIRES_VIOLATION [2021-10-16 03:02:51,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr355REQUIRES_VIOLATION [2021-10-16 03:02:51,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr356REQUIRES_VIOLATION [2021-10-16 03:02:51,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr357REQUIRES_VIOLATION [2021-10-16 03:02:51,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr358REQUIRES_VIOLATION [2021-10-16 03:02:51,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr359REQUIRES_VIOLATION [2021-10-16 03:02:51,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr360REQUIRES_VIOLATION [2021-10-16 03:02:51,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr361REQUIRES_VIOLATION [2021-10-16 03:02:51,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr362REQUIRES_VIOLATION [2021-10-16 03:02:51,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr363REQUIRES_VIOLATION [2021-10-16 03:02:51,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr364REQUIRES_VIOLATION [2021-10-16 03:02:51,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr365REQUIRES_VIOLATION [2021-10-16 03:02:51,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr366REQUIRES_VIOLATION [2021-10-16 03:02:51,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr367REQUIRES_VIOLATION [2021-10-16 03:02:51,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr368REQUIRES_VIOLATION [2021-10-16 03:02:51,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr369REQUIRES_VIOLATION [2021-10-16 03:02:51,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr370REQUIRES_VIOLATION [2021-10-16 03:02:51,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr371REQUIRES_VIOLATION [2021-10-16 03:02:51,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr372REQUIRES_VIOLATION [2021-10-16 03:02:51,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr373REQUIRES_VIOLATION [2021-10-16 03:02:51,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr374REQUIRES_VIOLATION [2021-10-16 03:02:51,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr375REQUIRES_VIOLATION [2021-10-16 03:02:51,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr376REQUIRES_VIOLATION [2021-10-16 03:02:51,540 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr377REQUIRES_VIOLATION [2021-10-16 03:02:51,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr378REQUIRES_VIOLATION [2021-10-16 03:02:51,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr379REQUIRES_VIOLATION [2021-10-16 03:02:51,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr380REQUIRES_VIOLATION [2021-10-16 03:02:51,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr381REQUIRES_VIOLATION [2021-10-16 03:02:51,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr382REQUIRES_VIOLATION [2021-10-16 03:02:51,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr383REQUIRES_VIOLATION [2021-10-16 03:02:51,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr384REQUIRES_VIOLATION [2021-10-16 03:02:51,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr385REQUIRES_VIOLATION [2021-10-16 03:02:51,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr386REQUIRES_VIOLATION [2021-10-16 03:02:51,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr387REQUIRES_VIOLATION [2021-10-16 03:02:51,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr388REQUIRES_VIOLATION [2021-10-16 03:02:51,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr389REQUIRES_VIOLATION [2021-10-16 03:02:51,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr390REQUIRES_VIOLATION [2021-10-16 03:02:51,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr391REQUIRES_VIOLATION [2021-10-16 03:02:51,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr392REQUIRES_VIOLATION [2021-10-16 03:02:51,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr393REQUIRES_VIOLATION [2021-10-16 03:02:51,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr394REQUIRES_VIOLATION [2021-10-16 03:02:51,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr395REQUIRES_VIOLATION [2021-10-16 03:02:51,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr396REQUIRES_VIOLATION [2021-10-16 03:02:51,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr397REQUIRES_VIOLATION [2021-10-16 03:02:51,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr398REQUIRES_VIOLATION [2021-10-16 03:02:51,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr399REQUIRES_VIOLATION [2021-10-16 03:02:51,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr400REQUIRES_VIOLATION [2021-10-16 03:02:51,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr401REQUIRES_VIOLATION [2021-10-16 03:02:51,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr402REQUIRES_VIOLATION [2021-10-16 03:02:51,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr403REQUIRES_VIOLATION [2021-10-16 03:02:51,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr404REQUIRES_VIOLATION [2021-10-16 03:02:51,546 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr405REQUIRES_VIOLATION [2021-10-16 03:02:51,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr406REQUIRES_VIOLATION [2021-10-16 03:02:51,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr407REQUIRES_VIOLATION [2021-10-16 03:02:51,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr408REQUIRES_VIOLATION [2021-10-16 03:02:51,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr409REQUIRES_VIOLATION [2021-10-16 03:02:51,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr410REQUIRES_VIOLATION [2021-10-16 03:02:51,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr411REQUIRES_VIOLATION [2021-10-16 03:02:51,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr412REQUIRES_VIOLATION [2021-10-16 03:02:51,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr413REQUIRES_VIOLATION [2021-10-16 03:02:51,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr414REQUIRES_VIOLATION [2021-10-16 03:02:51,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr415REQUIRES_VIOLATION [2021-10-16 03:02:51,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr416ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:02:51,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr417ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:02:51,549 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr418ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:02:51,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr419REQUIRES_VIOLATION [2021-10-16 03:02:51,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr420REQUIRES_VIOLATION [2021-10-16 03:02:51,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr421ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:02:51,550 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:02:51,551 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr423ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:02:51,551 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr424REQUIRES_VIOLATION [2021-10-16 03:02:51,551 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr425REQUIRES_VIOLATION [2021-10-16 03:02:51,551 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr426REQUIRES_VIOLATION [2021-10-16 03:02:51,551 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr427REQUIRES_VIOLATION [2021-10-16 03:02:51,552 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr428REQUIRES_VIOLATION [2021-10-16 03:02:51,552 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr429REQUIRES_VIOLATION [2021-10-16 03:02:51,552 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr430REQUIRES_VIOLATION [2021-10-16 03:02:51,552 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr431REQUIRES_VIOLATION [2021-10-16 03:02:51,553 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr432REQUIRES_VIOLATION [2021-10-16 03:02:51,553 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr433REQUIRES_VIOLATION [2021-10-16 03:02:51,553 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr434REQUIRES_VIOLATION [2021-10-16 03:02:51,553 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr435REQUIRES_VIOLATION [2021-10-16 03:02:51,553 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr436REQUIRES_VIOLATION [2021-10-16 03:02:51,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr437REQUIRES_VIOLATION [2021-10-16 03:02:51,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr438REQUIRES_VIOLATION [2021-10-16 03:02:51,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr439REQUIRES_VIOLATION [2021-10-16 03:02:51,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr440REQUIRES_VIOLATION [2021-10-16 03:02:51,554 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr441REQUIRES_VIOLATION [2021-10-16 03:02:51,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr442REQUIRES_VIOLATION [2021-10-16 03:02:51,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr443REQUIRES_VIOLATION [2021-10-16 03:02:51,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr444REQUIRES_VIOLATION [2021-10-16 03:02:51,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr445REQUIRES_VIOLATION [2021-10-16 03:02:51,555 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr446REQUIRES_VIOLATION [2021-10-16 03:02:51,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr447REQUIRES_VIOLATION [2021-10-16 03:02:51,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr448REQUIRES_VIOLATION [2021-10-16 03:02:51,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr449REQUIRES_VIOLATION [2021-10-16 03:02:51,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr450REQUIRES_VIOLATION [2021-10-16 03:02:51,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr451REQUIRES_VIOLATION [2021-10-16 03:02:51,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr452REQUIRES_VIOLATION [2021-10-16 03:02:51,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr453REQUIRES_VIOLATION [2021-10-16 03:02:51,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr454REQUIRES_VIOLATION [2021-10-16 03:02:51,557 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr455REQUIRES_VIOLATION [2021-10-16 03:02:51,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr456REQUIRES_VIOLATION [2021-10-16 03:02:51,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr457REQUIRES_VIOLATION [2021-10-16 03:02:51,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr458REQUIRES_VIOLATION [2021-10-16 03:02:51,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr459REQUIRES_VIOLATION [2021-10-16 03:02:51,558 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr460REQUIRES_VIOLATION [2021-10-16 03:02:51,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr461REQUIRES_VIOLATION [2021-10-16 03:02:51,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr462REQUIRES_VIOLATION [2021-10-16 03:02:51,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr463REQUIRES_VIOLATION [2021-10-16 03:02:51,559 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr464REQUIRES_VIOLATION [2021-10-16 03:02:51,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr465REQUIRES_VIOLATION [2021-10-16 03:02:51,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr466REQUIRES_VIOLATION [2021-10-16 03:02:51,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr467REQUIRES_VIOLATION [2021-10-16 03:02:51,560 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr468ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:02:51,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr469ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:02:51,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr470ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:02:51,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr471REQUIRES_VIOLATION [2021-10-16 03:02:51,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr472REQUIRES_VIOLATION [2021-10-16 03:02:51,561 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr473ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:02:51,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr474ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:02:51,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr475ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:02:51,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr476REQUIRES_VIOLATION [2021-10-16 03:02:51,562 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr477REQUIRES_VIOLATION [2021-10-16 03:02:51,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr478ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:02:51,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr479ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:02:51,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr480ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:02:51,563 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr481ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:02:51,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr482ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:02:51,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr483ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 03:02:51,564 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr484ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 03:02:51,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2021-10-16 03:02:51,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-16 03:02:52,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-10-16 03:02:52,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 03:02:52,203 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-16 03:02:52,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 03:02:52 BoogieIcfgContainer [2021-10-16 03:02:52,250 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-16 03:02:52,250 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-16 03:02:52,251 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-16 03:02:52,251 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-16 03:02:52,251 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:58:23" (3/4) ... [2021-10-16 03:02:52,257 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-16 03:02:52,257 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-16 03:02:52,258 INFO L168 Benchmark]: Toolchain (without parser) took 274200.90 ms. Allocated memory was 50.3 MB in the beginning and 323.0 MB in the end (delta: 272.6 MB). Free memory was 25.3 MB in the beginning and 132.7 MB in the end (delta: -107.4 MB). Peak memory consumption was 165.0 MB. Max. memory is 16.1 GB. [2021-10-16 03:02:52,259 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 50.3 MB. Free memory was 31.2 MB in the beginning and 31.1 MB in the end (delta: 86.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-16 03:02:52,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 607.18 ms. Allocated memory was 50.3 MB in the beginning and 67.1 MB in the end (delta: 16.8 MB). Free memory was 25.2 MB in the beginning and 40.3 MB in the end (delta: -15.1 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. [2021-10-16 03:02:52,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.87 ms. Allocated memory is still 67.1 MB. Free memory was 40.3 MB in the beginning and 47.7 MB in the end (delta: -7.4 MB). Peak memory consumption was 8.7 MB. Max. memory is 16.1 GB. [2021-10-16 03:02:52,261 INFO L168 Benchmark]: Boogie Preprocessor took 104.45 ms. Allocated memory is still 67.1 MB. Free memory was 47.7 MB in the beginning and 42.6 MB in the end (delta: 5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-16 03:02:52,261 INFO L168 Benchmark]: RCFGBuilder took 4781.37 ms. Allocated memory was 67.1 MB in the beginning and 102.8 MB in the end (delta: 35.7 MB). Free memory was 42.3 MB in the beginning and 58.7 MB in the end (delta: -16.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2021-10-16 03:02:52,262 INFO L168 Benchmark]: TraceAbstraction took 268576.99 ms. Allocated memory was 102.8 MB in the beginning and 323.0 MB in the end (delta: 220.2 MB). Free memory was 57.9 MB in the beginning and 132.7 MB in the end (delta: -74.8 MB). Peak memory consumption was 189.9 MB. Max. memory is 16.1 GB. [2021-10-16 03:02:52,262 INFO L168 Benchmark]: Witness Printer took 7.14 ms. Allocated memory is still 323.0 MB. Free memory is still 132.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 03:02:52,267 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 50.3 MB. Free memory was 31.2 MB in the beginning and 31.1 MB in the end (delta: 86.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 607.18 ms. Allocated memory was 50.3 MB in the beginning and 67.1 MB in the end (delta: 16.8 MB). Free memory was 25.2 MB in the beginning and 40.3 MB in the end (delta: -15.1 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 115.87 ms. Allocated memory is still 67.1 MB. Free memory was 40.3 MB in the beginning and 47.7 MB in the end (delta: -7.4 MB). Peak memory consumption was 8.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 104.45 ms. Allocated memory is still 67.1 MB. Free memory was 47.7 MB in the beginning and 42.6 MB in the end (delta: 5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4781.37 ms. Allocated memory was 67.1 MB in the beginning and 102.8 MB in the end (delta: 35.7 MB). Free memory was 42.3 MB in the beginning and 58.7 MB in the end (delta: -16.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 268576.99 ms. Allocated memory was 102.8 MB in the beginning and 323.0 MB in the end (delta: 220.2 MB). Free memory was 57.9 MB in the beginning and 132.7 MB in the end (delta: -74.8 MB). Peak memory consumption was 189.9 MB. Max. memory is 16.1 GB. * Witness Printer took 7.14 ms. Allocated memory is still 323.0 MB. Free memory is still 132.7 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: 570]: 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: [L574] struct list_t *list = malloc(sizeof *list); [L575] list->first = ((void *)0) [L576] list->last = ((void *)0) [L577] char userInput; [L579] char userInput = __VERIFIER_nondet_char(); [L580] COND FALSE !((userInput == '<') || (userInput == '>')) [L559] struct node_t *node = malloc(sizeof *node); [L560] node->data = input [L561] EXPR head->first [L561] head->first == ((void *)0) && head->last == ((void *)0) [L561] EXPR head->last [L561] head->first == ((void *)0) && head->last == ((void *)0) [L561] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L562] head->first = node [L563] head->last= node [L564] node->prev = ((void *)0) [L565] node->next = ((void *)0) [L584] COND FALSE !(__VERIFIER_nondet_int()) [L559] struct node_t *node = malloc(sizeof *node); [L560] node->data = input [L561] EXPR head->first [L561] head->first == ((void *)0) && head->last == ((void *)0) [L561] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L568] EXPR head->last [L568] node->prev = head->last [L569] node->next = ((void *)0) [L570] EXPR head->last [L570] head->last->next = node - UnprovableResult [Line: 575]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 611]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 611]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 614]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 614]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 614]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 622]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 622]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 627]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 627]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 632]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 632]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 637]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 637]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 638]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 638]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 638]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 641]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 641]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 641]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 573]: 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, 902 locations, 485 error locations. Started 1 CEGAR loops. OverallTime: 268426.0ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 52.5ms, AutomataDifference: 72038.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 49.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3137 SDtfs, 9032 SDslu, 4830 SDs, 0 SdLazy, 8003 SolverSat, 575 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 58447.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 117 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 26134.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=985occurred in iteration=1, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 291.8ms AutomataMinimizationTime, 8 MinimizatonAttempts, 1121 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 95.7ms SsaConstructionTime, 345.0ms SatisfiabilityAnalysisTime, 23213.7ms InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 152 ConstructedInterpolants, 27 QuantifiedInterpolants, 1896 SizeOfPredicates, 43 NumberOfNonLiveVariables, 495 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-10-16 03:02:52,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5542af-6622-43c0-82e5-1a251fbad9e5/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...