./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d0b5010c4e76c80e8e6103ea9fc77304c013c292 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d0b5010c4e76c80e8e6103ea9fc77304c013c292 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 08:00:53,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 08:00:53,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 08:00:53,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 08:00:53,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 08:00:53,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 08:00:53,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 08:00:53,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 08:00:53,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 08:00:53,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 08:00:53,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 08:00:53,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 08:00:53,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 08:00:53,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 08:00:53,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 08:00:53,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 08:00:53,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 08:00:53,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 08:00:53,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 08:00:53,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 08:00:53,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 08:00:53,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 08:00:53,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 08:00:53,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 08:00:53,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 08:00:53,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 08:00:53,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 08:00:53,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 08:00:53,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 08:00:53,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 08:00:53,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 08:00:53,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 08:00:53,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 08:00:53,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 08:00:53,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 08:00:53,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 08:00:53,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 08:00:53,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 08:00:53,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 08:00:53,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 08:00:53,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 08:00:53,946 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-10-13 08:00:53,992 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 08:00:53,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 08:00:53,993 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 08:00:53,994 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 08:00:53,994 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 08:00:53,997 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 08:00:53,998 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 08:00:53,998 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 08:00:53,998 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 08:00:53,998 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 08:00:53,999 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 08:00:54,000 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 08:00:54,000 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 08:00:54,000 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 08:00:54,001 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 08:00:54,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 08:00:54,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 08:00:54,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 08:00:54,002 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 08:00:54,002 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 08:00:54,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 08:00:54,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 08:00:54,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 08:00:54,003 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 08:00:54,003 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 08:00:54,004 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-13 08:00:54,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 08:00:54,005 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 08:00:54,006 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 08:00:54,006 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 08:00:54,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 08:00:54,007 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 08:00:54,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 08:00:54,007 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 08:00:54,007 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 08:00:54,008 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 08:00:54,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 08:00:54,008 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 08:00:54,008 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 08:00:54,008 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_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d0b5010c4e76c80e8e6103ea9fc77304c013c292 [2021-10-13 08:00:54,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 08:00:54,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 08:00:54,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 08:00:54,295 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 08:00:54,295 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 08:00:54,296 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2021-10-13 08:00:54,358 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/data/4c5f64543/879bc4ba6e9f4248ae7957803f09b1f3/FLAG2340e8512 [2021-10-13 08:00:55,002 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 08:00:55,003 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2021-10-13 08:00:55,019 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/data/4c5f64543/879bc4ba6e9f4248ae7957803f09b1f3/FLAG2340e8512 [2021-10-13 08:00:55,265 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/data/4c5f64543/879bc4ba6e9f4248ae7957803f09b1f3 [2021-10-13 08:00:55,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 08:00:55,269 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 08:00:55,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 08:00:55,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 08:00:55,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 08:00:55,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:00:55" (1/1) ... [2021-10-13 08:00:55,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@268b0f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:00:55, skipping insertion in model container [2021-10-13 08:00:55,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:00:55" (1/1) ... [2021-10-13 08:00:55,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 08:00:55,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 08:00:55,726 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 08:00:55,741 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 08:00:55,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 08:00:55,842 INFO L208 MainTranslator]: Completed translation [2021-10-13 08:00:55,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:00:55 WrapperNode [2021-10-13 08:00:55,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 08:00:55,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 08:00:55,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 08:00:55,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 08:00:55,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:00:55" (1/1) ... [2021-10-13 08:00:55,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:00:55" (1/1) ... [2021-10-13 08:00:55,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 08:00:55,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 08:00:55,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 08:00:55,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 08:00:55,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:00:55" (1/1) ... [2021-10-13 08:00:55,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:00:55" (1/1) ... [2021-10-13 08:00:55,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:00:55" (1/1) ... [2021-10-13 08:00:55,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:00:55" (1/1) ... [2021-10-13 08:00:56,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:00:55" (1/1) ... [2021-10-13 08:00:56,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:00:55" (1/1) ... [2021-10-13 08:00:56,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:00:55" (1/1) ... [2021-10-13 08:00:56,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 08:00:56,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 08:00:56,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 08:00:56,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 08:00:56,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:00:55" (1/1) ... [2021-10-13 08:00:56,115 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 08:00:56,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 08:00:56,142 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 08:00:56,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 08:00:56,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-13 08:00:56,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 08:00:56,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 08:00:56,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 08:00:56,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 08:00:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 08:00:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 08:00:56,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 08:00:56,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 08:00:56,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 08:00:58,561 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 08:00:58,561 INFO L299 CfgBuilder]: Removed 49 assume(true) statements. [2021-10-13 08:00:58,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:00:58 BoogieIcfgContainer [2021-10-13 08:00:58,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 08:00:58,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 08:00:58,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 08:00:58,574 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 08:00:58,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:00:55" (1/3) ... [2021-10-13 08:00:58,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b79cba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:00:58, skipping insertion in model container [2021-10-13 08:00:58,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:00:55" (2/3) ... [2021-10-13 08:00:58,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b79cba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:00:58, skipping insertion in model container [2021-10-13 08:00:58,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:00:58" (3/3) ... [2021-10-13 08:00:58,578 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-2.i [2021-10-13 08:00:58,584 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 08:00:58,585 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 511 error locations. [2021-10-13 08:00:58,627 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 08:00:58,633 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 08:00:58,634 INFO L340 AbstractCegarLoop]: Starting to check reachability of 511 error locations. [2021-10-13 08:00:58,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 861 states, 349 states have (on average 2.6246418338108883) internal successors, (916), 860 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:00:58,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-13 08:00:58,714 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:00:58,714 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-13 08:00:58,715 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:00:58,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:00:58,721 INFO L82 PathProgramCache]: Analyzing trace with hash 42102, now seen corresponding path program 1 times [2021-10-13 08:00:58,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:00:58,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326532442] [2021-10-13 08:00:58,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:00:58,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:00:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:00:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:00:58,899 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:00:58,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326532442] [2021-10-13 08:00:58,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326532442] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:00:58,901 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:00:58,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 08:00:58,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077292936] [2021-10-13 08:00:58,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 08:00:58,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:00:58,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 08:00:58,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:00:58,942 INFO L87 Difference]: Start difference. First operand has 861 states, 349 states have (on average 2.6246418338108883) internal successors, (916), 860 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:00:59,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:00:59,831 INFO L93 Difference]: Finished difference Result 1063 states and 1128 transitions. [2021-10-13 08:00:59,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:00:59,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-13 08:00:59,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:00:59,852 INFO L225 Difference]: With dead ends: 1063 [2021-10-13 08:00:59,852 INFO L226 Difference]: Without dead ends: 1062 [2021-10-13 08:00:59,854 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:00:59,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2021-10-13 08:00:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 931. [2021-10-13 08:00:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 423 states have (on average 2.557919621749409) internal successors, (1082), 930 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:00:59,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1082 transitions. [2021-10-13 08:00:59,949 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1082 transitions. Word has length 2 [2021-10-13 08:00:59,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:00:59,950 INFO L470 AbstractCegarLoop]: Abstraction has 931 states and 1082 transitions. [2021-10-13 08:00:59,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:00:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1082 transitions. [2021-10-13 08:00:59,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-13 08:00:59,950 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:00:59,951 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-13 08:00:59,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 08:00:59,951 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:00:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:00:59,956 INFO L82 PathProgramCache]: Analyzing trace with hash 42103, now seen corresponding path program 1 times [2021-10-13 08:00:59,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:00:59,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243364783] [2021-10-13 08:00:59,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:00:59,957 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:00:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:01:00,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:01:00,008 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:01:00,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243364783] [2021-10-13 08:01:00,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243364783] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:01:00,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:01:00,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 08:01:00,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421915926] [2021-10-13 08:01:00,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 08:01:00,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:01:00,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 08:01:00,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:01:00,012 INFO L87 Difference]: Start difference. First operand 931 states and 1082 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:01:00,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:01:00,680 INFO L93 Difference]: Finished difference Result 931 states and 1083 transitions. [2021-10-13 08:01:00,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:01:00,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-13 08:01:00,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:01:00,686 INFO L225 Difference]: With dead ends: 931 [2021-10-13 08:01:00,686 INFO L226 Difference]: Without dead ends: 931 [2021-10-13 08:01:00,687 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:01:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2021-10-13 08:01:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 929. [2021-10-13 08:01:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 423 states have (on average 2.5531914893617023) internal successors, (1080), 928 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:01:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1080 transitions. [2021-10-13 08:01:00,714 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1080 transitions. Word has length 2 [2021-10-13 08:01:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:01:00,714 INFO L470 AbstractCegarLoop]: Abstraction has 929 states and 1080 transitions. [2021-10-13 08:01:00,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:01:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1080 transitions. [2021-10-13 08:01:00,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 08:01:00,715 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:01:00,715 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-13 08:01:00,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 08:01:00,716 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:01:00,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:01:00,716 INFO L82 PathProgramCache]: Analyzing trace with hash 265205178, now seen corresponding path program 1 times [2021-10-13 08:01:00,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:01:00,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956661636] [2021-10-13 08:01:00,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:01:00,717 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:01:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:01:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:01:00,796 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:01:00,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956661636] [2021-10-13 08:01:00,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956661636] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:01:00,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:01:00,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 08:01:00,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373568053] [2021-10-13 08:01:00,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 08:01:00,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:01:00,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 08:01:00,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:01:00,799 INFO L87 Difference]: Start difference. First operand 929 states and 1080 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-13 08:01:01,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:01:01,600 INFO L93 Difference]: Finished difference Result 987 states and 1053 transitions. [2021-10-13 08:01:01,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:01:01,600 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-13 08:01:01,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:01:01,606 INFO L225 Difference]: With dead ends: 987 [2021-10-13 08:01:01,606 INFO L226 Difference]: Without dead ends: 987 [2021-10-13 08:01:01,607 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-13 08:01:01,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2021-10-13 08:01:01,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 854. [2021-10-13 08:01:01,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 423 states have (on average 2.375886524822695) internal successors, (1005), 853 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:01:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1005 transitions. [2021-10-13 08:01:01,629 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1005 transitions. Word has length 6 [2021-10-13 08:01:01,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:01:01,630 INFO L470 AbstractCegarLoop]: Abstraction has 854 states and 1005 transitions. [2021-10-13 08:01:01,630 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-13 08:01:01,630 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1005 transitions. [2021-10-13 08:01:01,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 08:01:01,630 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:01:01,630 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-13 08:01:01,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 08:01:01,631 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:01:01,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:01:01,631 INFO L82 PathProgramCache]: Analyzing trace with hash 265205179, now seen corresponding path program 1 times [2021-10-13 08:01:01,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:01:01,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014023439] [2021-10-13 08:01:01,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:01:01,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:01:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:01:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:01:01,676 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:01:01,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014023439] [2021-10-13 08:01:01,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014023439] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:01:01,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:01:01,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 08:01:01,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559796554] [2021-10-13 08:01:01,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 08:01:01,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:01:01,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 08:01:01,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:01:01,678 INFO L87 Difference]: Start difference. First operand 854 states and 1005 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-13 08:01:02,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:01:02,308 INFO L93 Difference]: Finished difference Result 781 states and 933 transitions. [2021-10-13 08:01:02,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:01:02,309 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-13 08:01:02,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:01:02,313 INFO L225 Difference]: With dead ends: 781 [2021-10-13 08:01:02,314 INFO L226 Difference]: Without dead ends: 781 [2021-10-13 08:01:02,314 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:01:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2021-10-13 08:01:02,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 779. [2021-10-13 08:01:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 423 states have (on average 2.198581560283688) internal successors, (930), 778 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:01:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 930 transitions. [2021-10-13 08:01:02,334 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 930 transitions. Word has length 6 [2021-10-13 08:01:02,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:01:02,336 INFO L470 AbstractCegarLoop]: Abstraction has 779 states and 930 transitions. [2021-10-13 08:01:02,337 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-13 08:01:02,337 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 930 transitions. [2021-10-13 08:01:02,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 08:01:02,337 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:01:02,338 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:01:02,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 08:01:02,339 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:01:02,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:01:02,340 INFO L82 PathProgramCache]: Analyzing trace with hash -368574073, now seen corresponding path program 1 times [2021-10-13 08:01:02,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:01:02,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783840419] [2021-10-13 08:01:02,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:01:02,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:01:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:01:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:01:02,482 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:01:02,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783840419] [2021-10-13 08:01:02,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783840419] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:01:02,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:01:02,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 08:01:02,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724137825] [2021-10-13 08:01:02,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 08:01:02,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:01:02,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 08:01:02,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 08:01:02,485 INFO L87 Difference]: Start difference. First operand 779 states and 930 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-13 08:01:03,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:01:03,440 INFO L93 Difference]: Finished difference Result 804 states and 870 transitions. [2021-10-13 08:01:03,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 08:01:03,441 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-13 08:01:03,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:01:03,445 INFO L225 Difference]: With dead ends: 804 [2021-10-13 08:01:03,445 INFO L226 Difference]: Without dead ends: 804 [2021-10-13 08:01:03,446 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 28.0ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-13 08:01:03,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2021-10-13 08:01:03,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 672. [2021-10-13 08:01:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 423 states have (on average 1.9432624113475176) internal successors, (822), 671 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:01:03,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 822 transitions. [2021-10-13 08:01:03,462 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 822 transitions. Word has length 7 [2021-10-13 08:01:03,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:01:03,463 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 822 transitions. [2021-10-13 08:01:03,463 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-13 08:01:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 822 transitions. [2021-10-13 08:01:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 08:01:03,464 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:01:03,464 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:01:03,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 08:01:03,464 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:01:03,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:01:03,465 INFO L82 PathProgramCache]: Analyzing trace with hash -368574074, now seen corresponding path program 1 times [2021-10-13 08:01:03,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:01:03,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874251180] [2021-10-13 08:01:03,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:01:03,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:01:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:01:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:01:03,508 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:01:03,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874251180] [2021-10-13 08:01:03,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874251180] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:01:03,508 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:01:03,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 08:01:03,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566170427] [2021-10-13 08:01:03,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 08:01:03,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:01:03,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 08:01:03,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 08:01:03,510 INFO L87 Difference]: Start difference. First operand 672 states and 822 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-13 08:01:04,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:01:04,166 INFO L93 Difference]: Finished difference Result 699 states and 765 transitions. [2021-10-13 08:01:04,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 08:01:04,167 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-13 08:01:04,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:01:04,171 INFO L225 Difference]: With dead ends: 699 [2021-10-13 08:01:04,171 INFO L226 Difference]: Without dead ends: 699 [2021-10-13 08:01:04,172 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 08:01:04,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-10-13 08:01:04,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 567. [2021-10-13 08:01:04,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 423 states have (on average 1.6950354609929077) internal successors, (717), 566 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:01:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 717 transitions. [2021-10-13 08:01:04,188 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 717 transitions. Word has length 7 [2021-10-13 08:01:04,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:01:04,188 INFO L470 AbstractCegarLoop]: Abstraction has 567 states and 717 transitions. [2021-10-13 08:01:04,188 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-13 08:01:04,188 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 717 transitions. [2021-10-13 08:01:04,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 08:01:04,189 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:01:04,189 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:01:04,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 08:01:04,190 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:01:04,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:01:04,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1840159281, now seen corresponding path program 1 times [2021-10-13 08:01:04,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:01:04,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029671289] [2021-10-13 08:01:04,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:01:04,191 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:01:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:01:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:01:04,297 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:01:04,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029671289] [2021-10-13 08:01:04,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029671289] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:01:04,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:01:04,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 08:01:04,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906663947] [2021-10-13 08:01:04,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 08:01:04,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:01:04,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 08:01:04,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 08:01:04,300 INFO L87 Difference]: Start difference. First operand 567 states and 717 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-13 08:01:04,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:01:04,974 INFO L93 Difference]: Finished difference Result 582 states and 734 transitions. [2021-10-13 08:01:04,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 08:01:04,974 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-13 08:01:04,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:01:04,977 INFO L225 Difference]: With dead ends: 582 [2021-10-13 08:01:04,978 INFO L226 Difference]: Without dead ends: 582 [2021-10-13 08:01:04,978 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 64.8ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-10-13 08:01:04,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-10-13 08:01:04,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 572. [2021-10-13 08:01:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 428 states have (on average 1.689252336448598) internal successors, (723), 571 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:01:04,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 723 transitions. [2021-10-13 08:01:04,991 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 723 transitions. Word has length 14 [2021-10-13 08:01:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:01:04,991 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 723 transitions. [2021-10-13 08:01:04,991 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-13 08:01:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 723 transitions. [2021-10-13 08:01:04,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 08:01:04,993 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:01:04,993 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:01:04,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 08:01:04,993 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:01:04,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:01:04,994 INFO L82 PathProgramCache]: Analyzing trace with hash -112463990, now seen corresponding path program 1 times [2021-10-13 08:01:04,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:01:04,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035019717] [2021-10-13 08:01:04,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:01:04,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:01:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:01:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:01:05,173 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:01:05,173 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035019717] [2021-10-13 08:01:05,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035019717] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:01:05,173 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:01:05,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 08:01:05,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090432628] [2021-10-13 08:01:05,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 08:01:05,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:01:05,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 08:01:05,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-13 08:01:05,175 INFO L87 Difference]: Start difference. First operand 572 states and 723 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-13 08:01:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:01:06,442 INFO L93 Difference]: Finished difference Result 706 states and 772 transitions. [2021-10-13 08:01:06,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 08:01:06,442 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-13 08:01:06,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:01:06,446 INFO L225 Difference]: With dead ends: 706 [2021-10-13 08:01:06,447 INFO L226 Difference]: Without dead ends: 706 [2021-10-13 08:01:06,447 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 77.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 08:01:06,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2021-10-13 08:01:06,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 574. [2021-10-13 08:01:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 430 states have (on average 1.686046511627907) internal successors, (725), 573 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:01:06,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 725 transitions. [2021-10-13 08:01:06,461 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 725 transitions. Word has length 15 [2021-10-13 08:01:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:01:06,461 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 725 transitions. [2021-10-13 08:01:06,461 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-13 08:01:06,462 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 725 transitions. [2021-10-13 08:01:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 08:01:06,462 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:01:06,463 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-13 08:01:06,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 08:01:06,463 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:01:06,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:01:06,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1404439870, now seen corresponding path program 1 times [2021-10-13 08:01:06,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:01:06,464 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174607800] [2021-10-13 08:01:06,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:01:06,464 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:01:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:01:06,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:01:06,790 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:01:06,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174607800] [2021-10-13 08:01:06,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174607800] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:01:06,792 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:01:06,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 08:01:06,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578529624] [2021-10-13 08:01:06,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 08:01:06,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:01:06,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 08:01:06,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-10-13 08:01:06,796 INFO L87 Difference]: Start difference. First operand 574 states and 725 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 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-13 08:01:08,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:01:08,643 INFO L93 Difference]: Finished difference Result 898 states and 978 transitions. [2021-10-13 08:01:08,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 08:01:08,643 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 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-13 08:01:08,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:01:08,648 INFO L225 Difference]: With dead ends: 898 [2021-10-13 08:01:08,649 INFO L226 Difference]: Without dead ends: 898 [2021-10-13 08:01:08,649 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 233.9ms TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2021-10-13 08:01:08,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2021-10-13 08:01:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 559. [2021-10-13 08:01:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 430 states have (on average 1.6511627906976745) internal successors, (710), 558 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:01:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 710 transitions. [2021-10-13 08:01:08,663 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 710 transitions. Word has length 26 [2021-10-13 08:01:08,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:01:08,664 INFO L470 AbstractCegarLoop]: Abstraction has 559 states and 710 transitions. [2021-10-13 08:01:08,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 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-13 08:01:08,664 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 710 transitions. [2021-10-13 08:01:08,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 08:01:08,665 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:01:08,665 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-13 08:01:08,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 08:01:08,666 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:01:08,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:01:08,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1404439871, now seen corresponding path program 1 times [2021-10-13 08:01:08,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:01:08,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298695642] [2021-10-13 08:01:08,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:01:08,667 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:01:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:01:09,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:01:09,066 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:01:09,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298695642] [2021-10-13 08:01:09,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298695642] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:01:09,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:01:09,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 08:01:09,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423507030] [2021-10-13 08:01:09,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 08:01:09,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:01:09,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 08:01:09,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-10-13 08:01:09,068 INFO L87 Difference]: Start difference. First operand 559 states and 710 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-13 08:01:10,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:01:10,943 INFO L93 Difference]: Finished difference Result 676 states and 742 transitions. [2021-10-13 08:01:10,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 08:01:10,943 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-13 08:01:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:01:10,946 INFO L225 Difference]: With dead ends: 676 [2021-10-13 08:01:10,947 INFO L226 Difference]: Without dead ends: 676 [2021-10-13 08:01:10,947 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 292.8ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-10-13 08:01:10,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2021-10-13 08:01:10,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 544. [2021-10-13 08:01:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 430 states have (on average 1.6162790697674418) internal successors, (695), 543 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:01:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 695 transitions. [2021-10-13 08:01:10,959 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 695 transitions. Word has length 26 [2021-10-13 08:01:10,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:01:10,960 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 695 transitions. [2021-10-13 08:01:10,960 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-13 08:01:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 695 transitions. [2021-10-13 08:01:10,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-10-13 08:01:10,967 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:01:10,967 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] [2021-10-13 08:01:10,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 08:01:10,967 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:01:10,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:01:10,968 INFO L82 PathProgramCache]: Analyzing trace with hash -514564473, now seen corresponding path program 1 times [2021-10-13 08:01:10,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:01:10,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883355345] [2021-10-13 08:01:10,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:01:10,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:01:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:01:11,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:01:11,063 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:01:11,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883355345] [2021-10-13 08:01:11,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883355345] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:01:11,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:01:11,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 08:01:11,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994216258] [2021-10-13 08:01:11,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 08:01:11,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:01:11,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 08:01:11,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:01:11,065 INFO L87 Difference]: Start difference. First operand 544 states and 695 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:01:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:01:11,177 INFO L93 Difference]: Finished difference Result 559 states and 710 transitions. [2021-10-13 08:01:11,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:01:11,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2021-10-13 08:01:11,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:01:11,182 INFO L225 Difference]: With dead ends: 559 [2021-10-13 08:01:11,182 INFO L226 Difference]: Without dead ends: 559 [2021-10-13 08:01:11,182 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:01:11,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2021-10-13 08:01:11,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2021-10-13 08:01:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 445 states have (on average 1.595505617977528) internal successors, (710), 558 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:01:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 710 transitions. [2021-10-13 08:01:11,194 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 710 transitions. Word has length 150 [2021-10-13 08:01:11,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:01:11,196 INFO L470 AbstractCegarLoop]: Abstraction has 559 states and 710 transitions. [2021-10-13 08:01:11,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:01:11,196 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 710 transitions. [2021-10-13 08:01:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-10-13 08:01:11,210 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:01:11,211 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] [2021-10-13 08:01:11,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 08:01:11,211 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:01:11,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:01:11,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1235563742, now seen corresponding path program 1 times [2021-10-13 08:01:11,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:01:11,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743435869] [2021-10-13 08:01:11,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:01:11,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:01:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:01:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:01:11,644 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:01:11,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743435869] [2021-10-13 08:01:11,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743435869] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:01:11,644 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:01:11,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-13 08:01:11,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748893685] [2021-10-13 08:01:11,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-13 08:01:11,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:01:11,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-13 08:01:11,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-10-13 08:01:11,646 INFO L87 Difference]: Start difference. First operand 559 states and 710 transitions. Second operand has 14 states, 14 states have (on average 11.714285714285714) internal successors, (164), 14 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:01:12,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:01:12,904 INFO L93 Difference]: Finished difference Result 608 states and 646 transitions. [2021-10-13 08:01:12,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 08:01:12,905 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.714285714285714) internal successors, (164), 14 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2021-10-13 08:01:12,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:01:12,908 INFO L225 Difference]: With dead ends: 608 [2021-10-13 08:01:12,908 INFO L226 Difference]: Without dead ends: 608 [2021-10-13 08:01:12,908 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 194.0ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-10-13 08:01:12,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-10-13 08:01:12,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 473. [2021-10-13 08:01:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 359 states have (on average 1.6545961002785516) internal successors, (594), 472 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:01:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 594 transitions. [2021-10-13 08:01:12,919 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 594 transitions. Word has length 164 [2021-10-13 08:01:12,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:01:12,920 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 594 transitions. [2021-10-13 08:01:12,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.714285714285714) internal successors, (164), 14 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:01:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 594 transitions. [2021-10-13 08:01:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-10-13 08:01:12,922 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:01:12,922 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-13 08:01:12,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 08:01:12,923 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:01:12,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:01:12,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1047151092, now seen corresponding path program 1 times [2021-10-13 08:01:12,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:01:12,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296301124] [2021-10-13 08:01:12,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:01:12,924 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:01:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:03:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:03:43,246 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:03:43,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296301124] [2021-10-13 08:03:43,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296301124] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:03:43,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:03:43,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-10-13 08:03:43,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751205311] [2021-10-13 08:03:43,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-10-13 08:03:43,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:03:43,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-10-13 08:03:43,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1107, Unknown=0, NotChecked=0, Total=1406 [2021-10-13 08:03:43,250 INFO L87 Difference]: Start difference. First operand 473 states and 594 transitions. Second operand has 38 states, 37 states have (on average 4.8108108108108105) internal successors, (178), 37 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-13 08:03:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:03:45,091 INFO L93 Difference]: Finished difference Result 594 states and 631 transitions. [2021-10-13 08:03:45,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 08:03:45,092 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 4.8108108108108105) internal successors, (178), 37 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-13 08:03:45,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:03:45,096 INFO L225 Difference]: With dead ends: 594 [2021-10-13 08:03:45,096 INFO L226 Difference]: Without dead ends: 594 [2021-10-13 08:03:45,097 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 62 SyntacticMatches, 23 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1081.5ms TimeCoverageRelationStatistics Valid=339, Invalid=1221, Unknown=0, NotChecked=0, Total=1560 [2021-10-13 08:03:45,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-10-13 08:03:45,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 472. [2021-10-13 08:03:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 364 states have (on average 1.6428571428571428) internal successors, (598), 471 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:03:45,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 598 transitions. [2021-10-13 08:03:45,107 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 598 transitions. Word has length 178 [2021-10-13 08:03:45,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:03:45,108 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 598 transitions. [2021-10-13 08:03:45,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 4.8108108108108105) internal successors, (178), 37 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-13 08:03:45,108 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 598 transitions. [2021-10-13 08:03:45,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-10-13 08:03:45,110 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:03:45,110 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-13 08:03:45,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 08:03:45,111 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:03:45,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:03:45,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1047151091, now seen corresponding path program 1 times [2021-10-13 08:03:45,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:03:45,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402872789] [2021-10-13 08:03:45,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:03:45,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:03:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:04:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:04:26,336 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:04:26,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402872789] [2021-10-13 08:04:26,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402872789] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:04:26,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:04:26,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-10-13 08:04:26,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32677405] [2021-10-13 08:04:26,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-10-13 08:04:26,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:04:26,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-10-13 08:04:26,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=1129, Unknown=0, NotChecked=0, Total=1482 [2021-10-13 08:04:26,339 INFO L87 Difference]: Start difference. First operand 472 states and 598 transitions. Second operand has 39 states, 38 states have (on average 4.684210526315789) internal successors, (178), 38 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-13 08:04:28,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:04:28,439 INFO L93 Difference]: Finished difference Result 583 states and 620 transitions. [2021-10-13 08:04:28,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 08:04:28,440 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 4.684210526315789) internal successors, (178), 38 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-13 08:04:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:04:28,451 INFO L225 Difference]: With dead ends: 583 [2021-10-13 08:04:28,452 INFO L226 Difference]: Without dead ends: 583 [2021-10-13 08:04:28,454 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 37 SyntacticMatches, 47 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2054 ImplicationChecksByTransitivity, 1931.8ms TimeCoverageRelationStatistics Valid=453, Invalid=1269, Unknown=0, NotChecked=0, Total=1722 [2021-10-13 08:04:28,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-10-13 08:04:28,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 476. [2021-10-13 08:04:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 369 states have (on average 1.6178861788617886) internal successors, (597), 475 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:04:28,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 597 transitions. [2021-10-13 08:04:28,463 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 597 transitions. Word has length 178 [2021-10-13 08:04:28,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:04:28,464 INFO L470 AbstractCegarLoop]: Abstraction has 476 states and 597 transitions. [2021-10-13 08:04:28,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.684210526315789) internal successors, (178), 38 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-13 08:04:28,465 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 597 transitions. [2021-10-13 08:04:28,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-10-13 08:04:28,466 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:04:28,467 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-13 08:04:28,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 08:04:28,467 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr398REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:04:28,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:04:28,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1289439588, now seen corresponding path program 1 times [2021-10-13 08:04:28,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:04:28,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386392466] [2021-10-13 08:04:28,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:04:28,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:04:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:04:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:04:28,640 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:04:28,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386392466] [2021-10-13 08:04:28,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386392466] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:04:28,641 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:04:28,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 08:04:28,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558428982] [2021-10-13 08:04:28,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 08:04:28,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:04:28,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 08:04:28,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 08:04:28,642 INFO L87 Difference]: Start difference. First operand 476 states and 597 transitions. Second operand has 4 states, 3 states have (on average 60.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-13 08:04:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:04:29,233 INFO L93 Difference]: Finished difference Result 666 states and 711 transitions. [2021-10-13 08:04:29,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 08:04:29,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 60.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-13 08:04:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:04:29,237 INFO L225 Difference]: With dead ends: 666 [2021-10-13 08:04:29,237 INFO L226 Difference]: Without dead ends: 666 [2021-10-13 08:04:29,239 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 08:04:29,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-10-13 08:04:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 471. [2021-10-13 08:04:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 369 states have (on average 1.5880758807588076) internal successors, (586), 470 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:04:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 586 transitions. [2021-10-13 08:04:29,249 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 586 transitions. Word has length 180 [2021-10-13 08:04:29,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:04:29,250 INFO L470 AbstractCegarLoop]: Abstraction has 471 states and 586 transitions. [2021-10-13 08:04:29,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 60.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-13 08:04:29,250 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 586 transitions. [2021-10-13 08:04:29,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-10-13 08:04:29,252 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:04:29,252 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-13 08:04:29,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 08:04:29,252 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr399REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:04:29,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:04:29,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1289439587, now seen corresponding path program 1 times [2021-10-13 08:04:29,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:04:29,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243849231] [2021-10-13 08:04:29,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:04:29,254 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:04:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:04:34,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:04:34,355 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:04:34,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243849231] [2021-10-13 08:04:34,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243849231] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:04:34,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:04:34,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-10-13 08:04:34,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727009546] [2021-10-13 08:04:34,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-13 08:04:34,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:04:34,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-13 08:04:34,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2021-10-13 08:04:34,359 INFO L87 Difference]: Start difference. First operand 471 states and 586 transitions. Second operand has 30 states, 29 states have (on average 6.206896551724138) internal successors, (180), 29 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-13 08:04:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:04:35,928 INFO L93 Difference]: Finished difference Result 678 states and 722 transitions. [2021-10-13 08:04:35,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 08:04:35,928 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 6.206896551724138) internal successors, (180), 29 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-13 08:04:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:04:35,932 INFO L225 Difference]: With dead ends: 678 [2021-10-13 08:04:35,932 INFO L226 Difference]: Without dead ends: 678 [2021-10-13 08:04:35,933 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 36 SyntacticMatches, 58 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 914.8ms TimeCoverageRelationStatistics Valid=334, Invalid=926, Unknown=0, NotChecked=0, Total=1260 [2021-10-13 08:04:35,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2021-10-13 08:04:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 471. [2021-10-13 08:04:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 369 states have (on average 1.5718157181571815) internal successors, (580), 470 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:04:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 580 transitions. [2021-10-13 08:04:35,944 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 580 transitions. Word has length 180 [2021-10-13 08:04:35,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:04:35,944 INFO L470 AbstractCegarLoop]: Abstraction has 471 states and 580 transitions. [2021-10-13 08:04:35,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 6.206896551724138) internal successors, (180), 29 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-13 08:04:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 580 transitions. [2021-10-13 08:04:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-10-13 08:04:35,947 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:04:35,947 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-13 08:04:35,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 08:04:35,947 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr402REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:04:35,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:04:35,948 INFO L82 PathProgramCache]: Analyzing trace with hash 504424274, now seen corresponding path program 1 times [2021-10-13 08:04:35,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:04:35,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126558533] [2021-10-13 08:04:35,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:04:35,949 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:04:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:04:50,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:04:50,267 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:04:50,267 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126558533] [2021-10-13 08:04:50,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126558533] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:04:50,267 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:04:50,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-10-13 08:04:50,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910047693] [2021-10-13 08:04:50,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-10-13 08:04:50,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:04:50,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-10-13 08:04:50,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1415, Unknown=0, NotChecked=0, Total=1640 [2021-10-13 08:04:50,270 INFO L87 Difference]: Start difference. First operand 471 states and 580 transitions. Second operand has 41 states, 41 states have (on average 4.463414634146342) internal successors, (183), 40 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-13 08:04:56,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:04:56,449 INFO L93 Difference]: Finished difference Result 760 states and 808 transitions. [2021-10-13 08:04:56,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-13 08:04:56,449 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.463414634146342) internal successors, (183), 40 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-13 08:04:56,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:04:56,453 INFO L225 Difference]: With dead ends: 760 [2021-10-13 08:04:56,453 INFO L226 Difference]: Without dead ends: 760 [2021-10-13 08:04:56,454 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 26 SyntacticMatches, 60 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1638 ImplicationChecksByTransitivity, 4864.4ms TimeCoverageRelationStatistics Valid=681, Invalid=3351, Unknown=0, NotChecked=0, Total=4032 [2021-10-13 08:04:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2021-10-13 08:04:56,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 469. [2021-10-13 08:04:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 367 states have (on average 1.5667574931880108) internal successors, (575), 468 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:04:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 575 transitions. [2021-10-13 08:04:56,465 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 575 transitions. Word has length 183 [2021-10-13 08:04:56,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:04:56,465 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 575 transitions. [2021-10-13 08:04:56,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.463414634146342) internal successors, (183), 40 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-13 08:04:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 575 transitions. [2021-10-13 08:04:56,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-10-13 08:04:56,468 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:04:56,468 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] [2021-10-13 08:04:56,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 08:04:56,468 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr406REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:04:56,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:04:56,469 INFO L82 PathProgramCache]: Analyzing trace with hash -570928098, now seen corresponding path program 1 times [2021-10-13 08:04:56,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:04:56,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613989129] [2021-10-13 08:04:56,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:04:56,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:04:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:04:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:04:56,614 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:04:56,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613989129] [2021-10-13 08:04:56,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613989129] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:04:56,615 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:04:56,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 08:04:56,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536765600] [2021-10-13 08:04:56,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 08:04:56,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:04:56,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 08:04:56,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 08:04:56,617 INFO L87 Difference]: Start difference. First operand 469 states and 575 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:04:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:04:56,637 INFO L93 Difference]: Finished difference Result 566 states and 673 transitions. [2021-10-13 08:04:56,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 08:04:56,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 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 185 [2021-10-13 08:04:56,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:04:56,641 INFO L225 Difference]: With dead ends: 566 [2021-10-13 08:04:56,641 INFO L226 Difference]: Without dead ends: 566 [2021-10-13 08:04:56,641 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 08:04:56,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2021-10-13 08:04:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 468. [2021-10-13 08:04:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 366 states have (on average 1.5546448087431695) internal successors, (569), 467 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:04:56,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 569 transitions. [2021-10-13 08:04:56,650 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 569 transitions. Word has length 185 [2021-10-13 08:04:56,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:04:56,651 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 569 transitions. [2021-10-13 08:04:56,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:04:56,651 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 569 transitions. [2021-10-13 08:04:56,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-10-13 08:04:56,653 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:04:56,653 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, 1] [2021-10-13 08:04:56,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 08:04:56,654 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr412REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:04:56,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:04:56,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1105424109, now seen corresponding path program 1 times [2021-10-13 08:04:56,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:04:56,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134571154] [2021-10-13 08:04:56,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:04:56,656 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:04:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:04:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:04:56,796 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:04:56,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134571154] [2021-10-13 08:04:56,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134571154] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:04:56,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:04:56,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 08:04:56,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369915878] [2021-10-13 08:04:56,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 08:04:56,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:04:56,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 08:04:56,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 08:04:56,800 INFO L87 Difference]: Start difference. First operand 468 states and 569 transitions. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:04:56,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:04:56,821 INFO L93 Difference]: Finished difference Result 538 states and 636 transitions. [2021-10-13 08:04:56,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 08:04:56,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 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 187 [2021-10-13 08:04:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:04:56,824 INFO L225 Difference]: With dead ends: 538 [2021-10-13 08:04:56,825 INFO L226 Difference]: Without dead ends: 538 [2021-10-13 08:04:56,825 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 08:04:56,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-10-13 08:04:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 466. [2021-10-13 08:04:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 364 states have (on average 1.5384615384615385) internal successors, (560), 465 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-13 08:04:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 560 transitions. [2021-10-13 08:04:56,834 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 560 transitions. Word has length 187 [2021-10-13 08:04:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:04:56,834 INFO L470 AbstractCegarLoop]: Abstraction has 466 states and 560 transitions. [2021-10-13 08:04:56,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:04:56,835 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 560 transitions. [2021-10-13 08:04:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-10-13 08:04:56,837 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:04:56,837 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, 1, 1, 1] [2021-10-13 08:04:56,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 08:04:56,837 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr420REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:04:56,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:04:56,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1470022495, now seen corresponding path program 1 times [2021-10-13 08:04:56,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:04:56,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697476318] [2021-10-13 08:04:56,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:04:56,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:04:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:04:56,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:04:56,979 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:04:56,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697476318] [2021-10-13 08:04:56,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697476318] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:04:56,979 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:04:56,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 08:04:56,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749838848] [2021-10-13 08:04:56,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 08:04:56,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:04:56,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 08:04:56,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 08:04:56,981 INFO L87 Difference]: Start difference. First operand 466 states and 560 transitions. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:04:57,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:04:57,002 INFO L93 Difference]: Finished difference Result 503 states and 590 transitions. [2021-10-13 08:04:57,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 08:04:57,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2021-10-13 08:04:57,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:04:57,006 INFO L225 Difference]: With dead ends: 503 [2021-10-13 08:04:57,006 INFO L226 Difference]: Without dead ends: 503 [2021-10-13 08:04:57,006 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 08:04:57,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2021-10-13 08:04:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 463. [2021-10-13 08:04:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 361 states have (on average 1.518005540166205) internal successors, (548), 462 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:04:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 548 transitions. [2021-10-13 08:04:57,015 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 548 transitions. Word has length 189 [2021-10-13 08:04:57,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:04:57,015 INFO L470 AbstractCegarLoop]: Abstraction has 463 states and 548 transitions. [2021-10-13 08:04:57,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:04:57,016 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 548 transitions. [2021-10-13 08:04:57,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-10-13 08:04:57,018 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:04:57,020 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, 1, 1, 1, 1, 1] [2021-10-13 08:04:57,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 08:04:57,021 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr430REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:04:57,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:04:57,023 INFO L82 PathProgramCache]: Analyzing trace with hash -335383276, now seen corresponding path program 1 times [2021-10-13 08:04:57,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:04:57,023 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074794170] [2021-10-13 08:04:57,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:04:57,023 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:04:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:04:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:04:57,173 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:04:57,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074794170] [2021-10-13 08:04:57,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074794170] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:04:57,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:04:57,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 08:04:57,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749533795] [2021-10-13 08:04:57,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 08:04:57,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:04:57,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 08:04:57,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 08:04:57,176 INFO L87 Difference]: Start difference. First operand 463 states and 548 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:04:57,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:04:57,193 INFO L93 Difference]: Finished difference Result 461 states and 535 transitions. [2021-10-13 08:04:57,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 08:04:57,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 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 191 [2021-10-13 08:04:57,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:04:57,197 INFO L225 Difference]: With dead ends: 461 [2021-10-13 08:04:57,197 INFO L226 Difference]: Without dead ends: 461 [2021-10-13 08:04:57,197 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 08:04:57,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-10-13 08:04:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2021-10-13 08:04:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 357 states have (on average 1.4929971988795518) internal successors, (533), 458 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:04:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 533 transitions. [2021-10-13 08:04:57,205 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 533 transitions. Word has length 191 [2021-10-13 08:04:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:04:57,206 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 533 transitions. [2021-10-13 08:04:57,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:04:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 533 transitions. [2021-10-13 08:04:57,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-10-13 08:04:57,209 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:04:57,209 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:04:57,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 08:04:57,209 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr443ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:04:57,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:04:57,210 INFO L82 PathProgramCache]: Analyzing trace with hash -440958066, now seen corresponding path program 1 times [2021-10-13 08:04:57,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:04:57,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020496303] [2021-10-13 08:04:57,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:04:57,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:04:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:05:03,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:05:03,413 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:05:03,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020496303] [2021-10-13 08:05:03,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020496303] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:05:03,413 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:05:03,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-10-13 08:05:03,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943945512] [2021-10-13 08:05:03,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-10-13 08:05:03,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:05:03,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-10-13 08:05:03,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=973, Unknown=0, NotChecked=0, Total=1260 [2021-10-13 08:05:03,416 INFO L87 Difference]: Start difference. First operand 459 states and 533 transitions. Second operand has 36 states, 35 states have (on average 5.542857142857143) internal successors, (194), 35 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:05:05,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:05:05,397 INFO L93 Difference]: Finished difference Result 517 states and 550 transitions. [2021-10-13 08:05:05,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 08:05:05,399 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 5.542857142857143) internal successors, (194), 35 states have internal predecessors, (194), 0 states have call successors, (0), 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 194 [2021-10-13 08:05:05,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:05:05,401 INFO L225 Difference]: With dead ends: 517 [2021-10-13 08:05:05,401 INFO L226 Difference]: Without dead ends: 517 [2021-10-13 08:05:05,402 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 55 SyntacticMatches, 31 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 1073.9ms TimeCoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2021-10-13 08:05:05,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2021-10-13 08:05:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 464. [2021-10-13 08:05:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 362 states have (on average 1.4861878453038675) internal successors, (538), 463 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:05:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 538 transitions. [2021-10-13 08:05:05,411 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 538 transitions. Word has length 194 [2021-10-13 08:05:05,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:05:05,412 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 538 transitions. [2021-10-13 08:05:05,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 5.542857142857143) internal successors, (194), 35 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:05:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 538 transitions. [2021-10-13 08:05:05,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-10-13 08:05:05,414 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:05:05,415 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:05:05,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 08:05:05,415 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr450REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:05:05,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:05:05,416 INFO L82 PathProgramCache]: Analyzing trace with hash -793231668, now seen corresponding path program 1 times [2021-10-13 08:05:05,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:05:05,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695875694] [2021-10-13 08:05:05,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:05:05,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:05:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:05:05,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-13 08:05:05,550 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:05:05,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695875694] [2021-10-13 08:05:05,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695875694] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:05:05,550 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:05:05,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 08:05:05,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041028534] [2021-10-13 08:05:05,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 08:05:05,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:05:05,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 08:05:05,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:05:05,552 INFO L87 Difference]: Start difference. First operand 464 states and 538 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:05:05,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:05:05,566 INFO L93 Difference]: Finished difference Result 434 states and 456 transitions. [2021-10-13 08:05:05,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:05:05,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 195 [2021-10-13 08:05:05,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:05:05,569 INFO L225 Difference]: With dead ends: 434 [2021-10-13 08:05:05,569 INFO L226 Difference]: Without dead ends: 434 [2021-10-13 08:05:05,570 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:05:05,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-10-13 08:05:05,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 418. [2021-10-13 08:05:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 316 states have (on average 1.3924050632911393) internal successors, (440), 417 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:05:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 440 transitions. [2021-10-13 08:05:05,577 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 440 transitions. Word has length 195 [2021-10-13 08:05:05,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:05:05,578 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 440 transitions. [2021-10-13 08:05:05,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:05:05,578 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 440 transitions. [2021-10-13 08:05:05,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-10-13 08:05:05,580 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:05:05,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:05:05,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 08:05:05,581 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr398REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:05:05,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:05:05,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1724293752, now seen corresponding path program 1 times [2021-10-13 08:05:05,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:05:05,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462829531] [2021-10-13 08:05:05,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:05:05,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:05:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:05:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:05:17,660 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:05:17,660 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462829531] [2021-10-13 08:05:17,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462829531] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 08:05:17,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96380866] [2021-10-13 08:05:17,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:05:17,661 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 08:05:17,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 08:05:17,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 08:05:17,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 08:05:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:05:20,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 1373 conjuncts, 374 conjunts are in the unsatisfiable core [2021-10-13 08:05:20,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:05:20,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 08:05:20,323 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-10-13 08:05:20,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-10-13 08:05:20,651 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-13 08:05:20,773 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-13 08:05:20,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:20,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2021-10-13 08:05:20,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:20,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-10-13 08:05:20,945 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-13 08:05:21,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:21,136 INFO L354 Elim1Store]: treesize reduction 184, result has 14.8 percent of original size [2021-10-13 08:05:21,137 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 132 treesize of output 108 [2021-10-13 08:05:21,166 INFO L354 Elim1Store]: treesize reduction 76, result has 21.6 percent of original size [2021-10-13 08:05:21,166 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 104 [2021-10-13 08:05:21,483 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-10-13 08:05:21,485 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-13 08:05:21,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:21,690 INFO L354 Elim1Store]: treesize reduction 212, result has 12.8 percent of original size [2021-10-13 08:05:21,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 145 treesize of output 121 [2021-10-13 08:05:21,728 INFO L354 Elim1Store]: treesize reduction 140, result has 16.2 percent of original size [2021-10-13 08:05:21,729 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 142 treesize of output 118 [2021-10-13 08:05:22,322 INFO L354 Elim1Store]: treesize reduction 124, result has 15.6 percent of original size [2021-10-13 08:05:22,322 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 141 treesize of output 128 [2021-10-13 08:05:22,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:22,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:22,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:22,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:22,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:22,354 INFO L354 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2021-10-13 08:05:22,355 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 96 treesize of output 83 [2021-10-13 08:05:22,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:22,573 INFO L354 Elim1Store]: treesize reduction 212, result has 12.8 percent of original size [2021-10-13 08:05:22,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 128 [2021-10-13 08:05:22,607 INFO L354 Elim1Store]: treesize reduction 124, result has 15.6 percent of original size [2021-10-13 08:05:22,607 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 124 [2021-10-13 08:05:22,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 08:05:22,897 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-13 08:05:23,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:23,051 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 08:05:23,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:23,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:23,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:23,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:23,071 INFO L354 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2021-10-13 08:05:23,071 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 95 treesize of output 71 [2021-10-13 08:05:23,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:23,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:23,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:23,279 INFO L354 Elim1Store]: treesize reduction 93, result has 8.8 percent of original size [2021-10-13 08:05:23,280 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 124 treesize of output 72 [2021-10-13 08:05:23,481 INFO L354 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2021-10-13 08:05:23,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 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-13 08:05:23,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:23,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:23,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:23,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:23,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:23,738 INFO L354 Elim1Store]: treesize reduction 138, result has 19.8 percent of original size [2021-10-13 08:05:23,739 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 108 treesize of output 86 [2021-10-13 08:05:24,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:24,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:24,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:24,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:24,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:24,465 INFO L354 Elim1Store]: treesize reduction 138, result has 19.8 percent of original size [2021-10-13 08:05:24,465 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-13 08:05:24,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:24,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:24,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:24,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:24,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:24,685 INFO L354 Elim1Store]: treesize reduction 140, result has 18.6 percent of original size [2021-10-13 08:05:24,685 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-13 08:05:25,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:25,254 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 08:05:25,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:25,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:25,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:25,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:25,345 INFO L354 Elim1Store]: treesize reduction 276, result has 18.1 percent of original size [2021-10-13 08:05:25,345 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-13 08:05:25,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:25,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:25,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:25,680 INFO L354 Elim1Store]: treesize reduction 200, result has 8.7 percent of original size [2021-10-13 08:05:25,681 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-13 08:05:26,043 INFO L354 Elim1Store]: treesize reduction 148, result has 33.0 percent of original size [2021-10-13 08:05:26,043 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-13 08:05:26,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:26,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:26,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:26,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:26,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:26,357 INFO L354 Elim1Store]: treesize reduction 256, result has 11.4 percent of original size [2021-10-13 08:05:26,357 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-13 08:05:27,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:27,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:27,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:27,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:27,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:27,446 INFO L354 Elim1Store]: treesize reduction 256, result has 11.4 percent of original size [2021-10-13 08:05:27,446 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-13 08:05:27,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:27,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:27,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:27,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:27,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:27,931 INFO L354 Elim1Store]: treesize reduction 256, result has 11.4 percent of original size [2021-10-13 08:05:27,931 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-13 08:05:28,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:28,657 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 08:05:28,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:28,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:28,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:28,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:28,792 INFO L354 Elim1Store]: treesize reduction 388, result has 17.4 percent of original size [2021-10-13 08:05:28,792 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 236 treesize of output 166 [2021-10-13 08:05:29,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:29,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:29,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:29,605 INFO L354 Elim1Store]: treesize reduction 324, result has 8.0 percent of original size [2021-10-13 08:05:29,606 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 291 treesize of output 139 [2021-10-13 08:05:30,170 INFO L354 Elim1Store]: treesize reduction 270, result has 32.8 percent of original size [2021-10-13 08:05:30,171 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-13 08:05:30,272 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: No corresponding IProgramVar for |v_ULTIMATE.start_append_#t~mem62.offset_143| [2021-10-13 08:05:30,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [125948940] [2021-10-13 08:05:30,299 INFO L159 IcfgInterpreter]: Started Sifa with 196 locations of interest [2021-10-13 08:05:30,299 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 08:05:30,304 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-13 08:05:30,309 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-13 08:05:30,310 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-13 08:05:30,813 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:05:30,816 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 08:05:30,817 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:05:30,818 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-13 08:05:30,819 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 08:05:30,820 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:05:30,820 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-10-13 08:05:30,823 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-10-13 08:05:30,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:30,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:05:30,866 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-10-13 08:05:30,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 26 [2021-10-13 08:05:30,879 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:05:30,881 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-10-13 08:05:30,882 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:05:30,885 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-10-13 08:05:30,885 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-13 08:05:30,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 08:05:30,891 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:05:30,897 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:05:30,898 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 98 [2021-10-13 08:05:30,898 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-13 08:05:30,899 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:110, output treesize:98 [2021-10-13 08:05:30,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 08:05:31,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 08:05:31,100 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: No corresponding IProgramVar for |v_#length_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-13 08:05:31,103 INFO L168 Benchmark]: Toolchain (without parser) took 275834.07 ms. Allocated memory was 144.7 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 110.8 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 354.6 MB. Max. memory is 16.1 GB. [2021-10-13 08:05:31,103 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 96.5 MB. Free memory is still 50.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 08:05:31,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 569.81 ms. Allocated memory is still 144.7 MB. Free memory was 110.5 MB in the beginning and 109.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 08:05:31,104 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.63 ms. Allocated memory is still 144.7 MB. Free memory was 109.3 MB in the beginning and 104.4 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 08:05:31,104 INFO L168 Benchmark]: Boogie Preprocessor took 148.74 ms. Allocated memory is still 144.7 MB. Free memory was 104.0 MB in the beginning and 99.0 MB in the end (delta: 5.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 08:05:31,104 INFO L168 Benchmark]: RCFGBuilder took 2472.50 ms. Allocated memory is still 144.7 MB. Free memory was 99.0 MB in the beginning and 66.5 MB in the end (delta: 32.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 16.1 GB. [2021-10-13 08:05:31,105 INFO L168 Benchmark]: TraceAbstraction took 272532.47 ms. Allocated memory was 144.7 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 65.9 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 310.7 MB. Max. memory is 16.1 GB. [2021-10-13 08:05:31,106 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.23 ms. Allocated memory is still 96.5 MB. Free memory is still 50.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 569.81 ms. Allocated memory is still 144.7 MB. Free memory was 110.5 MB in the beginning and 109.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 100.63 ms. Allocated memory is still 144.7 MB. Free memory was 109.3 MB in the beginning and 104.4 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 148.74 ms. Allocated memory is still 144.7 MB. Free memory was 104.0 MB in the beginning and 99.0 MB in the end (delta: 5.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2472.50 ms. Allocated memory is still 144.7 MB. Free memory was 99.0 MB in the beginning and 66.5 MB in the end (delta: 32.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 272532.47 ms. Allocated memory was 144.7 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 65.9 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 310.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: No corresponding IProgramVar for |v_#length_706| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: No corresponding IProgramVar for |v_#length_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-13 08:05:31,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 08:05:33,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 08:05:33,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 08:05:33,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 08:05:33,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 08:05:33,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 08:05:33,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 08:05:33,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 08:05:33,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 08:05:33,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 08:05:33,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 08:05:33,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 08:05:33,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 08:05:33,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 08:05:33,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 08:05:33,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 08:05:33,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 08:05:33,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 08:05:33,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 08:05:33,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 08:05:33,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 08:05:33,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 08:05:33,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 08:05:33,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 08:05:33,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 08:05:33,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 08:05:33,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 08:05:33,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 08:05:33,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 08:05:33,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 08:05:33,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 08:05:33,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 08:05:33,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 08:05:33,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 08:05:33,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 08:05:33,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 08:05:33,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 08:05:33,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 08:05:33,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 08:05:33,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 08:05:33,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 08:05:33,531 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-10-13 08:05:33,577 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 08:05:33,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 08:05:33,579 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 08:05:33,579 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 08:05:33,579 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 08:05:33,579 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 08:05:33,580 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 08:05:33,580 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 08:05:33,580 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 08:05:33,581 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 08:05:33,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 08:05:33,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 08:05:33,583 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 08:05:33,583 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 08:05:33,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 08:05:33,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 08:05:33,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 08:05:33,584 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 08:05:33,584 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 08:05:33,585 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-13 08:05:33,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 08:05:33,585 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 08:05:33,585 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-13 08:05:33,585 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-13 08:05:33,586 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 08:05:33,586 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 08:05:33,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 08:05:33,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 08:05:33,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 08:05:33,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 08:05:33,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 08:05:33,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 08:05:33,588 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-13 08:05:33,588 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-13 08:05:33,588 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 08:05:33,589 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 08:05:33,589 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_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d0b5010c4e76c80e8e6103ea9fc77304c013c292 [2021-10-13 08:05:33,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 08:05:33,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 08:05:33,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 08:05:33,962 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 08:05:33,963 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 08:05:33,964 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2021-10-13 08:05:34,040 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/data/caeb68024/f65bdb7bc34b446aae8f95037e6962cc/FLAG428a5164f [2021-10-13 08:05:34,613 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 08:05:34,614 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2021-10-13 08:05:34,628 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/data/caeb68024/f65bdb7bc34b446aae8f95037e6962cc/FLAG428a5164f [2021-10-13 08:05:34,887 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/data/caeb68024/f65bdb7bc34b446aae8f95037e6962cc [2021-10-13 08:05:34,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 08:05:34,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 08:05:34,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 08:05:34,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 08:05:34,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 08:05:34,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:05:34" (1/1) ... [2021-10-13 08:05:34,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1b76e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:34, skipping insertion in model container [2021-10-13 08:05:34,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:05:34" (1/1) ... [2021-10-13 08:05:34,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 08:05:34,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 08:05:35,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 08:05:35,360 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 08:05:35,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 08:05:35,444 INFO L208 MainTranslator]: Completed translation [2021-10-13 08:05:35,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:35 WrapperNode [2021-10-13 08:05:35,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 08:05:35,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 08:05:35,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 08:05:35,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 08:05:35,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:35" (1/1) ... [2021-10-13 08:05:35,474 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:35" (1/1) ... [2021-10-13 08:05:35,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 08:05:35,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 08:05:35,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 08:05:35,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 08:05:35,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:35" (1/1) ... [2021-10-13 08:05:35,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:35" (1/1) ... [2021-10-13 08:05:35,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:35" (1/1) ... [2021-10-13 08:05:35,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:35" (1/1) ... [2021-10-13 08:05:35,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:35" (1/1) ... [2021-10-13 08:05:35,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:35" (1/1) ... [2021-10-13 08:05:35,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:35" (1/1) ... [2021-10-13 08:05:35,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 08:05:35,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 08:05:35,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 08:05:35,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 08:05:35,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:35" (1/1) ... [2021-10-13 08:05:35,652 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 08:05:35,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 08:05:35,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 08:05:35,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 08:05:35,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-10-13 08:05:35,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 08:05:35,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 08:05:35,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 08:05:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 08:05:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-10-13 08:05:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 08:05:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-13 08:05:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 08:05:35,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 08:05:39,551 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 08:05:39,554 INFO L299 CfgBuilder]: Removed 49 assume(true) statements. [2021-10-13 08:05:39,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:05:39 BoogieIcfgContainer [2021-10-13 08:05:39,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 08:05:39,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 08:05:39,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 08:05:39,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 08:05:39,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:05:34" (1/3) ... [2021-10-13 08:05:39,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bcbe3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:05:39, skipping insertion in model container [2021-10-13 08:05:39,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:35" (2/3) ... [2021-10-13 08:05:39,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bcbe3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:05:39, skipping insertion in model container [2021-10-13 08:05:39,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:05:39" (3/3) ... [2021-10-13 08:05:39,584 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-2.i [2021-10-13 08:05:39,589 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 08:05:39,590 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 511 error locations. [2021-10-13 08:05:39,635 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 08:05:39,644 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 08:05:39,644 INFO L340 AbstractCegarLoop]: Starting to check reachability of 511 error locations. [2021-10-13 08:05:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 947 states, 435 states have (on average 2.317241379310345) internal successors, (1008), 946 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:05:39,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 08:05:39,709 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:05:39,710 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 08:05:39,710 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:05:39,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:05:39,720 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-10-13 08:05:39,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:05:39,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718437710] [2021-10-13 08:05:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:05:39,734 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:05:39,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:05:39,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:05:39,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-13 08:05:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:05:39,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 08:05:39,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:05:39,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 08:05:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:05:39,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:05:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:05:40,035 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:05:40,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718437710] [2021-10-13 08:05:40,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718437710] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:05:40,036 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:05:40,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-13 08:05:40,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224646782] [2021-10-13 08:05:40,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 08:05:40,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:05:40,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 08:05:40,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:05:40,074 INFO L87 Difference]: Start difference. First operand has 947 states, 435 states have (on average 2.317241379310345) internal successors, (1008), 946 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:05:42,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:05:42,328 INFO L93 Difference]: Finished difference Result 1168 states and 1233 transitions. [2021-10-13 08:05:42,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:05:42,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-13 08:05:42,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:05:42,349 INFO L225 Difference]: With dead ends: 1168 [2021-10-13 08:05:42,349 INFO L226 Difference]: Without dead ends: 1166 [2021-10-13 08:05:42,350 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:05:42,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2021-10-13 08:05:42,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1030. [2021-10-13 08:05:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 522 states have (on average 2.2624521072796937) internal successors, (1181), 1029 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:05:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1181 transitions. [2021-10-13 08:05:42,462 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1181 transitions. Word has length 3 [2021-10-13 08:05:42,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:05:42,463 INFO L470 AbstractCegarLoop]: Abstraction has 1030 states and 1181 transitions. [2021-10-13 08:05:42,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:05:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1181 transitions. [2021-10-13 08:05:42,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 08:05:42,464 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:05:42,464 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 08:05:42,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-13 08:05:42,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:05:42,667 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:05:42,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:05:42,668 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-10-13 08:05:42,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:05:42,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646587341] [2021-10-13 08:05:42,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:05:42,669 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:05:42,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:05:42,670 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:05:42,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-13 08:05:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:05:42,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 08:05:42,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:05:42,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 08:05:42,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:05:42,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:05:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:05:42,855 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:05:42,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646587341] [2021-10-13 08:05:42,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646587341] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:05:42,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:05:42,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-13 08:05:42,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146983522] [2021-10-13 08:05:42,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 08:05:42,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:05:42,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 08:05:42,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 08:05:42,863 INFO L87 Difference]: Start difference. First operand 1030 states and 1181 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:05:47,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:05:47,302 INFO L93 Difference]: Finished difference Result 1081 states and 1237 transitions. [2021-10-13 08:05:47,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 08:05:47,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-13 08:05:47,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:05:47,309 INFO L225 Difference]: With dead ends: 1081 [2021-10-13 08:05:47,309 INFO L226 Difference]: Without dead ends: 1081 [2021-10-13 08:05:47,310 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 08:05:47,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2021-10-13 08:05:47,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1028. [2021-10-13 08:05:47,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 522 states have (on average 2.2586206896551726) internal successors, (1179), 1027 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:05:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1179 transitions. [2021-10-13 08:05:47,337 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1179 transitions. Word has length 3 [2021-10-13 08:05:47,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:05:47,337 INFO L470 AbstractCegarLoop]: Abstraction has 1028 states and 1179 transitions. [2021-10-13 08:05:47,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:05:47,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1179 transitions. [2021-10-13 08:05:47,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 08:05:47,338 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:05:47,339 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:05:47,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-13 08:05:47,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:05:47,554 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:05:47,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:05:47,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1837144844, now seen corresponding path program 1 times [2021-10-13 08:05:47,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:05:47,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837371269] [2021-10-13 08:05:47,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:05:47,569 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:05:47,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:05:47,570 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:05:47,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-13 08:05:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:05:47,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 08:05:47,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:05:47,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 08:05:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:05:47,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:05:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:05:47,718 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:05:47,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837371269] [2021-10-13 08:05:47,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837371269] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:05:47,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:05:47,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-13 08:05:47,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99131043] [2021-10-13 08:05:47,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 08:05:47,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:05:47,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 08:05:47,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:05:47,728 INFO L87 Difference]: Start difference. First operand 1028 states and 1179 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-13 08:05:49,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:05:49,760 INFO L93 Difference]: Finished difference Result 1092 states and 1158 transitions. [2021-10-13 08:05:49,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:05:49,760 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-13 08:05:49,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:05:49,766 INFO L225 Difference]: With dead ends: 1092 [2021-10-13 08:05:49,767 INFO L226 Difference]: Without dead ends: 1092 [2021-10-13 08:05:49,767 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:05:49,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2021-10-13 08:05:49,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 953. [2021-10-13 08:05:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 522 states have (on average 2.1149425287356323) internal successors, (1104), 952 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:05:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1104 transitions. [2021-10-13 08:05:49,790 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1104 transitions. Word has length 9 [2021-10-13 08:05:49,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:05:49,791 INFO L470 AbstractCegarLoop]: Abstraction has 953 states and 1104 transitions. [2021-10-13 08:05:49,791 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-13 08:05:49,791 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1104 transitions. [2021-10-13 08:05:49,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 08:05:49,792 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:05:49,792 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:05:49,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-10-13 08:05:50,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:05:50,002 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:05:50,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:05:50,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1837144845, now seen corresponding path program 1 times [2021-10-13 08:05:50,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:05:50,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113748144] [2021-10-13 08:05:50,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:05:50,004 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:05:50,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:05:50,006 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:05:50,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-13 08:05:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:05:50,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 08:05:50,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:05:50,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 08:05:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:05:50,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:05:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:05:50,201 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:05:50,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113748144] [2021-10-13 08:05:50,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113748144] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:05:50,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:05:50,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-13 08:05:50,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321341201] [2021-10-13 08:05:50,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 08:05:50,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:05:50,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 08:05:50,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 08:05:50,204 INFO L87 Difference]: Start difference. First operand 953 states and 1104 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-13 08:05:52,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:05:52,205 INFO L93 Difference]: Finished difference Result 881 states and 1033 transitions. [2021-10-13 08:05:52,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:05:52,206 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-13 08:05:52,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:05:52,210 INFO L225 Difference]: With dead ends: 881 [2021-10-13 08:05:52,210 INFO L226 Difference]: Without dead ends: 881 [2021-10-13 08:05:52,211 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 08:05:52,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2021-10-13 08:05:52,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 878. [2021-10-13 08:05:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 522 states have (on average 1.971264367816092) internal successors, (1029), 877 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:05:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1029 transitions. [2021-10-13 08:05:52,232 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1029 transitions. Word has length 9 [2021-10-13 08:05:52,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:05:52,232 INFO L470 AbstractCegarLoop]: Abstraction has 878 states and 1029 transitions. [2021-10-13 08:05:52,232 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-13 08:05:52,233 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1029 transitions. [2021-10-13 08:05:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 08:05:52,233 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:05:52,233 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:05:52,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-10-13 08:05:52,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:05:52,444 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:05:52,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:05:52,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1116915317, now seen corresponding path program 1 times [2021-10-13 08:05:52,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:05:52,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158734101] [2021-10-13 08:05:52,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:05:52,446 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:05:52,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:05:52,447 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:05:52,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-13 08:05:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:05:52,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 08:05:52,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:05:52,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 08:05:52,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 08:05:52,737 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-10-13 08:05:52,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2021-10-13 08:05:52,753 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-10-13 08:05:52,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2021-10-13 08:05:52,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:05:52,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:05:57,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:05:57,386 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:05:57,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158734101] [2021-10-13 08:05:57,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158734101] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:05:57,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:05:57,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-10-13 08:05:57,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608463474] [2021-10-13 08:05:57,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 08:05:57,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:05:57,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 08:05:57,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=17, Unknown=2, NotChecked=0, Total=30 [2021-10-13 08:05:57,388 INFO L87 Difference]: Start difference. First operand 878 states and 1029 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-13 08:06:22,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:06:22,680 INFO L93 Difference]: Finished difference Result 1139 states and 1219 transitions. [2021-10-13 08:06:22,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 08:06:22,681 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-13 08:06:22,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:06:22,687 INFO L225 Difference]: With dead ends: 1139 [2021-10-13 08:06:22,687 INFO L226 Difference]: Without dead ends: 1139 [2021-10-13 08:06:22,688 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 4498.8ms TimeCoverageRelationStatistics Valid=23, Invalid=31, Unknown=2, NotChecked=0, Total=56 [2021-10-13 08:06:22,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2021-10-13 08:06:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 772. [2021-10-13 08:06:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 522 states have (on average 1.7662835249042146) internal successors, (922), 771 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:06:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 922 transitions. [2021-10-13 08:06:22,708 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 922 transitions. Word has length 10 [2021-10-13 08:06:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:06:22,708 INFO L470 AbstractCegarLoop]: Abstraction has 772 states and 922 transitions. [2021-10-13 08:06:22,708 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-13 08:06:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 922 transitions. [2021-10-13 08:06:22,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 08:06:22,709 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:06:22,709 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:06:22,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-13 08:06:22,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:06:22,924 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:06:22,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:06:22,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1116915316, now seen corresponding path program 1 times [2021-10-13 08:06:22,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:06:22,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971494280] [2021-10-13 08:06:22,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:06:22,925 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:06:22,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:06:22,929 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:06:22,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-13 08:06:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:06:23,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-13 08:06:23,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:06:23,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 08:06:23,142 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 08:06:23,142 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 24 treesize of output 31 [2021-10-13 08:06:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:06:23,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:06:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:06:27,408 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:06:27,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971494280] [2021-10-13 08:06:27,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971494280] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:06:27,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:06:27,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-10-13 08:06:27,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393037281] [2021-10-13 08:06:27,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 08:06:27,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:06:27,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 08:06:27,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=17, Unknown=2, NotChecked=0, Total=30 [2021-10-13 08:06:27,410 INFO L87 Difference]: Start difference. First operand 772 states and 922 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-13 08:06:30,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:06:30,294 INFO L93 Difference]: Finished difference Result 805 states and 871 transitions. [2021-10-13 08:06:30,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 08:06:30,294 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-13 08:06:30,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:06:30,298 INFO L225 Difference]: With dead ends: 805 [2021-10-13 08:06:30,299 INFO L226 Difference]: Without dead ends: 805 [2021-10-13 08:06:30,299 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4100.1ms TimeCoverageRelationStatistics Valid=17, Invalid=23, Unknown=2, NotChecked=0, Total=42 [2021-10-13 08:06:30,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2021-10-13 08:06:30,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 667. [2021-10-13 08:06:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 522 states have (on average 1.5651340996168583) internal successors, (817), 666 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:06:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 817 transitions. [2021-10-13 08:06:30,315 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 817 transitions. Word has length 10 [2021-10-13 08:06:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:06:30,316 INFO L470 AbstractCegarLoop]: Abstraction has 667 states and 817 transitions. [2021-10-13 08:06:30,316 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-13 08:06:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 817 transitions. [2021-10-13 08:06:30,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 08:06:30,317 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:06:30,317 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:06:30,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-10-13 08:06:30,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:06:30,528 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:06:30,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:06:30,529 INFO L82 PathProgramCache]: Analyzing trace with hash 94393608, now seen corresponding path program 1 times [2021-10-13 08:06:30,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:06:30,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236485356] [2021-10-13 08:06:30,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:06:30,529 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:06:30,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:06:30,530 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:06:30,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-13 08:06:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:06:30,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-13 08:06:30,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:06:30,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 08:06:30,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-13 08:06:30,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-13 08:06:30,857 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-10-13 08:06:30,857 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-13 08:06:30,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:06:30,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-13 08:06:31,095 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-13 08:06:31,096 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 18 treesize of output 18 [2021-10-13 08:06:31,239 INFO L354 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2021-10-13 08:06:31,239 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-13 08:06:31,289 INFO L354 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2021-10-13 08:06:31,289 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-13 08:06:31,367 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-10-13 08:06:31,367 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-13 08:06:31,374 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-10-13 08:06:31,375 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-13 08:06:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:06:31,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:06:31,554 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:06:31,556 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-10-13 08:06:31,559 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:06:31,560 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-10-13 08:06:45,393 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_320 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_320)))) (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_320 (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_320) 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_320 (store (select .cse1 v_ULTIMATE.start_append_~node~0.base_320) 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-13 08:06:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:06:45,445 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:06:45,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236485356] [2021-10-13 08:06:45,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236485356] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:06:45,446 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:06:45,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 13 [2021-10-13 08:06:45,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587662135] [2021-10-13 08:06:45,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 08:06:45,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:06:45,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 08:06:45,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=4, NotChecked=20, Total=156 [2021-10-13 08:06:45,448 INFO L87 Difference]: Start difference. First operand 667 states and 817 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-13 08:06:47,522 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_append_~node~0.base_320 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_320)))) (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_320 (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_320) 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_320 (store (select .cse1 v_ULTIMATE.start_append_~node~0.base_320) 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-13 08:07:00,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:07:00,550 INFO L93 Difference]: Finished difference Result 821 states and 888 transitions. [2021-10-13 08:07:00,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 08:07:00,550 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-13 08:07:00,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:07:00,553 INFO L225 Difference]: With dead ends: 821 [2021-10-13 08:07:00,554 INFO L226 Difference]: Without dead ends: 821 [2021-10-13 08:07:00,554 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 15942.3ms TimeCoverageRelationStatistics Valid=78, Invalid=197, Unknown=5, NotChecked=62, Total=342 [2021-10-13 08:07:00,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2021-10-13 08:07:00,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 674. [2021-10-13 08:07:00,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 529 states have (on average 1.559546313799622) internal successors, (825), 673 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:07:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 825 transitions. [2021-10-13 08:07:00,570 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 825 transitions. Word has length 19 [2021-10-13 08:07:00,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:07:00,570 INFO L470 AbstractCegarLoop]: Abstraction has 674 states and 825 transitions. [2021-10-13 08:07:00,570 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-13 08:07:00,570 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 825 transitions. [2021-10-13 08:07:00,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 08:07:00,571 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:07:00,571 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-13 08:07:00,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-13 08:07:00,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:07:00,784 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:07:00,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:07:00,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1351113909, now seen corresponding path program 1 times [2021-10-13 08:07:00,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:07:00,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664776709] [2021-10-13 08:07:00,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:07:00,785 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:07:00,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:07:00,786 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:07:00,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-13 08:07:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:07:00,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 08:07:00,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:07:00,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 08:07:00,986 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-13 08:07:00,996 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-13 08:07:01,129 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-13 08:07:01,129 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-13 08:07:01,210 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-10-13 08:07:01,211 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-13 08:07:01,237 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-10-13 08:07:01,237 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-13 08:07:01,322 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-13 08:07:01,329 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-13 08:07:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:07:01,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:07:01,516 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:07:01,517 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-10-13 08:07:01,520 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:07:01,523 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-10-13 08:07:11,080 WARN L207 SmtUtils]: Spent 6.03 s on a formula simplification that was a NOOP. DAG size: 26 [2021-10-13 08:07:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:07:19,456 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:07:19,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664776709] [2021-10-13 08:07:19,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664776709] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:07:19,456 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:07:19,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2021-10-13 08:07:19,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269446072] [2021-10-13 08:07:19,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 08:07:19,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:07:19,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 08:07:19,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=64, Unknown=4, NotChecked=0, Total=90 [2021-10-13 08:07:19,458 INFO L87 Difference]: Start difference. First operand 674 states and 825 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-13 08:07:31,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:07:31,251 INFO L93 Difference]: Finished difference Result 814 states and 880 transitions. [2021-10-13 08:07:31,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 08:07:31,252 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-13 08:07:31,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:07:31,257 INFO L225 Difference]: With dead ends: 814 [2021-10-13 08:07:31,257 INFO L226 Difference]: Without dead ends: 814 [2021-10-13 08:07:31,257 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 19887.9ms TimeCoverageRelationStatistics Valid=61, Invalid=144, Unknown=5, NotChecked=0, Total=210 [2021-10-13 08:07:31,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2021-10-13 08:07:31,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 677. [2021-10-13 08:07:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 532 states have (on average 1.556390977443609) internal successors, (828), 676 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:07:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 828 transitions. [2021-10-13 08:07:31,274 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 828 transitions. Word has length 21 [2021-10-13 08:07:31,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:07:31,274 INFO L470 AbstractCegarLoop]: Abstraction has 677 states and 828 transitions. [2021-10-13 08:07:31,274 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-13 08:07:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 828 transitions. [2021-10-13 08:07:31,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-13 08:07:31,276 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:07:31,276 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-13 08:07:31,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-10-13 08:07:31,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:07:31,489 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 507 more)] === [2021-10-13 08:07:31,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:07:31,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1113089128, now seen corresponding path program 1 times [2021-10-13 08:07:31,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:07:31,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399886070] [2021-10-13 08:07:31,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:07:31,490 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:07:31,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:07:31,491 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:07:31,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-13 08:07:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:07:31,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 22 conjunts are in the unsatisfiable core [2021-10-13 08:07:31,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:07:31,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 08:07:31,852 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 08:07:31,853 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-13 08:07:32,316 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-13 08:07:32,392 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-13 08:07:32,595 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-13 08:07:32,595 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-13 08:07:32,853 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-10-13 08:07:32,853 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 50 treesize of output 73 [2021-10-13 08:07:33,136 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 08:07:33,137 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-13 08:07:33,805 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 08:07:33,806 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 87 treesize of output 71 [2021-10-13 08:07:34,109 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-13 08:07:34,110 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 100 treesize of output 84 [2021-10-13 08:07:34,348 INFO L354 Elim1Store]: treesize reduction 92, result has 1.1 percent of original size [2021-10-13 08:07:34,348 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-13 08:07:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:07:34,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:07:37,176 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:07:37,177 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-10-13 08:07:45,631 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_322 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_322))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_322 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_322 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_322) 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))))))))))))) is different from false [2021-10-13 08:07:47,748 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_251 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_322 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_322))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_322 (_ 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_322 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_322) v_ULTIMATE.start_append_~node~0.offset_251 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_251 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_251 (_ 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-13 08:07:49,803 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_251 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_322 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_322 (_ 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_322 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_322) v_ULTIMATE.start_append_~node~0.offset_251 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_251 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_251 (_ 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 (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_322))))))) is different from false [2021-10-13 08:07:49,836 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 351902 treesize of output 351134 [2021-10-13 08:07:51,370 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:07:51,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399886070] [2021-10-13 08:07:51,371 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 08:07:51,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1448893698] [2021-10-13 08:07:51,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:07:51,372 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 08:07:51,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 08:07:51,383 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 08:07:51,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2021-10-13 08:07:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:07:51,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 24 conjunts are in the unsatisfiable core [2021-10-13 08:07:51,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:07:51,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-13 08:07:51,983 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 08:07:51,983 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 24 treesize of output 31 [2021-10-13 08:07:52,575 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-13 08:07:52,795 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-13 08:07:53,045 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-13 08:07:53,045 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-13 08:07:53,344 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-10-13 08:07:53,345 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 41 treesize of output 64 [2021-10-13 08:07:53,674 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 08:07:53,674 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 63 [2021-10-13 08:07:54,291 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 08:07:54,292 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 88 treesize of output 72 [2021-10-13 08:07:54,697 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-13 08:07:54,698 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-13 08:07:55,068 INFO L354 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2021-10-13 08:07:55,068 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 114 treesize of output 75 [2021-10-13 08:07:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:07:55,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:07:57,566 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:07:57,567 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-10-13 08:08:05,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_323 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_323))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_323 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_323 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_323) 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-13 08:08:07,925 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_256 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_323 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_323 (_ 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_323 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_323) v_ULTIMATE.start_append_~node~0.offset_256 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_256 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_256 (_ 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 (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_323))))))) is different from false [2021-10-13 08:08:09,988 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_256 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_323 (_ 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_323 (_ 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_323 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_323) v_ULTIMATE.start_append_~node~0.offset_256 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_256 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_256 (_ 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 (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_323))))))) is different from false [2021-10-13 08:08:10,024 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 92306 treesize of output 92114 [2021-10-13 08:08:10,262 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 08:08:10,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920257304] [2021-10-13 08:08:10,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:08:10,263 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 08:08:10,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 08:08:10,275 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 08:08:10,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-13 08:08:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:08:10,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-13 08:08:10,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:08:10,712 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-13 08:08:10,713 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-13 08:08:11,274 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-13 08:08:11,308 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-13 08:08:11,421 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-13 08:08:11,421 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 65 treesize of output 46 [2021-10-13 08:08:11,613 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-10-13 08:08:11,614 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 42 treesize of output 65 [2021-10-13 08:08:11,943 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 08:08:11,943 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 65 [2021-10-13 08:08:12,710 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 08:08:12,711 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-13 08:08:13,076 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-13 08:08:13,076 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-13 08:08:13,325 INFO L354 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2021-10-13 08:08:13,326 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 114 treesize of output 75 [2021-10-13 08:08:13,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:08:13,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:08:13,691 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:08:13,692 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-10-13 08:08:27,935 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_324 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_324)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_324 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_324 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_324) 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-13 08:08:30,038 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.offset_261 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_324 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_324 (_ 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_324 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_324) v_ULTIMATE.start_append_~node~0.offset_261 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_261 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_261 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)))))))))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_324)))))) is different from false [2021-10-13 08:08:32,120 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_261 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem61.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_324 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_324 (_ 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_324 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_324) v_ULTIMATE.start_append_~node~0.offset_261 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_261 (_ bv1 32)) |ULTIMATE.start_append_#t~mem61.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_261 (_ 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_324)))))) is different from false [2021-10-13 08:08:32,139 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 23581 treesize of output 23533 [2021-10-13 08:08:32,211 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 08:08:32,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:08:32,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-10-13 08:08:32,212 ERROR L172 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2021-10-13 08:08:32,212 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-10-13 08:08:32,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-10-13 08:08:32,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-13 08:08:32,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-13 08:08:32,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-13 08:08:32,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-13 08:08:32,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-13 08:08:32,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-13 08:08:32,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-13 08:08:32,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-13 08:08:32,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-13 08:08:32,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-13 08:08:32,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-13 08:08:32,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-13 08:08:32,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-13 08:08:32,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-13 08:08:32,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-13 08:08:32,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-13 08:08:32,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-13 08:08:32,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-13 08:08:32,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-13 08:08:32,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-13 08:08:32,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-13 08:08:32,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-13 08:08:32,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-13 08:08:32,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-13 08:08:32,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-13 08:08:32,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-13 08:08:32,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-13 08:08:32,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-13 08:08:32,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-13 08:08:32,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-13 08:08:32,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-13 08:08:32,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-13 08:08:32,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-10-13 08:08:32,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-13 08:08:32,225 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-13 08:08:32,225 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-13 08:08:32,225 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-13 08:08:32,225 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-13 08:08:32,225 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-13 08:08:32,225 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-13 08:08:32,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-13 08:08:32,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-13 08:08:32,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-13 08:08:32,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-13 08:08:32,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-10-13 08:08:32,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-13 08:08:32,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-13 08:08:32,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-10-13 08:08:32,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-10-13 08:08:32,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-13 08:08:32,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-13 08:08:32,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-10-13 08:08:32,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-10-13 08:08:32,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-13 08:08:32,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-10-13 08:08:32,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-10-13 08:08:32,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION [2021-10-13 08:08:32,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-10-13 08:08:32,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-13 08:08:32,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-10-13 08:08:32,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION [2021-10-13 08:08:32,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION [2021-10-13 08:08:32,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-10-13 08:08:32,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION [2021-10-13 08:08:32,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-10-13 08:08:32,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION [2021-10-13 08:08:32,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION [2021-10-13 08:08:32,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION [2021-10-13 08:08:32,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION [2021-10-13 08:08:32,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION [2021-10-13 08:08:32,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-10-13 08:08:32,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION [2021-10-13 08:08:32,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION [2021-10-13 08:08:32,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-10-13 08:08:32,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION [2021-10-13 08:08:32,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATION [2021-10-13 08:08:32,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATION [2021-10-13 08:08:32,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION [2021-10-13 08:08:32,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION [2021-10-13 08:08:32,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATION [2021-10-13 08:08:32,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81REQUIRES_VIOLATION [2021-10-13 08:08:32,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATION [2021-10-13 08:08:32,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATION [2021-10-13 08:08:32,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATION [2021-10-13 08:08:32,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATION [2021-10-13 08:08:32,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATION [2021-10-13 08:08:32,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATION [2021-10-13 08:08:32,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATION [2021-10-13 08:08:32,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89REQUIRES_VIOLATION [2021-10-13 08:08:32,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATION [2021-10-13 08:08:32,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATION [2021-10-13 08:08:32,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92REQUIRES_VIOLATION [2021-10-13 08:08:32,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93REQUIRES_VIOLATION [2021-10-13 08:08:32,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94REQUIRES_VIOLATION [2021-10-13 08:08:32,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95REQUIRES_VIOLATION [2021-10-13 08:08:32,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96REQUIRES_VIOLATION [2021-10-13 08:08:32,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97REQUIRES_VIOLATION [2021-10-13 08:08:32,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98REQUIRES_VIOLATION [2021-10-13 08:08:32,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99REQUIRES_VIOLATION [2021-10-13 08:08:32,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100REQUIRES_VIOLATION [2021-10-13 08:08:32,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101REQUIRES_VIOLATION [2021-10-13 08:08:32,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102REQUIRES_VIOLATION [2021-10-13 08:08:32,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103REQUIRES_VIOLATION [2021-10-13 08:08:32,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104REQUIRES_VIOLATION [2021-10-13 08:08:32,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105REQUIRES_VIOLATION [2021-10-13 08:08:32,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106REQUIRES_VIOLATION [2021-10-13 08:08:32,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107REQUIRES_VIOLATION [2021-10-13 08:08:32,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108REQUIRES_VIOLATION [2021-10-13 08:08:32,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109REQUIRES_VIOLATION [2021-10-13 08:08:32,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110REQUIRES_VIOLATION [2021-10-13 08:08:32,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111REQUIRES_VIOLATION [2021-10-13 08:08:32,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112REQUIRES_VIOLATION [2021-10-13 08:08:32,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113REQUIRES_VIOLATION [2021-10-13 08:08:32,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114REQUIRES_VIOLATION [2021-10-13 08:08:32,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115REQUIRES_VIOLATION [2021-10-13 08:08:32,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116REQUIRES_VIOLATION [2021-10-13 08:08:32,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117REQUIRES_VIOLATION [2021-10-13 08:08:32,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118REQUIRES_VIOLATION [2021-10-13 08:08:32,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119REQUIRES_VIOLATION [2021-10-13 08:08:32,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120REQUIRES_VIOLATION [2021-10-13 08:08:32,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121REQUIRES_VIOLATION [2021-10-13 08:08:32,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122REQUIRES_VIOLATION [2021-10-13 08:08:32,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123REQUIRES_VIOLATION [2021-10-13 08:08:32,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124REQUIRES_VIOLATION [2021-10-13 08:08:32,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125REQUIRES_VIOLATION [2021-10-13 08:08:32,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126REQUIRES_VIOLATION [2021-10-13 08:08:32,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127REQUIRES_VIOLATION [2021-10-13 08:08:32,241 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128REQUIRES_VIOLATION [2021-10-13 08:08:32,241 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129REQUIRES_VIOLATION [2021-10-13 08:08:32,241 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130REQUIRES_VIOLATION [2021-10-13 08:08:32,241 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131REQUIRES_VIOLATION [2021-10-13 08:08:32,241 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132REQUIRES_VIOLATION [2021-10-13 08:08:32,241 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133REQUIRES_VIOLATION [2021-10-13 08:08:32,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134REQUIRES_VIOLATION [2021-10-13 08:08:32,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135REQUIRES_VIOLATION [2021-10-13 08:08:32,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136REQUIRES_VIOLATION [2021-10-13 08:08:32,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137REQUIRES_VIOLATION [2021-10-13 08:08:32,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138REQUIRES_VIOLATION [2021-10-13 08:08:32,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139REQUIRES_VIOLATION [2021-10-13 08:08:32,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140REQUIRES_VIOLATION [2021-10-13 08:08:32,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141REQUIRES_VIOLATION [2021-10-13 08:08:32,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142REQUIRES_VIOLATION [2021-10-13 08:08:32,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143REQUIRES_VIOLATION [2021-10-13 08:08:32,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144REQUIRES_VIOLATION [2021-10-13 08:08:32,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145REQUIRES_VIOLATION [2021-10-13 08:08:32,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr146REQUIRES_VIOLATION [2021-10-13 08:08:32,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr147REQUIRES_VIOLATION [2021-10-13 08:08:32,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr148REQUIRES_VIOLATION [2021-10-13 08:08:32,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr149REQUIRES_VIOLATION [2021-10-13 08:08:32,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr150REQUIRES_VIOLATION [2021-10-13 08:08:32,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr151REQUIRES_VIOLATION [2021-10-13 08:08:32,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr152REQUIRES_VIOLATION [2021-10-13 08:08:32,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr153REQUIRES_VIOLATION [2021-10-13 08:08:32,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr154REQUIRES_VIOLATION [2021-10-13 08:08:32,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr155REQUIRES_VIOLATION [2021-10-13 08:08:32,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr156REQUIRES_VIOLATION [2021-10-13 08:08:32,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr157REQUIRES_VIOLATION [2021-10-13 08:08:32,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr158REQUIRES_VIOLATION [2021-10-13 08:08:32,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr159REQUIRES_VIOLATION [2021-10-13 08:08:32,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr160REQUIRES_VIOLATION [2021-10-13 08:08:32,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr161REQUIRES_VIOLATION [2021-10-13 08:08:32,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr162REQUIRES_VIOLATION [2021-10-13 08:08:32,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr163REQUIRES_VIOLATION [2021-10-13 08:08:32,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr164REQUIRES_VIOLATION [2021-10-13 08:08:32,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr165REQUIRES_VIOLATION [2021-10-13 08:08:32,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr166REQUIRES_VIOLATION [2021-10-13 08:08:32,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr167REQUIRES_VIOLATION [2021-10-13 08:08:32,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr168REQUIRES_VIOLATION [2021-10-13 08:08:32,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr169REQUIRES_VIOLATION [2021-10-13 08:08:32,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr170REQUIRES_VIOLATION [2021-10-13 08:08:32,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr171REQUIRES_VIOLATION [2021-10-13 08:08:32,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr172REQUIRES_VIOLATION [2021-10-13 08:08:32,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr173REQUIRES_VIOLATION [2021-10-13 08:08:32,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr174REQUIRES_VIOLATION [2021-10-13 08:08:32,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr175REQUIRES_VIOLATION [2021-10-13 08:08:32,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr176REQUIRES_VIOLATION [2021-10-13 08:08:32,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr177REQUIRES_VIOLATION [2021-10-13 08:08:32,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr178REQUIRES_VIOLATION [2021-10-13 08:08:32,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr179REQUIRES_VIOLATION [2021-10-13 08:08:32,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr180REQUIRES_VIOLATION [2021-10-13 08:08:32,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr181REQUIRES_VIOLATION [2021-10-13 08:08:32,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr182REQUIRES_VIOLATION [2021-10-13 08:08:32,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr183REQUIRES_VIOLATION [2021-10-13 08:08:32,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr184REQUIRES_VIOLATION [2021-10-13 08:08:32,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr185REQUIRES_VIOLATION [2021-10-13 08:08:32,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr186REQUIRES_VIOLATION [2021-10-13 08:08:32,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr187REQUIRES_VIOLATION [2021-10-13 08:08:32,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr188REQUIRES_VIOLATION [2021-10-13 08:08:32,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr189REQUIRES_VIOLATION [2021-10-13 08:08:32,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr190REQUIRES_VIOLATION [2021-10-13 08:08:32,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr191REQUIRES_VIOLATION [2021-10-13 08:08:32,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr192REQUIRES_VIOLATION [2021-10-13 08:08:32,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr193REQUIRES_VIOLATION [2021-10-13 08:08:32,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr194REQUIRES_VIOLATION [2021-10-13 08:08:32,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr195REQUIRES_VIOLATION [2021-10-13 08:08:32,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr196REQUIRES_VIOLATION [2021-10-13 08:08:32,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr197REQUIRES_VIOLATION [2021-10-13 08:08:32,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr198REQUIRES_VIOLATION [2021-10-13 08:08:32,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr199REQUIRES_VIOLATION [2021-10-13 08:08:32,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr200REQUIRES_VIOLATION [2021-10-13 08:08:32,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr201REQUIRES_VIOLATION [2021-10-13 08:08:32,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr202REQUIRES_VIOLATION [2021-10-13 08:08:32,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr203REQUIRES_VIOLATION [2021-10-13 08:08:32,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr204REQUIRES_VIOLATION [2021-10-13 08:08:32,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr205REQUIRES_VIOLATION [2021-10-13 08:08:32,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr206REQUIRES_VIOLATION [2021-10-13 08:08:32,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr207REQUIRES_VIOLATION [2021-10-13 08:08:32,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr208REQUIRES_VIOLATION [2021-10-13 08:08:32,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr209REQUIRES_VIOLATION [2021-10-13 08:08:32,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr210REQUIRES_VIOLATION [2021-10-13 08:08:32,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr211REQUIRES_VIOLATION [2021-10-13 08:08:32,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr212REQUIRES_VIOLATION [2021-10-13 08:08:32,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr213REQUIRES_VIOLATION [2021-10-13 08:08:32,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr214REQUIRES_VIOLATION [2021-10-13 08:08:32,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr215REQUIRES_VIOLATION [2021-10-13 08:08:32,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr216REQUIRES_VIOLATION [2021-10-13 08:08:32,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr217REQUIRES_VIOLATION [2021-10-13 08:08:32,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr218REQUIRES_VIOLATION [2021-10-13 08:08:32,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr219REQUIRES_VIOLATION [2021-10-13 08:08:32,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr220REQUIRES_VIOLATION [2021-10-13 08:08:32,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr221REQUIRES_VIOLATION [2021-10-13 08:08:32,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr222REQUIRES_VIOLATION [2021-10-13 08:08:32,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr223REQUIRES_VIOLATION [2021-10-13 08:08:32,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr224REQUIRES_VIOLATION [2021-10-13 08:08:32,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr225REQUIRES_VIOLATION [2021-10-13 08:08:32,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr226REQUIRES_VIOLATION [2021-10-13 08:08:32,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr227REQUIRES_VIOLATION [2021-10-13 08:08:32,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr228REQUIRES_VIOLATION [2021-10-13 08:08:32,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr229REQUIRES_VIOLATION [2021-10-13 08:08:32,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr230REQUIRES_VIOLATION [2021-10-13 08:08:32,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr231REQUIRES_VIOLATION [2021-10-13 08:08:32,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr232REQUIRES_VIOLATION [2021-10-13 08:08:32,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr233REQUIRES_VIOLATION [2021-10-13 08:08:32,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr234REQUIRES_VIOLATION [2021-10-13 08:08:32,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr235REQUIRES_VIOLATION [2021-10-13 08:08:32,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr236REQUIRES_VIOLATION [2021-10-13 08:08:32,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr237REQUIRES_VIOLATION [2021-10-13 08:08:32,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr238REQUIRES_VIOLATION [2021-10-13 08:08:32,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr239REQUIRES_VIOLATION [2021-10-13 08:08:32,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr240REQUIRES_VIOLATION [2021-10-13 08:08:32,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr241REQUIRES_VIOLATION [2021-10-13 08:08:32,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr242REQUIRES_VIOLATION [2021-10-13 08:08:32,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr243REQUIRES_VIOLATION [2021-10-13 08:08:32,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr244REQUIRES_VIOLATION [2021-10-13 08:08:32,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr245REQUIRES_VIOLATION [2021-10-13 08:08:32,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr246REQUIRES_VIOLATION [2021-10-13 08:08:32,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr247REQUIRES_VIOLATION [2021-10-13 08:08:32,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr248REQUIRES_VIOLATION [2021-10-13 08:08:32,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr249REQUIRES_VIOLATION [2021-10-13 08:08:32,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr250REQUIRES_VIOLATION [2021-10-13 08:08:32,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr251REQUIRES_VIOLATION [2021-10-13 08:08:32,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr252REQUIRES_VIOLATION [2021-10-13 08:08:32,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr253REQUIRES_VIOLATION [2021-10-13 08:08:32,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr254REQUIRES_VIOLATION [2021-10-13 08:08:32,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr255REQUIRES_VIOLATION [2021-10-13 08:08:32,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr256REQUIRES_VIOLATION [2021-10-13 08:08:32,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr257REQUIRES_VIOLATION [2021-10-13 08:08:32,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr258REQUIRES_VIOLATION [2021-10-13 08:08:32,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr259REQUIRES_VIOLATION [2021-10-13 08:08:32,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr260REQUIRES_VIOLATION [2021-10-13 08:08:32,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr261REQUIRES_VIOLATION [2021-10-13 08:08:32,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr262REQUIRES_VIOLATION [2021-10-13 08:08:32,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr263REQUIRES_VIOLATION [2021-10-13 08:08:32,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr264REQUIRES_VIOLATION [2021-10-13 08:08:32,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr265REQUIRES_VIOLATION [2021-10-13 08:08:32,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr266REQUIRES_VIOLATION [2021-10-13 08:08:32,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr267REQUIRES_VIOLATION [2021-10-13 08:08:32,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr268REQUIRES_VIOLATION [2021-10-13 08:08:32,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr269REQUIRES_VIOLATION [2021-10-13 08:08:32,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr270REQUIRES_VIOLATION [2021-10-13 08:08:32,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr271REQUIRES_VIOLATION [2021-10-13 08:08:32,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr272REQUIRES_VIOLATION [2021-10-13 08:08:32,257 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr273REQUIRES_VIOLATION [2021-10-13 08:08:32,257 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr274REQUIRES_VIOLATION [2021-10-13 08:08:32,257 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr275REQUIRES_VIOLATION [2021-10-13 08:08:32,257 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr276REQUIRES_VIOLATION [2021-10-13 08:08:32,257 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr277REQUIRES_VIOLATION [2021-10-13 08:08:32,257 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr278REQUIRES_VIOLATION [2021-10-13 08:08:32,258 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr279REQUIRES_VIOLATION [2021-10-13 08:08:32,258 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr280REQUIRES_VIOLATION [2021-10-13 08:08:32,258 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr281REQUIRES_VIOLATION [2021-10-13 08:08:32,258 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr282REQUIRES_VIOLATION [2021-10-13 08:08:32,258 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr283REQUIRES_VIOLATION [2021-10-13 08:08:32,258 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr284REQUIRES_VIOLATION [2021-10-13 08:08:32,259 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr285REQUIRES_VIOLATION [2021-10-13 08:08:32,259 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr286REQUIRES_VIOLATION [2021-10-13 08:08:32,259 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr287REQUIRES_VIOLATION [2021-10-13 08:08:32,259 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr288REQUIRES_VIOLATION [2021-10-13 08:08:32,259 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr289REQUIRES_VIOLATION [2021-10-13 08:08:32,259 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr290REQUIRES_VIOLATION [2021-10-13 08:08:32,260 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr291REQUIRES_VIOLATION [2021-10-13 08:08:32,260 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr292REQUIRES_VIOLATION [2021-10-13 08:08:32,260 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr293REQUIRES_VIOLATION [2021-10-13 08:08:32,260 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr294REQUIRES_VIOLATION [2021-10-13 08:08:32,260 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr295REQUIRES_VIOLATION [2021-10-13 08:08:32,260 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr296REQUIRES_VIOLATION [2021-10-13 08:08:32,261 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr297REQUIRES_VIOLATION [2021-10-13 08:08:32,261 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr298REQUIRES_VIOLATION [2021-10-13 08:08:32,261 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr299REQUIRES_VIOLATION [2021-10-13 08:08:32,261 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr300REQUIRES_VIOLATION [2021-10-13 08:08:32,261 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr301REQUIRES_VIOLATION [2021-10-13 08:08:32,261 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr302REQUIRES_VIOLATION [2021-10-13 08:08:32,262 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr303REQUIRES_VIOLATION [2021-10-13 08:08:32,262 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr304REQUIRES_VIOLATION [2021-10-13 08:08:32,262 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr305REQUIRES_VIOLATION [2021-10-13 08:08:32,262 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr306REQUIRES_VIOLATION [2021-10-13 08:08:32,262 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr307REQUIRES_VIOLATION [2021-10-13 08:08:32,262 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr308REQUIRES_VIOLATION [2021-10-13 08:08:32,263 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr309REQUIRES_VIOLATION [2021-10-13 08:08:32,263 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr310REQUIRES_VIOLATION [2021-10-13 08:08:32,263 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr311REQUIRES_VIOLATION [2021-10-13 08:08:32,263 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr312REQUIRES_VIOLATION [2021-10-13 08:08:32,263 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr313REQUIRES_VIOLATION [2021-10-13 08:08:32,263 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr314REQUIRES_VIOLATION [2021-10-13 08:08:32,264 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr315REQUIRES_VIOLATION [2021-10-13 08:08:32,264 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr316REQUIRES_VIOLATION [2021-10-13 08:08:32,264 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr317REQUIRES_VIOLATION [2021-10-13 08:08:32,264 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr318REQUIRES_VIOLATION [2021-10-13 08:08:32,264 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr319REQUIRES_VIOLATION [2021-10-13 08:08:32,264 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr320REQUIRES_VIOLATION [2021-10-13 08:08:32,265 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr321REQUIRES_VIOLATION [2021-10-13 08:08:32,265 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr322REQUIRES_VIOLATION [2021-10-13 08:08:32,265 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr323REQUIRES_VIOLATION [2021-10-13 08:08:32,265 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr324REQUIRES_VIOLATION [2021-10-13 08:08:32,265 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr325REQUIRES_VIOLATION [2021-10-13 08:08:32,265 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr326REQUIRES_VIOLATION [2021-10-13 08:08:32,266 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr327REQUIRES_VIOLATION [2021-10-13 08:08:32,266 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr328REQUIRES_VIOLATION [2021-10-13 08:08:32,266 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr329REQUIRES_VIOLATION [2021-10-13 08:08:32,266 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr330REQUIRES_VIOLATION [2021-10-13 08:08:32,266 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr331REQUIRES_VIOLATION [2021-10-13 08:08:32,266 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr332REQUIRES_VIOLATION [2021-10-13 08:08:32,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr333REQUIRES_VIOLATION [2021-10-13 08:08:32,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr334REQUIRES_VIOLATION [2021-10-13 08:08:32,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr335REQUIRES_VIOLATION [2021-10-13 08:08:32,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr336REQUIRES_VIOLATION [2021-10-13 08:08:32,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr337REQUIRES_VIOLATION [2021-10-13 08:08:32,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr338REQUIRES_VIOLATION [2021-10-13 08:08:32,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr339REQUIRES_VIOLATION [2021-10-13 08:08:32,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr340REQUIRES_VIOLATION [2021-10-13 08:08:32,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr341REQUIRES_VIOLATION [2021-10-13 08:08:32,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr342REQUIRES_VIOLATION [2021-10-13 08:08:32,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr343REQUIRES_VIOLATION [2021-10-13 08:08:32,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr344REQUIRES_VIOLATION [2021-10-13 08:08:32,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr345REQUIRES_VIOLATION [2021-10-13 08:08:32,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr346REQUIRES_VIOLATION [2021-10-13 08:08:32,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr347REQUIRES_VIOLATION [2021-10-13 08:08:32,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr348REQUIRES_VIOLATION [2021-10-13 08:08:32,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr349REQUIRES_VIOLATION [2021-10-13 08:08:32,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr350REQUIRES_VIOLATION [2021-10-13 08:08:32,270 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr351REQUIRES_VIOLATION [2021-10-13 08:08:32,270 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr352REQUIRES_VIOLATION [2021-10-13 08:08:32,270 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr353REQUIRES_VIOLATION [2021-10-13 08:08:32,270 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr354REQUIRES_VIOLATION [2021-10-13 08:08:32,270 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr355REQUIRES_VIOLATION [2021-10-13 08:08:32,270 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr356REQUIRES_VIOLATION [2021-10-13 08:08:32,271 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr357REQUIRES_VIOLATION [2021-10-13 08:08:32,271 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr358REQUIRES_VIOLATION [2021-10-13 08:08:32,271 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr359REQUIRES_VIOLATION [2021-10-13 08:08:32,271 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr360REQUIRES_VIOLATION [2021-10-13 08:08:32,271 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr361REQUIRES_VIOLATION [2021-10-13 08:08:32,271 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr362REQUIRES_VIOLATION [2021-10-13 08:08:32,272 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr363REQUIRES_VIOLATION [2021-10-13 08:08:32,272 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr364REQUIRES_VIOLATION [2021-10-13 08:08:32,272 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr365REQUIRES_VIOLATION [2021-10-13 08:08:32,272 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr366REQUIRES_VIOLATION [2021-10-13 08:08:32,272 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr367REQUIRES_VIOLATION [2021-10-13 08:08:32,272 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr368REQUIRES_VIOLATION [2021-10-13 08:08:32,273 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr369REQUIRES_VIOLATION [2021-10-13 08:08:32,273 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr370REQUIRES_VIOLATION [2021-10-13 08:08:32,273 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr371REQUIRES_VIOLATION [2021-10-13 08:08:32,273 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr372REQUIRES_VIOLATION [2021-10-13 08:08:32,273 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr373REQUIRES_VIOLATION [2021-10-13 08:08:32,273 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr374REQUIRES_VIOLATION [2021-10-13 08:08:32,274 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr375REQUIRES_VIOLATION [2021-10-13 08:08:32,274 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr376REQUIRES_VIOLATION [2021-10-13 08:08:32,274 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr377REQUIRES_VIOLATION [2021-10-13 08:08:32,274 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr378REQUIRES_VIOLATION [2021-10-13 08:08:32,274 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr379REQUIRES_VIOLATION [2021-10-13 08:08:32,274 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr380REQUIRES_VIOLATION [2021-10-13 08:08:32,275 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr381REQUIRES_VIOLATION [2021-10-13 08:08:32,275 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr382REQUIRES_VIOLATION [2021-10-13 08:08:32,275 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr383REQUIRES_VIOLATION [2021-10-13 08:08:32,275 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr384REQUIRES_VIOLATION [2021-10-13 08:08:32,275 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr385REQUIRES_VIOLATION [2021-10-13 08:08:32,276 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr386REQUIRES_VIOLATION [2021-10-13 08:08:32,276 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr387REQUIRES_VIOLATION [2021-10-13 08:08:32,276 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr388REQUIRES_VIOLATION [2021-10-13 08:08:32,276 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr389REQUIRES_VIOLATION [2021-10-13 08:08:32,276 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr390REQUIRES_VIOLATION [2021-10-13 08:08:32,276 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr391REQUIRES_VIOLATION [2021-10-13 08:08:32,277 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr392REQUIRES_VIOLATION [2021-10-13 08:08:32,277 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr393REQUIRES_VIOLATION [2021-10-13 08:08:32,277 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr394REQUIRES_VIOLATION [2021-10-13 08:08:32,277 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr395REQUIRES_VIOLATION [2021-10-13 08:08:32,277 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr396REQUIRES_VIOLATION [2021-10-13 08:08:32,277 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr397REQUIRES_VIOLATION [2021-10-13 08:08:32,278 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr398REQUIRES_VIOLATION [2021-10-13 08:08:32,278 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr399REQUIRES_VIOLATION [2021-10-13 08:08:32,278 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr400REQUIRES_VIOLATION [2021-10-13 08:08:32,278 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr401REQUIRES_VIOLATION [2021-10-13 08:08:32,278 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr402REQUIRES_VIOLATION [2021-10-13 08:08:32,278 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr403REQUIRES_VIOLATION [2021-10-13 08:08:32,279 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr404REQUIRES_VIOLATION [2021-10-13 08:08:32,279 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr405REQUIRES_VIOLATION [2021-10-13 08:08:32,279 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr406REQUIRES_VIOLATION [2021-10-13 08:08:32,279 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr407REQUIRES_VIOLATION [2021-10-13 08:08:32,279 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr408REQUIRES_VIOLATION [2021-10-13 08:08:32,279 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr409REQUIRES_VIOLATION [2021-10-13 08:08:32,280 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr410REQUIRES_VIOLATION [2021-10-13 08:08:32,280 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr411REQUIRES_VIOLATION [2021-10-13 08:08:32,280 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr412REQUIRES_VIOLATION [2021-10-13 08:08:32,280 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr413REQUIRES_VIOLATION [2021-10-13 08:08:32,280 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr414REQUIRES_VIOLATION [2021-10-13 08:08:32,280 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr415REQUIRES_VIOLATION [2021-10-13 08:08:32,281 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr416REQUIRES_VIOLATION [2021-10-13 08:08:32,281 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr417REQUIRES_VIOLATION [2021-10-13 08:08:32,281 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr418REQUIRES_VIOLATION [2021-10-13 08:08:32,281 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr419REQUIRES_VIOLATION [2021-10-13 08:08:32,281 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr420REQUIRES_VIOLATION [2021-10-13 08:08:32,281 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr421REQUIRES_VIOLATION [2021-10-13 08:08:32,282 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr422REQUIRES_VIOLATION [2021-10-13 08:08:32,282 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr423REQUIRES_VIOLATION [2021-10-13 08:08:32,282 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr424REQUIRES_VIOLATION [2021-10-13 08:08:32,282 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr425REQUIRES_VIOLATION [2021-10-13 08:08:32,282 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr426REQUIRES_VIOLATION [2021-10-13 08:08:32,282 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr427REQUIRES_VIOLATION [2021-10-13 08:08:32,282 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr428REQUIRES_VIOLATION [2021-10-13 08:08:32,283 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr429REQUIRES_VIOLATION [2021-10-13 08:08:32,283 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr430REQUIRES_VIOLATION [2021-10-13 08:08:32,283 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr431REQUIRES_VIOLATION [2021-10-13 08:08:32,283 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr432REQUIRES_VIOLATION [2021-10-13 08:08:32,283 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr433REQUIRES_VIOLATION [2021-10-13 08:08:32,283 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr434REQUIRES_VIOLATION [2021-10-13 08:08:32,284 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr435REQUIRES_VIOLATION [2021-10-13 08:08:32,284 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr436REQUIRES_VIOLATION [2021-10-13 08:08:32,284 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr437REQUIRES_VIOLATION [2021-10-13 08:08:32,284 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr438REQUIRES_VIOLATION [2021-10-13 08:08:32,284 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr439REQUIRES_VIOLATION [2021-10-13 08:08:32,284 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr440REQUIRES_VIOLATION [2021-10-13 08:08:32,285 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr441REQUIRES_VIOLATION [2021-10-13 08:08:32,285 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr442ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:08:32,285 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr443ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:08:32,285 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr444ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:08:32,285 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr445REQUIRES_VIOLATION [2021-10-13 08:08:32,286 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr446REQUIRES_VIOLATION [2021-10-13 08:08:32,286 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr447ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:08:32,286 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr448ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:08:32,286 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr449ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:08:32,286 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr450REQUIRES_VIOLATION [2021-10-13 08:08:32,286 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr451REQUIRES_VIOLATION [2021-10-13 08:08:32,287 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr452REQUIRES_VIOLATION [2021-10-13 08:08:32,287 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr453REQUIRES_VIOLATION [2021-10-13 08:08:32,287 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr454REQUIRES_VIOLATION [2021-10-13 08:08:32,287 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr455REQUIRES_VIOLATION [2021-10-13 08:08:32,287 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr456REQUIRES_VIOLATION [2021-10-13 08:08:32,287 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr457REQUIRES_VIOLATION [2021-10-13 08:08:32,288 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr458REQUIRES_VIOLATION [2021-10-13 08:08:32,288 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr459REQUIRES_VIOLATION [2021-10-13 08:08:32,288 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr460REQUIRES_VIOLATION [2021-10-13 08:08:32,288 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr461REQUIRES_VIOLATION [2021-10-13 08:08:32,288 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr462REQUIRES_VIOLATION [2021-10-13 08:08:32,288 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr463REQUIRES_VIOLATION [2021-10-13 08:08:32,288 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr464REQUIRES_VIOLATION [2021-10-13 08:08:32,289 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr465REQUIRES_VIOLATION [2021-10-13 08:08:32,289 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr466REQUIRES_VIOLATION [2021-10-13 08:08:32,289 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr467REQUIRES_VIOLATION [2021-10-13 08:08:32,289 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr468REQUIRES_VIOLATION [2021-10-13 08:08:32,289 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr469REQUIRES_VIOLATION [2021-10-13 08:08:32,289 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr470REQUIRES_VIOLATION [2021-10-13 08:08:32,290 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr471REQUIRES_VIOLATION [2021-10-13 08:08:32,290 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr472REQUIRES_VIOLATION [2021-10-13 08:08:32,290 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr473REQUIRES_VIOLATION [2021-10-13 08:08:32,290 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr474REQUIRES_VIOLATION [2021-10-13 08:08:32,290 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr475REQUIRES_VIOLATION [2021-10-13 08:08:32,290 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr476REQUIRES_VIOLATION [2021-10-13 08:08:32,291 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr477REQUIRES_VIOLATION [2021-10-13 08:08:32,291 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr478REQUIRES_VIOLATION [2021-10-13 08:08:32,291 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr479REQUIRES_VIOLATION [2021-10-13 08:08:32,291 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr480REQUIRES_VIOLATION [2021-10-13 08:08:32,291 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr481REQUIRES_VIOLATION [2021-10-13 08:08:32,291 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr482REQUIRES_VIOLATION [2021-10-13 08:08:32,291 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr483REQUIRES_VIOLATION [2021-10-13 08:08:32,292 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr484REQUIRES_VIOLATION [2021-10-13 08:08:32,292 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr485REQUIRES_VIOLATION [2021-10-13 08:08:32,292 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr486REQUIRES_VIOLATION [2021-10-13 08:08:32,292 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr487REQUIRES_VIOLATION [2021-10-13 08:08:32,292 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr488REQUIRES_VIOLATION [2021-10-13 08:08:32,292 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr489REQUIRES_VIOLATION [2021-10-13 08:08:32,293 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr490REQUIRES_VIOLATION [2021-10-13 08:08:32,293 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr491REQUIRES_VIOLATION [2021-10-13 08:08:32,293 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr492REQUIRES_VIOLATION [2021-10-13 08:08:32,293 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr493REQUIRES_VIOLATION [2021-10-13 08:08:32,293 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr494ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:08:32,293 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr495ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:08:32,294 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr496ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:08:32,294 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr497REQUIRES_VIOLATION [2021-10-13 08:08:32,294 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr498REQUIRES_VIOLATION [2021-10-13 08:08:32,294 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr499ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:08:32,294 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr500ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:08:32,295 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr501ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:08:32,295 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr502REQUIRES_VIOLATION [2021-10-13 08:08:32,295 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr503REQUIRES_VIOLATION [2021-10-13 08:08:32,295 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr504ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:08:32,295 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr505ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:08:32,295 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr506ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:08:32,296 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr507ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:08:32,296 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr508ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:08:32,296 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr509ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:08:32,296 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr510ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:08:32,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-13 08:08:32,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2021-10-13 08:08:32,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-10-13 08:08:32,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 08:08:32,920 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 08:08:32,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 08:08:32 BoogieIcfgContainer [2021-10-13 08:08:32,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 08:08:32,938 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 08:08:32,938 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 08:08:32,939 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 08:08:32,939 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:05:39" (3/4) ... [2021-10-13 08:08:32,942 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-13 08:08:32,943 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 08:08:32,943 INFO L168 Benchmark]: Toolchain (without parser) took 178052.04 ms. Allocated memory was 69.2 MB in the beginning and 176.2 MB in the end (delta: 107.0 MB). Free memory was 47.0 MB in the beginning and 78.8 MB in the end (delta: -31.8 MB). Peak memory consumption was 77.9 MB. Max. memory is 16.1 GB. [2021-10-13 08:08:32,944 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 69.2 MB. Free memory is still 49.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 08:08:32,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 552.63 ms. Allocated memory is still 69.2 MB. Free memory was 46.8 MB in the beginning and 42.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-13 08:08:32,944 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.97 ms. Allocated memory is still 69.2 MB. Free memory was 42.8 MB in the beginning and 37.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 08:08:32,945 INFO L168 Benchmark]: Boogie Preprocessor took 106.80 ms. Allocated memory is still 69.2 MB. Free memory was 37.6 MB in the beginning and 32.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 08:08:32,945 INFO L168 Benchmark]: RCFGBuilder took 3915.31 ms. Allocated memory was 69.2 MB in the beginning and 96.5 MB in the end (delta: 27.3 MB). Free memory was 32.2 MB in the beginning and 39.3 MB in the end (delta: -7.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 16.1 GB. [2021-10-13 08:08:32,946 INFO L168 Benchmark]: TraceAbstraction took 173375.33 ms. Allocated memory was 96.5 MB in the beginning and 176.2 MB in the end (delta: 79.7 MB). Free memory was 39.3 MB in the beginning and 78.8 MB in the end (delta: -39.5 MB). Peak memory consumption was 83.5 MB. Max. memory is 16.1 GB. [2021-10-13 08:08:32,946 INFO L168 Benchmark]: Witness Printer took 4.46 ms. Allocated memory is still 176.2 MB. Free memory is still 78.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 08:08:32,948 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.27 ms. Allocated memory is still 69.2 MB. Free memory is still 49.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 552.63 ms. Allocated memory is still 69.2 MB. Free memory was 46.8 MB in the beginning and 42.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 89.97 ms. Allocated memory is still 69.2 MB. Free memory was 42.8 MB in the beginning and 37.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 106.80 ms. Allocated memory is still 69.2 MB. Free memory was 37.6 MB in the beginning and 32.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3915.31 ms. Allocated memory was 69.2 MB in the beginning and 96.5 MB in the end (delta: 27.3 MB). Free memory was 32.2 MB in the beginning and 39.3 MB in the end (delta: -7.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 173375.33 ms. Allocated memory was 96.5 MB in the beginning and 176.2 MB in the end (delta: 79.7 MB). Free memory was 39.3 MB in the beginning and 78.8 MB in the end (delta: -39.5 MB). Peak memory consumption was 83.5 MB. Max. memory is 16.1 GB. * Witness Printer took 4.46 ms. Allocated memory is still 176.2 MB. Free memory is still 78.8 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: 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: 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: 612]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: 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: 614]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 621]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 621]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 621]: 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: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 626]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 626]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 626]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 635]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 635]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 636]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 636]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 636]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 639]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 639]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 639]: 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, 947 locations, 511 error locations. Started 1 CEGAR loops. OverallTime: 173280.5ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 32.1ms, AutomataDifference: 65901.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 37.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3257 SDtfs, 10078 SDslu, 4990 SDs, 0 SdLazy, 9053 SolverSat, 638 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 54593.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 44499.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1030occurred 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: 236.0ms AutomataMinimizationTime, 8 MinimizatonAttempts, 1120 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 84.2ms SsaConstructionTime, 315.2ms SatisfiabilityAnalysisTime, 42885.9ms InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 152 ConstructedInterpolants, 27 QuantifiedInterpolants, 1880 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-13 08:08:33,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13c980d3-1856-4e18-bc2c-1cc832415386/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...