./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/length_test03-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 57096758 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8a2a8c059e91938ad7ee96f17aa5eb207759b3b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8a2a8c059e91938ad7ee96f17aa5eb207759b3b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-5709675 [2021-10-16 02:29:53,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 02:29:53,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 02:29:54,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 02:29:54,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 02:29:54,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 02:29:54,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 02:29:54,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 02:29:54,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 02:29:54,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 02:29:54,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 02:29:54,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 02:29:54,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 02:29:54,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 02:29:54,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 02:29:54,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 02:29:54,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 02:29:54,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 02:29:54,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 02:29:54,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 02:29:54,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 02:29:54,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 02:29:54,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 02:29:54,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 02:29:54,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 02:29:54,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 02:29:54,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 02:29:54,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 02:29:54,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 02:29:54,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 02:29:54,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 02:29:54,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 02:29:54,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 02:29:54,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 02:29:54,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 02:29:54,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 02:29:54,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 02:29:54,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 02:29:54,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 02:29:54,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 02:29:54,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 02:29:54,139 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-10-16 02:29:54,190 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 02:29:54,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 02:29:54,192 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 02:29:54,192 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 02:29:54,192 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 02:29:54,193 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 02:29:54,193 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-16 02:29:54,193 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 02:29:54,193 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 02:29:54,194 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-16 02:29:54,195 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-16 02:29:54,195 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 02:29:54,195 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-16 02:29:54,196 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-16 02:29:54,196 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-16 02:29:54,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-16 02:29:54,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-16 02:29:54,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 02:29:54,198 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 02:29:54,198 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-16 02:29:54,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-16 02:29:54,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 02:29:54,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 02:29:54,199 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-16 02:29:54,199 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-16 02:29:54,199 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-16 02:29:54,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 02:29:54,201 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 02:29:54,201 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 02:29:54,202 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 02:29:54,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 02:29:54,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 02:29:54,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:29:54,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 02:29:54,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 02:29:54,203 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-16 02:29:54,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-16 02:29:54,204 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 02:29:54,204 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 02:29:54,204 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_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8a2a8c059e91938ad7ee96f17aa5eb207759b3b [2021-10-16 02:29:54,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 02:29:54,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 02:29:54,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 02:29:54,566 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 02:29:54,567 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 02:29:54,568 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/memsafety-ext2/length_test03-1.i [2021-10-16 02:29:54,666 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/data/2e8f42f10/24696f74b49841219459d35f8619fc58/FLAG478eb6c26 [2021-10-16 02:29:55,357 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 02:29:55,358 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/sv-benchmarks/c/memsafety-ext2/length_test03-1.i [2021-10-16 02:29:55,386 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/data/2e8f42f10/24696f74b49841219459d35f8619fc58/FLAG478eb6c26 [2021-10-16 02:29:55,596 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/data/2e8f42f10/24696f74b49841219459d35f8619fc58 [2021-10-16 02:29:55,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 02:29:55,602 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 02:29:55,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 02:29:55,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 02:29:55,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 02:29:55,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:29:55" (1/1) ... [2021-10-16 02:29:55,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794fbf8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:29:55, skipping insertion in model container [2021-10-16 02:29:55,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:29:55" (1/1) ... [2021-10-16 02:29:55,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 02:29:55,687 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 02:29:56,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:29:56,203 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 02:29:56,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:29:56,308 INFO L208 MainTranslator]: Completed translation [2021-10-16 02:29:56,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:29:56 WrapperNode [2021-10-16 02:29:56,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 02:29:56,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 02:29:56,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 02:29:56,311 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 02:29:56,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:29:56" (1/1) ... [2021-10-16 02:29:56,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:29:56" (1/1) ... [2021-10-16 02:29:56,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 02:29:56,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 02:29:56,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 02:29:56,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 02:29:56,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:29:56" (1/1) ... [2021-10-16 02:29:56,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:29:56" (1/1) ... [2021-10-16 02:29:56,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:29:56" (1/1) ... [2021-10-16 02:29:56,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:29:56" (1/1) ... [2021-10-16 02:29:56,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:29:56" (1/1) ... [2021-10-16 02:29:56,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:29:56" (1/1) ... [2021-10-16 02:29:56,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:29:56" (1/1) ... [2021-10-16 02:29:56,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 02:29:56,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 02:29:56,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 02:29:56,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 02:29:56,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:29:56" (1/1) ... [2021-10-16 02:29:56,493 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:29:56,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:29:56,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 02:29:56,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 02:29:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-16 02:29:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-16 02:29:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-16 02:29:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 02:29:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-16 02:29:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-16 02:29:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-16 02:29:56,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 02:29:56,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 02:29:57,676 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 02:29:57,676 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2021-10-16 02:29:57,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:29:57 BoogieIcfgContainer [2021-10-16 02:29:57,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 02:29:57,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 02:29:57,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 02:29:57,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 02:29:57,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:29:55" (1/3) ... [2021-10-16 02:29:57,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e834a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:29:57, skipping insertion in model container [2021-10-16 02:29:57,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:29:56" (2/3) ... [2021-10-16 02:29:57,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e834a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:29:57, skipping insertion in model container [2021-10-16 02:29:57,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:29:57" (3/3) ... [2021-10-16 02:29:57,691 INFO L111 eAbstractionObserver]: Analyzing ICFG length_test03-1.i [2021-10-16 02:29:57,705 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 02:29:57,706 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 85 error locations. [2021-10-16 02:29:57,754 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 02:29:57,762 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-16 02:29:57,762 INFO L340 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2021-10-16 02:29:57,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 62 states have (on average 2.5161290322580645) internal successors, (156), 147 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:29:57,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-16 02:29:57,791 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:29:57,792 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-16 02:29:57,793 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:29:57,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:29:57,800 INFO L82 PathProgramCache]: Analyzing trace with hash 8405, now seen corresponding path program 1 times [2021-10-16 02:29:57,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:29:57,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218661723] [2021-10-16 02:29:57,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:29:57,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:29:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:29:58,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:29:58,025 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:29:58,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218661723] [2021-10-16 02:29:58,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218661723] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:29:58,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:29:58,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-16 02:29:58,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202537686] [2021-10-16 02:29:58,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:29:58,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:29:58,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:29:58,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:29:58,072 INFO L87 Difference]: Start difference. First operand has 148 states, 62 states have (on average 2.5161290322580645) internal successors, (156), 147 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:29:58,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:29:58,365 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2021-10-16 02:29:58,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:29:58,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-16 02:29:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:29:58,389 INFO L225 Difference]: With dead ends: 177 [2021-10-16 02:29:58,389 INFO L226 Difference]: Without dead ends: 176 [2021-10-16 02:29:58,392 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:29:58,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-10-16 02:29:58,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 144. [2021-10-16 02:29:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 62 states have (on average 2.435483870967742) internal successors, (151), 143 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:29:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 151 transitions. [2021-10-16 02:29:58,468 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 151 transitions. Word has length 2 [2021-10-16 02:29:58,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:29:58,470 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 151 transitions. [2021-10-16 02:29:58,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:29:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 151 transitions. [2021-10-16 02:29:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-16 02:29:58,471 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:29:58,471 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-16 02:29:58,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-16 02:29:58,472 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:29:58,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:29:58,476 INFO L82 PathProgramCache]: Analyzing trace with hash 8406, now seen corresponding path program 1 times [2021-10-16 02:29:58,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:29:58,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341223715] [2021-10-16 02:29:58,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:29:58,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:29:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:29:58,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:29:58,566 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:29:58,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341223715] [2021-10-16 02:29:58,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341223715] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:29:58,567 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:29:58,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-16 02:29:58,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720843518] [2021-10-16 02:29:58,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:29:58,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:29:58,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:29:58,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:29:58,574 INFO L87 Difference]: Start difference. First operand 144 states and 151 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:29:58,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:29:58,803 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2021-10-16 02:29:58,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:29:58,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-16 02:29:58,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:29:58,809 INFO L225 Difference]: With dead ends: 143 [2021-10-16 02:29:58,809 INFO L226 Difference]: Without dead ends: 143 [2021-10-16 02:29:58,810 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:29:58,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-10-16 02:29:58,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2021-10-16 02:29:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 62 states have (on average 2.403225806451613) internal successors, (149), 141 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:29:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions. [2021-10-16 02:29:58,828 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 2 [2021-10-16 02:29:58,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:29:58,829 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions. [2021-10-16 02:29:58,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:29:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2021-10-16 02:29:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-16 02:29:58,830 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:29:58,830 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-16 02:29:58,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-16 02:29:58,831 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:29:58,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:29:58,832 INFO L82 PathProgramCache]: Analyzing trace with hash 8083974, now seen corresponding path program 1 times [2021-10-16 02:29:58,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:29:58,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12014608] [2021-10-16 02:29:58,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:29:58,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:29:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:29:58,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:29:58,900 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:29:58,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12014608] [2021-10-16 02:29:58,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12014608] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:29:58,901 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:29:58,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:29:58,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402349787] [2021-10-16 02:29:58,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:29:58,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:29:58,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:29:58,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:29:58,903 INFO L87 Difference]: Start difference. First operand 142 states and 149 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:29:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:29:59,081 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2021-10-16 02:29:59,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:29:59,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-10-16 02:29:59,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:29:59,085 INFO L225 Difference]: With dead ends: 167 [2021-10-16 02:29:59,085 INFO L226 Difference]: Without dead ends: 167 [2021-10-16 02:29:59,086 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:29:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-10-16 02:29:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 146. [2021-10-16 02:29:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 68 states have (on average 2.323529411764706) internal successors, (158), 145 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:29:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2021-10-16 02:29:59,113 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 4 [2021-10-16 02:29:59,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:29:59,113 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2021-10-16 02:29:59,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:29:59,114 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2021-10-16 02:29:59,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-16 02:29:59,115 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:29:59,115 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-16 02:29:59,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-16 02:29:59,116 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:29:59,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:29:59,117 INFO L82 PathProgramCache]: Analyzing trace with hash 8083975, now seen corresponding path program 1 times [2021-10-16 02:29:59,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:29:59,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679754766] [2021-10-16 02:29:59,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:29:59,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:29:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:29:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:29:59,214 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:29:59,215 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679754766] [2021-10-16 02:29:59,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679754766] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:29:59,216 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:29:59,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:29:59,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121922414] [2021-10-16 02:29:59,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:29:59,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:29:59,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:29:59,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:29:59,223 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:29:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:29:59,359 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2021-10-16 02:29:59,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:29:59,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-10-16 02:29:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:29:59,362 INFO L225 Difference]: With dead ends: 145 [2021-10-16 02:29:59,362 INFO L226 Difference]: Without dead ends: 145 [2021-10-16 02:29:59,363 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:29:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-10-16 02:29:59,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2021-10-16 02:29:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 68 states have (on average 2.2941176470588234) internal successors, (156), 143 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:29:59,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2021-10-16 02:29:59,382 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 4 [2021-10-16 02:29:59,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:29:59,384 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2021-10-16 02:29:59,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:29:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2021-10-16 02:29:59,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-16 02:29:59,385 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:29:59,386 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:29:59,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-16 02:29:59,386 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:29:59,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:29:59,389 INFO L82 PathProgramCache]: Analyzing trace with hash 311697544, now seen corresponding path program 1 times [2021-10-16 02:29:59,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:29:59,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327422346] [2021-10-16 02:29:59,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:29:59,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:29:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:29:59,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:29:59,458 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:29:59,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327422346] [2021-10-16 02:29:59,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327422346] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:29:59,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:29:59,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:29:59,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269513727] [2021-10-16 02:29:59,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:29:59,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:29:59,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:29:59,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:29:59,461 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:29:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:29:59,614 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2021-10-16 02:29:59,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:29:59,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-16 02:29:59,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:29:59,616 INFO L225 Difference]: With dead ends: 163 [2021-10-16 02:29:59,616 INFO L226 Difference]: Without dead ends: 163 [2021-10-16 02:29:59,616 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:29:59,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-10-16 02:29:59,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 134. [2021-10-16 02:29:59,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 68 states have (on average 2.1470588235294117) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:29:59,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2021-10-16 02:29:59,621 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 7 [2021-10-16 02:29:59,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:29:59,621 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2021-10-16 02:29:59,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:29:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2021-10-16 02:29:59,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-16 02:29:59,623 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:29:59,623 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:29:59,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-16 02:29:59,624 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:29:59,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:29:59,624 INFO L82 PathProgramCache]: Analyzing trace with hash 311697545, now seen corresponding path program 1 times [2021-10-16 02:29:59,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:29:59,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602414129] [2021-10-16 02:29:59,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:29:59,625 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:29:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:29:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:29:59,675 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:29:59,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602414129] [2021-10-16 02:29:59,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602414129] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:29:59,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:29:59,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:29:59,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697818310] [2021-10-16 02:29:59,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:29:59,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:29:59,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:29:59,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:29:59,678 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:29:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:29:59,808 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2021-10-16 02:29:59,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:29:59,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-16 02:29:59,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:29:59,810 INFO L225 Difference]: With dead ends: 125 [2021-10-16 02:29:59,810 INFO L226 Difference]: Without dead ends: 125 [2021-10-16 02:29:59,811 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:29:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-10-16 02:29:59,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2021-10-16 02:29:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 68 states have (on average 2.0) internal successors, (136), 123 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:29:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2021-10-16 02:29:59,814 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 7 [2021-10-16 02:29:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:29:59,815 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2021-10-16 02:29:59,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:29:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2021-10-16 02:29:59,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-16 02:29:59,816 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:29:59,816 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:29:59,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-16 02:29:59,816 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:29:59,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:29:59,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1072689266, now seen corresponding path program 1 times [2021-10-16 02:29:59,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:29:59,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952572286] [2021-10-16 02:29:59,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:29:59,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:29:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:29:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:29:59,925 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:29:59,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952572286] [2021-10-16 02:29:59,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952572286] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:29:59,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:29:59,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 02:29:59,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343261124] [2021-10-16 02:29:59,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 02:29:59,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:29:59,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 02:29:59,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-16 02:29:59,929 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:00,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:30:00,154 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2021-10-16 02:30:00,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:30:00,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-10-16 02:30:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:30:00,156 INFO L225 Difference]: With dead ends: 145 [2021-10-16 02:30:00,156 INFO L226 Difference]: Without dead ends: 145 [2021-10-16 02:30:00,156 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-16 02:30:00,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-10-16 02:30:00,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 119. [2021-10-16 02:30:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 76 states have (on average 1.8157894736842106) internal successors, (138), 118 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2021-10-16 02:30:00,160 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 8 [2021-10-16 02:30:00,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:30:00,160 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2021-10-16 02:30:00,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:00,161 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2021-10-16 02:30:00,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-16 02:30:00,161 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:30:00,161 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:30:00,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-16 02:30:00,162 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:30:00,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:30:00,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1072689267, now seen corresponding path program 1 times [2021-10-16 02:30:00,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:30:00,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068248767] [2021-10-16 02:30:00,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:30:00,165 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:30:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:30:00,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-16 02:30:00,336 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:30:00,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068248767] [2021-10-16 02:30:00,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068248767] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:30:00,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:30:00,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 02:30:00,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011366299] [2021-10-16 02:30:00,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 02:30:00,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:30:00,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 02:30:00,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-16 02:30:00,340 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:00,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:30:00,621 INFO L93 Difference]: Finished difference Result 217 states and 236 transitions. [2021-10-16 02:30:00,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-16 02:30:00,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-10-16 02:30:00,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:30:00,623 INFO L225 Difference]: With dead ends: 217 [2021-10-16 02:30:00,624 INFO L226 Difference]: Without dead ends: 217 [2021-10-16 02:30:00,624 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 62.5ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-16 02:30:00,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-10-16 02:30:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 110. [2021-10-16 02:30:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 76 states have (on average 1.6842105263157894) internal successors, (128), 109 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 128 transitions. [2021-10-16 02:30:00,628 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 128 transitions. Word has length 8 [2021-10-16 02:30:00,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:30:00,628 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 128 transitions. [2021-10-16 02:30:00,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:00,629 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2021-10-16 02:30:00,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-16 02:30:00,629 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:30:00,629 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:30:00,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-16 02:30:00,630 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:30:00,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:30:00,631 INFO L82 PathProgramCache]: Analyzing trace with hash -10163226, now seen corresponding path program 1 times [2021-10-16 02:30:00,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:30:00,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573508810] [2021-10-16 02:30:00,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:30:00,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:30:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:30:00,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:00,863 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:30:00,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573508810] [2021-10-16 02:30:00,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573508810] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:30:00,866 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:30:00,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-16 02:30:00,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984576050] [2021-10-16 02:30:00,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-16 02:30:00,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:30:00,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-16 02:30:00,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-16 02:30:00,869 INFO L87 Difference]: Start difference. First operand 110 states and 128 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:01,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:30:01,166 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2021-10-16 02:30:01,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-16 02:30:01,167 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-10-16 02:30:01,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:30:01,168 INFO L225 Difference]: With dead ends: 147 [2021-10-16 02:30:01,168 INFO L226 Difference]: Without dead ends: 147 [2021-10-16 02:30:01,168 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 108.4ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-10-16 02:30:01,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-10-16 02:30:01,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 114. [2021-10-16 02:30:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.65) internal successors, (132), 113 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2021-10-16 02:30:01,172 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 15 [2021-10-16 02:30:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:30:01,173 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2021-10-16 02:30:01,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:01,173 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2021-10-16 02:30:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-16 02:30:01,174 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:30:01,174 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:30:01,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-16 02:30:01,174 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:30:01,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:30:01,175 INFO L82 PathProgramCache]: Analyzing trace with hash 230349510, now seen corresponding path program 1 times [2021-10-16 02:30:01,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:30:01,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718985886] [2021-10-16 02:30:01,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:30:01,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:30:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:30:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:01,390 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:30:01,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718985886] [2021-10-16 02:30:01,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718985886] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:30:01,391 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:30:01,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-16 02:30:01,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84797980] [2021-10-16 02:30:01,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-16 02:30:01,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:30:01,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-16 02:30:01,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-16 02:30:01,393 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:01,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:30:01,784 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2021-10-16 02:30:01,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-16 02:30:01,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-16 02:30:01,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:30:01,786 INFO L225 Difference]: With dead ends: 141 [2021-10-16 02:30:01,786 INFO L226 Difference]: Without dead ends: 141 [2021-10-16 02:30:01,786 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 135.6ms TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-10-16 02:30:01,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-10-16 02:30:01,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 116. [2021-10-16 02:30:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 115 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:01,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2021-10-16 02:30:01,791 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 16 [2021-10-16 02:30:01,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:30:01,791 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2021-10-16 02:30:01,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:01,792 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2021-10-16 02:30:01,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-16 02:30:01,793 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:30:01,793 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:30:01,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-16 02:30:01,794 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:30:01,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:30:01,795 INFO L82 PathProgramCache]: Analyzing trace with hash 752963403, now seen corresponding path program 1 times [2021-10-16 02:30:01,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:30:01,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125871681] [2021-10-16 02:30:01,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:30:01,796 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:30:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:30:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:01,836 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:30:01,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125871681] [2021-10-16 02:30:01,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125871681] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:30:01,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:30:01,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:30:01,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024217136] [2021-10-16 02:30:01,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:30:01,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:30:01,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:30:01,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:30:01,839 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:30:01,855 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2021-10-16 02:30:01,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:30:01,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-16 02:30:01,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:30:01,857 INFO L225 Difference]: With dead ends: 143 [2021-10-16 02:30:01,857 INFO L226 Difference]: Without dead ends: 143 [2021-10-16 02:30:01,857 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:30:01,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-10-16 02:30:01,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 106. [2021-10-16 02:30:01,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.5972222222222223) internal successors, (115), 105 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2021-10-16 02:30:01,861 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 21 [2021-10-16 02:30:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:30:01,861 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2021-10-16 02:30:01,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2021-10-16 02:30:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-16 02:30:01,862 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:30:01,863 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:30:01,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-16 02:30:01,863 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:30:01,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:30:01,864 INFO L82 PathProgramCache]: Analyzing trace with hash 752806916, now seen corresponding path program 1 times [2021-10-16 02:30:01,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:30:01,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117571490] [2021-10-16 02:30:01,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:30:01,865 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:30:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:30:01,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:01,944 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:30:01,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117571490] [2021-10-16 02:30:01,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117571490] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:30:01,945 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:30:01,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-16 02:30:01,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377358569] [2021-10-16 02:30:01,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 02:30:01,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:30:01,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 02:30:01,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-16 02:30:01,946 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:02,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:30:02,112 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2021-10-16 02:30:02,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:30:02,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-16 02:30:02,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:30:02,114 INFO L225 Difference]: With dead ends: 137 [2021-10-16 02:30:02,114 INFO L226 Difference]: Without dead ends: 137 [2021-10-16 02:30:02,114 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 27.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-16 02:30:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-10-16 02:30:02,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 105. [2021-10-16 02:30:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 72 states have (on average 1.5833333333333333) internal successors, (114), 104 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2021-10-16 02:30:02,118 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 21 [2021-10-16 02:30:02,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:30:02,118 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2021-10-16 02:30:02,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:02,119 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2021-10-16 02:30:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-16 02:30:02,119 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:30:02,119 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:30:02,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-16 02:30:02,120 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:30:02,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:30:02,120 INFO L82 PathProgramCache]: Analyzing trace with hash 752806917, now seen corresponding path program 1 times [2021-10-16 02:30:02,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:30:02,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868874125] [2021-10-16 02:30:02,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:30:02,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:30:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:30:02,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:02,268 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:30:02,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868874125] [2021-10-16 02:30:02,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868874125] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:30:02,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:30:02,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-16 02:30:02,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310762505] [2021-10-16 02:30:02,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 02:30:02,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:30:02,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 02:30:02,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-16 02:30:02,271 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:02,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:30:02,484 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2021-10-16 02:30:02,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-16 02:30:02,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-16 02:30:02,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:30:02,485 INFO L225 Difference]: With dead ends: 114 [2021-10-16 02:30:02,486 INFO L226 Difference]: Without dead ends: 114 [2021-10-16 02:30:02,486 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 68.5ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-16 02:30:02,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-10-16 02:30:02,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2021-10-16 02:30:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2021-10-16 02:30:02,489 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 21 [2021-10-16 02:30:02,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:30:02,489 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2021-10-16 02:30:02,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:02,490 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2021-10-16 02:30:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-16 02:30:02,491 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:30:02,491 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:30:02,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-16 02:30:02,491 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:30:02,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:30:02,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1993400646, now seen corresponding path program 1 times [2021-10-16 02:30:02,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:30:02,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898171033] [2021-10-16 02:30:02,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:30:02,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:30:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:30:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:02,901 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:30:02,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898171033] [2021-10-16 02:30:02,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898171033] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-16 02:30:02,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804025062] [2021-10-16 02:30:02,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:30:02,902 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:30:02,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:30:02,908 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 02:30:02,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-16 02:30:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:30:03,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 36 conjunts are in the unsatisfiable core [2021-10-16 02:30:03,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:30:03,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-16 02:30:03,187 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-10-16 02:30:03,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-10-16 02:30:03,448 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-10-16 02:30:03,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 37 [2021-10-16 02:30:03,990 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 20 treesize of output 16 [2021-10-16 02:30:04,106 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 29 treesize of output 28 [2021-10-16 02:30:04,288 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-16 02:30:04,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 62 [2021-10-16 02:30:04,783 INFO L354 Elim1Store]: treesize reduction 108, result has 27.0 percent of original size [2021-10-16 02:30:04,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 93 treesize of output 117 [2021-10-16 02:30:05,034 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 02:30:05,035 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 106 treesize of output 73 [2021-10-16 02:30:05,946 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 02:30:05,947 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 104 treesize of output 82 [2021-10-16 02:30:06,235 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-16 02:30:06,236 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 113 treesize of output 91 [2021-10-16 02:30:06,549 INFO L354 Elim1Store]: treesize reduction 150, result has 2.0 percent of original size [2021-10-16 02:30:06,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 129 treesize of output 75 [2021-10-16 02:30:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:06,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:30:08,906 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:30:08,908 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-10-16 02:30:16,945 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 34382 treesize of output 34286 [2021-10-16 02:30:17,207 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-16 02:30:17,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1292390576] [2021-10-16 02:30:17,235 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2021-10-16 02:30:17,235 INFO L166 IcfgInterpreter]: Building call graph [2021-10-16 02:30:17,241 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-16 02:30:17,247 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-16 02:30:17,247 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-16 02:30:17,317 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:30:17,319 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-16 02:30:17,320 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:30:17,321 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-10-16 02:30:17,322 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-16 02:30:17,322 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:30:17,323 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-16 02:30:17,326 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-10-16 02:30:17,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:30:17,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:30:17,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:30:17,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2021-10-16 02:30:17,355 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:30:17,357 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-16 02:30:17,357 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:30:17,358 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-16 02:30:17,359 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-16 02:30:17,361 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:30:17,374 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:30:17,376 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:30:17,377 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-10-16 02:30:17,377 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-16 02:30:17,378 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:110, output treesize:113 [2021-10-16 02:30:17,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-16 02:30:17,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:30:17,595 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: No corresponding IProgramVar for |v_#valid_149| at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.constructTermVarsProc(BasicPredicateFactory.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:81) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.predicate(SymbolicTools.java:174) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-16 02:30:17,599 INFO L168 Benchmark]: Toolchain (without parser) took 21996.79 ms. Allocated memory was 102.8 MB in the beginning and 180.4 MB in the end (delta: 77.6 MB). Free memory was 66.9 MB in the beginning and 113.6 MB in the end (delta: -46.7 MB). Peak memory consumption was 29.6 MB. Max. memory is 16.1 GB. [2021-10-16 02:30:17,599 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 102.8 MB. Free memory is still 59.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 02:30:17,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 703.30 ms. Allocated memory is still 102.8 MB. Free memory was 66.7 MB in the beginning and 70.8 MB in the end (delta: -4.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-16 02:30:17,600 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.52 ms. Allocated memory is still 102.8 MB. Free memory was 70.8 MB in the beginning and 68.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-16 02:30:17,600 INFO L168 Benchmark]: Boogie Preprocessor took 75.83 ms. Allocated memory is still 102.8 MB. Free memory was 68.5 MB in the beginning and 66.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-16 02:30:17,600 INFO L168 Benchmark]: RCFGBuilder took 1197.67 ms. Allocated memory was 102.8 MB in the beginning and 148.9 MB in the end (delta: 46.1 MB). Free memory was 66.4 MB in the beginning and 112.6 MB in the end (delta: -46.2 MB). Peak memory consumption was 26.8 MB. Max. memory is 16.1 GB. [2021-10-16 02:30:17,601 INFO L168 Benchmark]: TraceAbstraction took 19915.85 ms. Allocated memory was 148.9 MB in the beginning and 180.4 MB in the end (delta: 31.5 MB). Free memory was 111.9 MB in the beginning and 113.6 MB in the end (delta: -1.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 16.1 GB. [2021-10-16 02:30:17,603 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.22 ms. Allocated memory is still 102.8 MB. Free memory is still 59.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 703.30 ms. Allocated memory is still 102.8 MB. Free memory was 66.7 MB in the beginning and 70.8 MB in the end (delta: -4.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 94.52 ms. Allocated memory is still 102.8 MB. Free memory was 70.8 MB in the beginning and 68.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 75.83 ms. Allocated memory is still 102.8 MB. Free memory was 68.5 MB in the beginning and 66.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1197.67 ms. Allocated memory was 102.8 MB in the beginning and 148.9 MB in the end (delta: 46.1 MB). Free memory was 66.4 MB in the beginning and 112.6 MB in the end (delta: -46.2 MB). Peak memory consumption was 26.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19915.85 ms. Allocated memory was 148.9 MB in the beginning and 180.4 MB in the end (delta: 31.5 MB). Free memory was 111.9 MB in the beginning and 113.6 MB in the end (delta: -1.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: No corresponding IProgramVar for |v_#valid_149| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: No corresponding IProgramVar for |v_#valid_149|: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-10-16 02:30:17,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/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-5709675 [2021-10-16 02:30:20,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 02:30:20,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 02:30:20,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 02:30:20,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 02:30:20,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 02:30:20,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 02:30:20,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 02:30:20,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 02:30:20,408 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 02:30:20,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 02:30:20,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 02:30:20,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 02:30:20,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 02:30:20,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 02:30:20,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 02:30:20,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 02:30:20,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 02:30:20,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 02:30:20,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 02:30:20,424 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 02:30:20,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 02:30:20,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 02:30:20,433 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 02:30:20,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 02:30:20,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 02:30:20,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 02:30:20,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 02:30:20,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 02:30:20,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 02:30:20,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 02:30:20,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 02:30:20,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 02:30:20,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 02:30:20,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 02:30:20,464 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 02:30:20,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 02:30:20,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 02:30:20,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 02:30:20,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 02:30:20,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 02:30:20,471 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-10-16 02:30:20,510 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 02:30:20,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 02:30:20,511 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 02:30:20,512 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 02:30:20,512 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 02:30:20,512 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 02:30:20,512 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 02:30:20,513 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 02:30:20,513 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 02:30:20,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-16 02:30:20,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-16 02:30:20,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 02:30:20,516 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 02:30:20,517 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-16 02:30:20,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-16 02:30:20,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 02:30:20,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 02:30:20,517 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-16 02:30:20,518 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-16 02:30:20,518 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-16 02:30:20,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 02:30:20,518 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 02:30:20,519 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-16 02:30:20,519 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-16 02:30:20,519 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 02:30:20,519 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 02:30:20,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 02:30:20,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-16 02:30:20,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 02:30:20,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:30:20,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 02:30:20,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 02:30:20,522 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-16 02:30:20,522 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-16 02:30:20,522 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 02:30:20,523 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 02:30:20,523 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_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8a2a8c059e91938ad7ee96f17aa5eb207759b3b [2021-10-16 02:30:20,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 02:30:20,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 02:30:20,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 02:30:20,969 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 02:30:20,970 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 02:30:20,971 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/memsafety-ext2/length_test03-1.i [2021-10-16 02:30:21,057 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/data/cbc67893d/138bf23dcb614f53928eed7854eb9ce3/FLAG494c62550 [2021-10-16 02:30:21,800 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 02:30:21,801 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/sv-benchmarks/c/memsafety-ext2/length_test03-1.i [2021-10-16 02:30:21,819 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/data/cbc67893d/138bf23dcb614f53928eed7854eb9ce3/FLAG494c62550 [2021-10-16 02:30:22,048 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/data/cbc67893d/138bf23dcb614f53928eed7854eb9ce3 [2021-10-16 02:30:22,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 02:30:22,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 02:30:22,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 02:30:22,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 02:30:22,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 02:30:22,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:30:22" (1/1) ... [2021-10-16 02:30:22,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1560c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:30:22, skipping insertion in model container [2021-10-16 02:30:22,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:30:22" (1/1) ... [2021-10-16 02:30:22,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 02:30:22,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 02:30:22,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:30:22,492 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 02:30:22,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:30:22,588 INFO L208 MainTranslator]: Completed translation [2021-10-16 02:30:22,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:30:22 WrapperNode [2021-10-16 02:30:22,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 02:30:22,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 02:30:22,591 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 02:30:22,591 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 02:30:22,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:30:22" (1/1) ... [2021-10-16 02:30:22,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:30:22" (1/1) ... [2021-10-16 02:30:22,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 02:30:22,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 02:30:22,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 02:30:22,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 02:30:22,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:30:22" (1/1) ... [2021-10-16 02:30:22,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:30:22" (1/1) ... [2021-10-16 02:30:22,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:30:22" (1/1) ... [2021-10-16 02:30:22,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:30:22" (1/1) ... [2021-10-16 02:30:22,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:30:22" (1/1) ... [2021-10-16 02:30:22,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:30:22" (1/1) ... [2021-10-16 02:30:22,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:30:22" (1/1) ... [2021-10-16 02:30:22,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 02:30:22,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 02:30:22,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 02:30:22,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 02:30:22,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:30:22" (1/1) ... [2021-10-16 02:30:22,742 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:30:22,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:30:22,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 02:30:22,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 02:30:22,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-16 02:30:22,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-16 02:30:22,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 02:30:22,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-16 02:30:22,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-10-16 02:30:22,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-16 02:30:22,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-16 02:30:22,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 02:30:22,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 02:30:23,739 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 02:30:23,739 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2021-10-16 02:30:23,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:30:23 BoogieIcfgContainer [2021-10-16 02:30:23,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 02:30:23,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 02:30:23,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 02:30:23,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 02:30:23,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:30:22" (1/3) ... [2021-10-16 02:30:23,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f9928e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:30:23, skipping insertion in model container [2021-10-16 02:30:23,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:30:22" (2/3) ... [2021-10-16 02:30:23,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f9928e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:30:23, skipping insertion in model container [2021-10-16 02:30:23,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:30:23" (3/3) ... [2021-10-16 02:30:23,749 INFO L111 eAbstractionObserver]: Analyzing ICFG length_test03-1.i [2021-10-16 02:30:23,754 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 02:30:23,755 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 85 error locations. [2021-10-16 02:30:23,798 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 02:30:23,804 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-16 02:30:23,805 INFO L340 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2021-10-16 02:30:23,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 81 states have (on average 2.197530864197531) internal successors, (178), 166 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-16 02:30:23,827 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:30:23,828 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-16 02:30:23,828 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:30:23,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:30:23,834 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-10-16 02:30:23,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:30:23,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251327368] [2021-10-16 02:30:23,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:30:23,847 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:30:23,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:30:23,850 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:30:23,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-16 02:30:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:30:23,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:30:23,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:30:24,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-16 02:30:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:24,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:30:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:24,092 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:30:24,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251327368] [2021-10-16 02:30:24,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251327368] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:30:24,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:30:24,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-16 02:30:24,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478695249] [2021-10-16 02:30:24,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:30:24,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:30:24,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:30:24,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:30:24,147 INFO L87 Difference]: Start difference. First operand has 167 states, 81 states have (on average 2.197530864197531) internal successors, (178), 166 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:24,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:30:24,609 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2021-10-16 02:30:24,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:30:24,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-16 02:30:24,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:30:24,622 INFO L225 Difference]: With dead ends: 201 [2021-10-16 02:30:24,622 INFO L226 Difference]: Without dead ends: 199 [2021-10-16 02:30:24,624 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:30:24,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-10-16 02:30:24,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 162. [2021-10-16 02:30:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 80 states have (on average 2.1125) internal successors, (169), 161 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 169 transitions. [2021-10-16 02:30:24,667 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 169 transitions. Word has length 3 [2021-10-16 02:30:24,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:30:24,667 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 169 transitions. [2021-10-16 02:30:24,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:24,668 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 169 transitions. [2021-10-16 02:30:24,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-16 02:30:24,668 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:30:24,669 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-16 02:30:24,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-16 02:30:24,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:30:24,880 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:30:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:30:24,881 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-10-16 02:30:24,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:30:24,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494495115] [2021-10-16 02:30:24,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:30:24,882 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:30:24,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:30:24,884 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:30:24,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-16 02:30:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:30:24,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 02:30:24,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:30:24,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-16 02:30:24,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:24,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:30:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:25,014 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:30:25,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494495115] [2021-10-16 02:30:25,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494495115] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:30:25,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:30:25,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-16 02:30:25,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559373731] [2021-10-16 02:30:25,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:30:25,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:30:25,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:30:25,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:30:25,019 INFO L87 Difference]: Start difference. First operand 162 states and 169 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:30:26,096 INFO L93 Difference]: Finished difference Result 211 states and 222 transitions. [2021-10-16 02:30:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:30:26,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-16 02:30:26,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:30:26,099 INFO L225 Difference]: With dead ends: 211 [2021-10-16 02:30:26,099 INFO L226 Difference]: Without dead ends: 211 [2021-10-16 02:30:26,100 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:30:26,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-10-16 02:30:26,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 184. [2021-10-16 02:30:26,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 104 states have (on average 2.125) internal successors, (221), 183 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 221 transitions. [2021-10-16 02:30:26,121 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 221 transitions. Word has length 3 [2021-10-16 02:30:26,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:30:26,122 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 221 transitions. [2021-10-16 02:30:26,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:26,122 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 221 transitions. [2021-10-16 02:30:26,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-16 02:30:26,123 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:30:26,123 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-16 02:30:26,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-16 02:30:26,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:30:26,345 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:30:26,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:30:26,346 INFO L82 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2021-10-16 02:30:26,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:30:26,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208259192] [2021-10-16 02:30:26,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:30:26,348 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:30:26,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:30:26,350 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:30:26,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-16 02:30:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:30:26,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:30:26,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:30:26,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-16 02:30:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:26,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:30:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:26,492 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:30:26,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208259192] [2021-10-16 02:30:26,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208259192] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:30:26,493 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:30:26,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-16 02:30:26,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832021087] [2021-10-16 02:30:26,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:30:26,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:30:26,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:30:26,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:30:26,503 INFO L87 Difference]: Start difference. First operand 184 states and 221 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:26,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:30:26,967 INFO L93 Difference]: Finished difference Result 212 states and 251 transitions. [2021-10-16 02:30:26,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:30:26,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-16 02:30:26,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:30:26,970 INFO L225 Difference]: With dead ends: 212 [2021-10-16 02:30:26,970 INFO L226 Difference]: Without dead ends: 212 [2021-10-16 02:30:26,971 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:30:26,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-10-16 02:30:26,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 189. [2021-10-16 02:30:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 111 states have (on average 2.081081081081081) internal successors, (231), 188 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 231 transitions. [2021-10-16 02:30:26,986 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 231 transitions. Word has length 6 [2021-10-16 02:30:26,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:30:26,986 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 231 transitions. [2021-10-16 02:30:26,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 231 transitions. [2021-10-16 02:30:26,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-16 02:30:26,987 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:30:26,988 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-16 02:30:27,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-16 02:30:27,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:30:27,203 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:30:27,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:30:27,204 INFO L82 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2021-10-16 02:30:27,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:30:27,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944128707] [2021-10-16 02:30:27,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:30:27,205 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:30:27,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:30:27,207 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:30:27,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-16 02:30:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:30:27,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 02:30:27,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:30:27,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-16 02:30:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:27,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:30:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:27,394 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:30:27,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944128707] [2021-10-16 02:30:27,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944128707] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:30:27,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:30:27,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-16 02:30:27,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380202844] [2021-10-16 02:30:27,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:30:27,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:30:27,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:30:27,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:30:27,397 INFO L87 Difference]: Start difference. First operand 189 states and 231 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:30:28,393 INFO L93 Difference]: Finished difference Result 272 states and 294 transitions. [2021-10-16 02:30:28,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:30:28,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-16 02:30:28,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:30:28,397 INFO L225 Difference]: With dead ends: 272 [2021-10-16 02:30:28,398 INFO L226 Difference]: Without dead ends: 272 [2021-10-16 02:30:28,398 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:30:28,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-10-16 02:30:28,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 187. [2021-10-16 02:30:28,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 111 states have (on average 2.063063063063063) internal successors, (229), 186 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:28,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 229 transitions. [2021-10-16 02:30:28,419 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 229 transitions. Word has length 6 [2021-10-16 02:30:28,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:30:28,420 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 229 transitions. [2021-10-16 02:30:28,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:28,420 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 229 transitions. [2021-10-16 02:30:28,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-16 02:30:28,421 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:30:28,421 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:30:28,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-16 02:30:28,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:30:28,633 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:30:28,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:30:28,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1113926380, now seen corresponding path program 1 times [2021-10-16 02:30:28,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:30:28,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540403525] [2021-10-16 02:30:28,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:30:28,634 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:30:28,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:30:28,636 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:30:28,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-16 02:30:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:30:28,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:30:28,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:30:28,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-16 02:30:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:28,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:30:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:28,798 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:30:28,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540403525] [2021-10-16 02:30:28,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540403525] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:30:28,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:30:28,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-16 02:30:28,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124401155] [2021-10-16 02:30:28,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:30:28,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:30:28,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:30:28,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:30:28,800 INFO L87 Difference]: Start difference. First operand 187 states and 229 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:29,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:30:29,071 INFO L93 Difference]: Finished difference Result 210 states and 247 transitions. [2021-10-16 02:30:29,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:30:29,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-16 02:30:29,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:30:29,073 INFO L225 Difference]: With dead ends: 210 [2021-10-16 02:30:29,073 INFO L226 Difference]: Without dead ends: 210 [2021-10-16 02:30:29,073 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-16 02:30:29,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-10-16 02:30:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 177. [2021-10-16 02:30:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 111 states have (on average 1.927927927927928) internal successors, (214), 176 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 214 transitions. [2021-10-16 02:30:29,088 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 214 transitions. Word has length 10 [2021-10-16 02:30:29,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:30:29,088 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 214 transitions. [2021-10-16 02:30:29,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:29,089 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 214 transitions. [2021-10-16 02:30:29,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-16 02:30:29,089 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:30:29,090 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:30:29,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-16 02:30:29,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:30:29,299 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:30:29,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:30:29,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1113926381, now seen corresponding path program 1 times [2021-10-16 02:30:29,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:30:29,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264699178] [2021-10-16 02:30:29,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:30:29,302 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:30:29,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:30:29,303 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:30:29,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-16 02:30:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:30:29,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 02:30:29,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:30:29,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-16 02:30:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:29,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:30:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:29,527 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:30:29,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264699178] [2021-10-16 02:30:29,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264699178] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:30:29,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:30:29,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-16 02:30:29,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222380427] [2021-10-16 02:30:29,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:30:29,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:30:29,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:30:29,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:30:29,530 INFO L87 Difference]: Start difference. First operand 177 states and 214 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:30:29,849 INFO L93 Difference]: Finished difference Result 167 states and 199 transitions. [2021-10-16 02:30:29,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:30:29,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-16 02:30:29,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:30:29,851 INFO L225 Difference]: With dead ends: 167 [2021-10-16 02:30:29,851 INFO L226 Difference]: Without dead ends: 167 [2021-10-16 02:30:29,852 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:30:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-10-16 02:30:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2021-10-16 02:30:29,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 111 states have (on average 1.7927927927927927) internal successors, (199), 166 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 199 transitions. [2021-10-16 02:30:29,861 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 199 transitions. Word has length 10 [2021-10-16 02:30:29,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:30:29,862 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 199 transitions. [2021-10-16 02:30:29,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 199 transitions. [2021-10-16 02:30:29,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-16 02:30:29,863 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:30:29,863 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:30:29,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-10-16 02:30:30,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:30:30,077 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:30:30,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:30:30,078 INFO L82 PathProgramCache]: Analyzing trace with hash 171979406, now seen corresponding path program 1 times [2021-10-16 02:30:30,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:30:30,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291504024] [2021-10-16 02:30:30,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:30:30,079 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:30:30,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:30:30,079 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:30:30,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-16 02:30:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:30:30,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-16 02:30:30,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:30:30,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-16 02:30:30,299 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-16 02:30:30,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2021-10-16 02:30:30,596 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-10-16 02:30:30,597 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 3 case distinctions, treesize of input 42 treesize of output 53 [2021-10-16 02:30:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:30,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:30:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:33,017 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:30:33,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291504024] [2021-10-16 02:30:33,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291504024] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:30:33,018 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:30:33,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-10-16 02:30:33,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794580236] [2021-10-16 02:30:33,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-16 02:30:33,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:30:33,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-16 02:30:33,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2021-10-16 02:30:33,020 INFO L87 Difference]: Start difference. First operand 167 states and 199 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:33,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:30:33,727 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2021-10-16 02:30:33,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:30:33,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-10-16 02:30:33,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:30:33,729 INFO L225 Difference]: With dead ends: 187 [2021-10-16 02:30:33,729 INFO L226 Difference]: Without dead ends: 187 [2021-10-16 02:30:33,729 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2264.0ms TimeCoverageRelationStatistics Valid=22, Invalid=33, Unknown=1, NotChecked=0, Total=56 [2021-10-16 02:30:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-10-16 02:30:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 154. [2021-10-16 02:30:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 111 states have (on average 1.6126126126126126) internal successors, (179), 153 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:33,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 179 transitions. [2021-10-16 02:30:33,736 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 179 transitions. Word has length 11 [2021-10-16 02:30:33,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:30:33,736 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 179 transitions. [2021-10-16 02:30:33,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2021-10-16 02:30:33,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-16 02:30:33,737 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:30:33,737 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:30:33,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-16 02:30:33,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:30:33,949 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:30:33,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:30:33,950 INFO L82 PathProgramCache]: Analyzing trace with hash 171979407, now seen corresponding path program 1 times [2021-10-16 02:30:33,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:30:33,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977823479] [2021-10-16 02:30:33,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:30:33,951 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:30:33,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:30:33,952 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:30:33,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-16 02:30:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:30:34,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-16 02:30:34,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:30:34,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-16 02:30:34,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-16 02:30:34,234 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-10-16 02:30:34,235 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 31 treesize of output 33 [2021-10-16 02:30:34,255 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-16 02:30:34,256 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 30 treesize of output 30 [2021-10-16 02:30:34,464 INFO L354 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2021-10-16 02:30:34,465 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 3 case distinctions, treesize of input 21 treesize of output 34 [2021-10-16 02:30:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:34,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:30:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:37,527 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:30:37,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977823479] [2021-10-16 02:30:37,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977823479] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:30:37,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:30:37,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-10-16 02:30:37,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389277390] [2021-10-16 02:30:37,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-16 02:30:37,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:30:37,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-16 02:30:37,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2021-10-16 02:30:37,530 INFO L87 Difference]: Start difference. First operand 154 states and 179 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:30:45,135 INFO L93 Difference]: Finished difference Result 361 states and 396 transitions. [2021-10-16 02:30:45,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-16 02:30:45,136 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-10-16 02:30:45,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:30:45,139 INFO L225 Difference]: With dead ends: 361 [2021-10-16 02:30:45,139 INFO L226 Difference]: Without dead ends: 361 [2021-10-16 02:30:45,140 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 7135.8ms TimeCoverageRelationStatistics Valid=69, Invalid=140, Unknown=1, NotChecked=0, Total=210 [2021-10-16 02:30:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-10-16 02:30:45,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 121. [2021-10-16 02:30:45,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 87 states have (on average 1.528735632183908) internal successors, (133), 120 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2021-10-16 02:30:45,147 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 133 transitions. Word has length 11 [2021-10-16 02:30:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:30:45,147 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 133 transitions. [2021-10-16 02:30:45,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:30:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2021-10-16 02:30:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-16 02:30:45,148 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:30:45,149 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] [2021-10-16 02:30:45,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-10-16 02:30:45,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:30:45,361 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:30:45,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:30:45,361 INFO L82 PathProgramCache]: Analyzing trace with hash 719743272, now seen corresponding path program 1 times [2021-10-16 02:30:45,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:30:45,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923799820] [2021-10-16 02:30:45,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:30:45,362 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:30:45,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:30:45,365 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:30:45,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-16 02:30:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:30:45,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-16 02:30:45,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:30:45,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-16 02:30:45,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-16 02:30:45,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-16 02:30:45,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:30:45,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-16 02:30:45,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:30:45,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-16 02:30:45,837 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-16 02:30:45,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2021-10-16 02:30:45,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:30:45,974 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 28 treesize of output 30 [2021-10-16 02:30:46,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:30:46,008 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 28 treesize of output 30 [2021-10-16 02:30:46,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:30:46,210 INFO L354 Elim1Store]: treesize reduction 108, result has 18.2 percent of original size [2021-10-16 02:30:46,210 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 91 [2021-10-16 02:30:46,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:30:46,265 INFO L354 Elim1Store]: treesize reduction 108, result has 18.2 percent of original size [2021-10-16 02:30:46,265 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 87 [2021-10-16 02:30:46,632 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-10-16 02:30:46,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 72 [2021-10-16 02:30:47,016 INFO L354 Elim1Store]: treesize reduction 180, result has 14.7 percent of original size [2021-10-16 02:30:47,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 100 [2021-10-16 02:30:47,112 INFO L354 Elim1Store]: treesize reduction 180, result has 14.7 percent of original size [2021-10-16 02:30:47,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 85 [2021-10-16 02:30:47,308 INFO L354 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2021-10-16 02:30:47,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 57 [2021-10-16 02:30:47,324 INFO L354 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2021-10-16 02:30:47,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 23 [2021-10-16 02:30:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:30:47,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:30:47,525 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:30:47,527 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-10-16 02:30:47,530 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:30:47,532 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-10-16 02:31:06,975 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_47 (_ BitVec 32))) (or (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_47 (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_47) 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))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse1 v_ULTIMATE.start_append_~node~0.base_47 (store (select .cse1 v_ULTIMATE.start_append_~node~0.base_47) 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)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_47))))))) is different from false [2021-10-16 02:31:09,133 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_47 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_47))))) (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (ULTIMATE.start_main_~list2~0.offset (_ BitVec 32))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) ULTIMATE.start_main_~list2~0.offset (_ bv0 32)) (bvadd (_ bv4 32) ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_47 (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_47) 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)) (ULTIMATE.start_main_~list2~0.offset (_ BitVec 32))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) ULTIMATE.start_main_~list2~0.offset (_ bv0 32)) (bvadd (_ bv4 32) ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse1 v_ULTIMATE.start_append_~node~0.base_47 (store (select .cse1 v_ULTIMATE.start_append_~node~0.base_47) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_2))) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32)))))) is different from false [2021-10-16 02:31:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:31:24,740 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:31:24,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923799820] [2021-10-16 02:31:24,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923799820] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:31:24,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:31:24,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 20 [2021-10-16 02:31:24,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595775611] [2021-10-16 02:31:24,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-16 02:31:24,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:31:24,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-16 02:31:24,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=219, Unknown=15, NotChecked=66, Total=380 [2021-10-16 02:31:24,744 INFO L87 Difference]: Start difference. First operand 121 states and 133 transitions. Second operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:31:34,782 WARN L207 SmtUtils]: Spent 9.56 s on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2021-10-16 02:31:38,811 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (.cse1 (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base)) (.cse5 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base))) (and (exists ((v_arrayElimCell_13 (_ BitVec 1))) (let ((.cse0 (bvneg v_arrayElimCell_13))) (and (= (_ bv0 1) (bvadd (bvneg .cse0) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse0 (select |c_#valid| c_ULTIMATE.start_main_~list~0.base)))))) (= c_ULTIMATE.start_main_~list~0.offset (_ bv0 32)) (= (select .cse1 .cse2) (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| c_ULTIMATE.start_main_~list2~0.base))) (_ bv1 1))) (forall ((v_ULTIMATE.start_append_~node~0.base_47 (_ BitVec 32))) (or (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse3 v_ULTIMATE.start_append_~node~0.base_47 (store (select .cse3 v_ULTIMATE.start_append_~node~0.base_47) 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))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse4 v_ULTIMATE.start_append_~node~0.base_47 (store (select .cse4 v_ULTIMATE.start_append_~node~0.base_47) 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)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_47))))))) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32)) (= (_ bv0 32) (select .cse5 .cse2)) (= (select .cse1 c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select .cse5 c_ULTIMATE.start_main_~list~0.offset)) (not (= c_ULTIMATE.start_main_~list2~0.base c_ULTIMATE.start_main_~list~0.base)))) is different from false [2021-10-16 02:31:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:31:50,280 INFO L93 Difference]: Finished difference Result 171 states and 184 transitions. [2021-10-16 02:31:50,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-16 02:31:50,281 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-16 02:31:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:31:50,283 INFO L225 Difference]: With dead ends: 171 [2021-10-16 02:31:50,283 INFO L226 Difference]: Without dead ends: 171 [2021-10-16 02:31:50,284 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 49041.1ms TimeCoverageRelationStatistics Valid=145, Invalid=403, Unknown=16, NotChecked=138, Total=702 [2021-10-16 02:31:50,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-10-16 02:31:50,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 126. [2021-10-16 02:31:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 92 states have (on average 1.5) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:31:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2021-10-16 02:31:50,289 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 20 [2021-10-16 02:31:50,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:31:50,290 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2021-10-16 02:31:50,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:31:50,290 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2021-10-16 02:31:50,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-16 02:31:50,291 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:31:50,292 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] [2021-10-16 02:31:50,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-16 02:31:50,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:31:50,503 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:31:50,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:31:50,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1685508437, now seen corresponding path program 1 times [2021-10-16 02:31:50,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:31:50,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113123145] [2021-10-16 02:31:50,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:31:50,504 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:31:50,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:31:50,504 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:31:50,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-10-16 02:31:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:31:50,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 20 conjunts are in the unsatisfiable core [2021-10-16 02:31:50,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:31:50,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-16 02:31:50,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-16 02:31:50,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-16 02:31:50,888 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-16 02:31:50,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2021-10-16 02:31:51,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-16 02:31:51,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-16 02:31:51,252 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-10-16 02:31:51,252 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 72 treesize of output 74 [2021-10-16 02:31:51,312 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-10-16 02:31:51,313 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 68 treesize of output 70 [2021-10-16 02:31:51,722 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-10-16 02:31:51,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 72 [2021-10-16 02:31:52,060 INFO L354 Elim1Store]: treesize reduction 136, result has 16.0 percent of original size [2021-10-16 02:31:52,060 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 87 [2021-10-16 02:31:52,149 INFO L354 Elim1Store]: treesize reduction 136, result has 16.0 percent of original size [2021-10-16 02:31:52,149 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 72 [2021-10-16 02:31:52,601 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-10-16 02:31:52,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 51 [2021-10-16 02:31:52,617 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-10-16 02:31:52,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 20 [2021-10-16 02:31:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:31:52,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:31:52,909 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:31:52,910 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-10-16 02:31:52,913 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:31:52,914 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-10-16 02:32:15,529 WARN L207 SmtUtils]: Spent 7.43 s on a formula simplification that was a NOOP. DAG size: 26 [2021-10-16 02:32:27,885 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_48 (_ BitVec 32))) (or (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_48 (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_48) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_3))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (_ bv0 32))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse1 v_ULTIMATE.start_append_~node~0.base_48 (store (select .cse1 v_ULTIMATE.start_append_~node~0.base_48) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_4))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (_ bv0 32)))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_48)))))))) is different from false [2021-10-16 02:32:51,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:32:51,074 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:32:51,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113123145] [2021-10-16 02:32:51,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113123145] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:32:51,075 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:32:51,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 18 [2021-10-16 02:32:51,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58545670] [2021-10-16 02:32:51,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-16 02:32:51,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:32:51,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-16 02:32:51,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=187, Unknown=21, NotChecked=30, Total=306 [2021-10-16 02:32:51,078 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:32:55,528 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))) (and (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base) .cse0) (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| c_ULTIMATE.start_main_~list2~0.base))) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32)) (exists ((v_arrayElimCell_44 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_44))) (and (= (_ bv0 1) (bvadd (bvneg .cse1) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| c_ULTIMATE.start_main_~list~0.base) .cse1))))) (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base) .cse0)) (forall ((v_ULTIMATE.start_append_~node~0.base_48 (_ BitVec 32))) (or (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse2 v_ULTIMATE.start_append_~node~0.base_48 (store (select .cse2 v_ULTIMATE.start_append_~node~0.base_48) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_3))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (_ bv0 32))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse3 v_ULTIMATE.start_append_~node~0.base_48 (store (select .cse3 v_ULTIMATE.start_append_~node~0.base_48) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_4))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (_ bv0 32)))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_48)))))))) (not (= c_ULTIMATE.start_main_~list2~0.base c_ULTIMATE.start_main_~list~0.base)))) is different from false [2021-10-16 02:33:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:33:08,249 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2021-10-16 02:33:08,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-16 02:33:08,249 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 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 22 [2021-10-16 02:33:08,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:33:08,250 INFO L225 Difference]: With dead ends: 164 [2021-10-16 02:33:08,251 INFO L226 Difference]: Without dead ends: 164 [2021-10-16 02:33:08,251 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 64913.6ms TimeCoverageRelationStatistics Valid=121, Invalid=325, Unknown=24, NotChecked=82, Total=552 [2021-10-16 02:33:08,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-10-16 02:33:08,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 129. [2021-10-16 02:33:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 128 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:33:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2021-10-16 02:33:08,257 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 22 [2021-10-16 02:33:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:33:08,258 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2021-10-16 02:33:08,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:33:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2021-10-16 02:33:08,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-16 02:33:08,259 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:33:08,259 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:33:08,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-10-16 02:33:08,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:33:08,471 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:33:08,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:33:08,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1028150688, now seen corresponding path program 1 times [2021-10-16 02:33:08,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:33:08,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136602050] [2021-10-16 02:33:08,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:33:08,472 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:33:08,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:33:08,473 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:33:08,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-10-16 02:33:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:33:08,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-16 02:33:08,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:33:08,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-16 02:33:08,895 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-16 02:33:08,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2021-10-16 02:33:09,664 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-10-16 02:33:09,664 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 3 case distinctions, treesize of input 39 treesize of output 50 [2021-10-16 02:33:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:33:09,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:33:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:33:14,020 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:33:14,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136602050] [2021-10-16 02:33:14,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136602050] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:33:14,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:33:14,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-10-16 02:33:14,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965196968] [2021-10-16 02:33:14,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-16 02:33:14,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:33:14,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-16 02:33:14,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=25, Unknown=2, NotChecked=0, Total=42 [2021-10-16 02:33:14,022 INFO L87 Difference]: Start difference. First operand 129 states and 141 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:33:14,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:33:14,907 INFO L93 Difference]: Finished difference Result 173 states and 183 transitions. [2021-10-16 02:33:14,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:33:14,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 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 25 [2021-10-16 02:33:14,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:33:14,909 INFO L225 Difference]: With dead ends: 173 [2021-10-16 02:33:14,910 INFO L226 Difference]: Without dead ends: 173 [2021-10-16 02:33:14,910 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 14 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4427.5ms TimeCoverageRelationStatistics Valid=22, Invalid=32, Unknown=2, NotChecked=0, Total=56 [2021-10-16 02:33:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-10-16 02:33:14,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 128. [2021-10-16 02:33:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 127 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:33:14,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2021-10-16 02:33:14,914 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 25 [2021-10-16 02:33:14,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:33:14,915 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2021-10-16 02:33:14,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:33:14,915 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2021-10-16 02:33:14,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-16 02:33:14,916 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:33:14,916 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:33:14,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-10-16 02:33:15,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:33:15,117 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:33:15,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:33:15,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1028150687, now seen corresponding path program 1 times [2021-10-16 02:33:15,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:33:15,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954206272] [2021-10-16 02:33:15,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:33:15,119 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:33:15,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:33:15,120 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:33:15,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-10-16 02:33:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:33:15,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-16 02:33:15,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:33:15,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-16 02:33:15,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-16 02:33:15,643 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-10-16 02:33:15,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2021-10-16 02:33:15,652 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-10-16 02:33:15,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2021-10-16 02:33:15,956 INFO L354 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2021-10-16 02:33:15,957 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 3 case distinctions, treesize of input 17 treesize of output 30 [2021-10-16 02:33:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:33:16,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:33:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:33:18,980 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:33:18,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954206272] [2021-10-16 02:33:18,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954206272] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:33:18,981 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:33:18,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-10-16 02:33:18,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815793575] [2021-10-16 02:33:18,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-16 02:33:18,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:33:18,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-16 02:33:18,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=36, Unknown=1, NotChecked=0, Total=56 [2021-10-16 02:33:18,983 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:33:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:33:20,446 INFO L93 Difference]: Finished difference Result 220 states and 233 transitions. [2021-10-16 02:33:20,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-16 02:33:20,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 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 25 [2021-10-16 02:33:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:33:20,448 INFO L225 Difference]: With dead ends: 220 [2021-10-16 02:33:20,449 INFO L226 Difference]: Without dead ends: 220 [2021-10-16 02:33:20,449 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2609.4ms TimeCoverageRelationStatistics Valid=60, Invalid=95, Unknown=1, NotChecked=0, Total=156 [2021-10-16 02:33:20,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-10-16 02:33:20,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 120. [2021-10-16 02:33:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 95 states have (on average 1.368421052631579) internal successors, (130), 119 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:33:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2021-10-16 02:33:20,453 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 25 [2021-10-16 02:33:20,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:33:20,453 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2021-10-16 02:33:20,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:33:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2021-10-16 02:33:20,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-16 02:33:20,455 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:33:20,455 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:33:20,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-10-16 02:33:20,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:33:20,656 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:33:20,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:33:20,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1807900189, now seen corresponding path program 1 times [2021-10-16 02:33:20,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:33:20,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391049221] [2021-10-16 02:33:20,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:33:20,657 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:33:20,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:33:20,658 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:33:20,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-10-16 02:33:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:33:20,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:33:20,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:33:21,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:33:21,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:33:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:33:21,121 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:33:21,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391049221] [2021-10-16 02:33:21,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391049221] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:33:21,121 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:33:21,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 02:33:21,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781761194] [2021-10-16 02:33:21,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:33:21,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:33:21,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:33:21,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:33:21,123 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:33:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:33:21,175 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2021-10-16 02:33:21,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:33:21,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-16 02:33:21,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:33:21,177 INFO L225 Difference]: With dead ends: 152 [2021-10-16 02:33:21,177 INFO L226 Difference]: Without dead ends: 152 [2021-10-16 02:33:21,177 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:33:21,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-10-16 02:33:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 145. [2021-10-16 02:33:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 120 states have (on average 1.35) internal successors, (162), 144 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:33:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 162 transitions. [2021-10-16 02:33:21,183 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 162 transitions. Word has length 26 [2021-10-16 02:33:21,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:33:21,184 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 162 transitions. [2021-10-16 02:33:21,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:33:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 162 transitions. [2021-10-16 02:33:21,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-16 02:33:21,186 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:33:21,186 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2021-10-16 02:33:21,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-10-16 02:33:21,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:33:21,402 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-16 02:33:21,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:33:21,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1778627636, now seen corresponding path program 1 times [2021-10-16 02:33:21,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:33:21,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917325166] [2021-10-16 02:33:21,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:33:21,404 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:33:21,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:33:21,405 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:33:21,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-10-16 02:33:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:33:21,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-16 02:33:21,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:33:21,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-16 02:33:22,014 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-10-16 02:33:22,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 22 [2021-10-16 02:33:22,116 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-16 02:33:22,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2021-10-16 02:33:22,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-16 02:33:22,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-10-16 02:33:22,828 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-16 02:33:22,828 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-16 02:33:23,136 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-10-16 02:33:23,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 76 [2021-10-16 02:33:23,470 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 02:33:23,470 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 61 [2021-10-16 02:33:24,223 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 02:33:24,223 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 86 treesize of output 70 [2021-10-16 02:33:24,591 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-16 02:33:24,591 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 97 treesize of output 81 [2021-10-16 02:33:24,933 INFO L354 Elim1Store]: treesize reduction 92, result has 1.1 percent of original size [2021-10-16 02:33:24,934 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 125 treesize of output 74 [2021-10-16 02:33:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:33:25,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:33:28,368 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:33:28,369 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-10-16 02:33:36,342 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_55 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem9.base| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_55 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_55 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_55) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_5) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.base|) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_55)))))) is different from false [2021-10-16 02:33:38,435 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_55 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_47 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem9.base| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_55 (_ 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_55 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_55) v_ULTIMATE.start_append_~node~0.offset_47 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_47 (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_47 (_ 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_55)))))) is different from false [2021-10-16 02:33:40,535 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_55 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_47 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem9.base| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_55 (_ 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_55 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_55) v_ULTIMATE.start_append_~node~0.offset_47 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_47 (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_47 (_ 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_55)))))) is different from false [2021-10-16 02:33:40,560 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 80045 treesize of output 79853 [2021-10-16 02:33:41,085 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:33:41,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917325166] [2021-10-16 02:33:41,086 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-16 02:33:41,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [67433927] [2021-10-16 02:33:41,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:33:41,086 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-16 02:33:41,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/cvc4 [2021-10-16 02:33:41,090 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-16 02:33:41,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2021-10-16 02:33:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:33:41,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 28 conjunts are in the unsatisfiable core [2021-10-16 02:33:41,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:33:41,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-10-16 02:33:42,120 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-16 02:33:42,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2021-10-16 02:33:42,480 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-10-16 02:33:42,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 64 [2021-10-16 02:33:44,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-16 02:33:44,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-10-16 02:33:44,684 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-16 02:33:44,685 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 95 treesize of output 70 [2021-10-16 02:33:45,240 INFO L354 Elim1Store]: treesize reduction 85, result has 36.6 percent of original size [2021-10-16 02:33:45,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 70 treesize of output 103 [2021-10-16 02:33:45,747 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 02:33:45,748 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 134 treesize of output 101 [2021-10-16 02:33:47,057 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 02:33:47,058 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 134 treesize of output 112 [2021-10-16 02:33:47,676 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-16 02:33:47,677 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 139 treesize of output 117 [2021-10-16 02:33:48,229 INFO L354 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2021-10-16 02:33:48,229 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 148 treesize of output 105 [2021-10-16 02:33:48,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:33:48,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:33:48,900 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:33:48,901 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-10-16 02:33:55,456 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_56 (_ BitVec 32)) (ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem9.base| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_56 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_56 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_56) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_5) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.base|) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_56))))))) is different from false [2021-10-16 02:34:02,078 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 160110 treesize of output 159726 [2021-10-16 02:34:02,648 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-16 02:34:02,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784450916] [2021-10-16 02:34:02,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:02,649 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:34:02,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:34:02,663 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 02:34:02,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-10-16 02:34:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:03,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 25 conjunts are in the unsatisfiable core [2021-10-16 02:34:03,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:34:03,362 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-16 02:34:03,362 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-16 02:34:03,598 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-10-16 02:34:03,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2021-10-16 02:34:04,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-16 02:34:04,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-10-16 02:34:04,630 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-16 02:34:04,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 45 [2021-10-16 02:34:04,949 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-10-16 02:34:04,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 63 [2021-10-16 02:34:05,307 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 02:34:05,308 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 97 treesize of output 70 [2021-10-16 02:34:06,062 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-16 02:34:06,062 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 95 treesize of output 79 [2021-10-16 02:34:06,461 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-16 02:34:06,462 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 102 treesize of output 86 [2021-10-16 02:34:06,816 INFO L354 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2021-10-16 02:34:06,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 72 [2021-10-16 02:34:06,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:06,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:34:07,179 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:34:07,180 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-10-16 02:34:17,380 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~mem9.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_57 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_57))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_57 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_57 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_57) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_5) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.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-16 02:34:19,474 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_57 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem9.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_57 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_57))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_57 (_ 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_57 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_57) v_ULTIMATE.start_append_~node~0.offset_57 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_57 (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_57 (_ 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-16 02:34:21,550 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_57 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem9.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_57 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_57))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_57 (_ 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_57 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_57) v_ULTIMATE.start_append_~node~0.offset_57 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_57 (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_57 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))) (_ bv1 1))))) is different from false [2021-10-16 02:34:21,606 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 2496494 treesize of output 2490350 [2021-10-16 02:34:29,750 WARN L207 SmtUtils]: Spent 8.14 s on a formula simplification that was a NOOP. DAG size: 1086 [2021-10-16 02:34:29,792 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-16 02:34:29,792 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:29,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-10-16 02:34:29,793 ERROR L172 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2021-10-16 02:34:29,793 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-10-16 02:34:29,801 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-16 02:34:29,803 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-16 02:34:29,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-16 02:34:29,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-16 02:34:29,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-16 02:34:29,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-16 02:34:29,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-16 02:34:29,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-16 02:34:29,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-16 02:34:29,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-16 02:34:29,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-16 02:34:29,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-16 02:34:29,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-16 02:34:29,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-16 02:34:29,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-16 02:34:29,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-16 02:34:29,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-16 02:34:29,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-16 02:34:29,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-16 02:34:29,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-16 02:34:29,808 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-16 02:34:29,808 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-16 02:34:29,808 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-16 02:34:29,808 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-16 02:34:29,808 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-16 02:34:29,809 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-16 02:34:29,809 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-16 02:34:29,809 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-16 02:34:29,809 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-16 02:34:29,809 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-16 02:34:29,810 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-16 02:34:29,810 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-16 02:34:29,810 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-10-16 02:34:29,810 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-16 02:34:29,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-16 02:34:29,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-16 02:34:29,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-16 02:34:29,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-16 02:34:29,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-16 02:34:29,812 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-16 02:34:29,812 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-16 02:34:29,812 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-16 02:34:29,812 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-16 02:34:29,812 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-16 02:34:29,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-10-16 02:34:29,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-16 02:34:29,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-16 02:34:29,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-10-16 02:34:29,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-10-16 02:34:29,814 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-16 02:34:29,814 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-16 02:34:29,814 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-10-16 02:34:29,814 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-10-16 02:34:29,815 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-10-16 02:34:29,815 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-16 02:34:29,815 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-10-16 02:34:29,815 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-10-16 02:34:29,815 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION [2021-10-16 02:34:29,816 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-10-16 02:34:29,816 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-16 02:34:29,816 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-10-16 02:34:29,816 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION [2021-10-16 02:34:29,816 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION [2021-10-16 02:34:29,817 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-10-16 02:34:29,817 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION [2021-10-16 02:34:29,817 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-10-16 02:34:29,817 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:29,818 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:29,818 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:29,818 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION [2021-10-16 02:34:29,818 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION [2021-10-16 02:34:29,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-10-16 02:34:29,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION [2021-10-16 02:34:29,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION [2021-10-16 02:34:29,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-10-16 02:34:29,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:29,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:29,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:29,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:29,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:29,821 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:29,821 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:29,821 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:29,821 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:29,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:29,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2021-10-16 02:34:30,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-10-16 02:34:30,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-10-16 02:34:30,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:34:30,434 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-16 02:34:30,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 02:34:30 BoogieIcfgContainer [2021-10-16 02:34:30,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-16 02:34:30,452 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-16 02:34:30,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-16 02:34:30,453 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-16 02:34:30,454 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:30:23" (3/4) ... [2021-10-16 02:34:30,457 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-16 02:34:30,457 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-16 02:34:30,458 INFO L168 Benchmark]: Toolchain (without parser) took 248391.56 ms. Allocated memory was 75.5 MB in the beginning and 243.3 MB in the end (delta: 167.8 MB). Free memory was 60.9 MB in the beginning and 208.6 MB in the end (delta: -147.6 MB). Peak memory consumption was 19.4 MB. Max. memory is 16.1 GB. [2021-10-16 02:34:30,459 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 75.5 MB. Free memory was 57.5 MB in the beginning and 57.5 MB in the end (delta: 63.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 02:34:30,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 516.60 ms. Allocated memory is still 75.5 MB. Free memory was 60.7 MB in the beginning and 53.0 MB in the end (delta: 7.8 MB). Peak memory consumption was 11.3 MB. Max. memory is 16.1 GB. [2021-10-16 02:34:30,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.54 ms. Allocated memory is still 75.5 MB. Free memory was 52.8 MB in the beginning and 50.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-16 02:34:30,460 INFO L168 Benchmark]: Boogie Preprocessor took 60.01 ms. Allocated memory is still 75.5 MB. Free memory was 50.5 MB in the beginning and 48.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-16 02:34:30,461 INFO L168 Benchmark]: RCFGBuilder took 1007.46 ms. Allocated memory is still 75.5 MB. Free memory was 48.2 MB in the beginning and 45.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. [2021-10-16 02:34:30,461 INFO L168 Benchmark]: TraceAbstraction took 246708.70 ms. Allocated memory was 75.5 MB in the beginning and 243.3 MB in the end (delta: 167.8 MB). Free memory was 45.3 MB in the beginning and 209.8 MB in the end (delta: -164.5 MB). Peak memory consumption was 146.1 MB. Max. memory is 16.1 GB. [2021-10-16 02:34:30,462 INFO L168 Benchmark]: Witness Printer took 5.15 ms. Allocated memory is still 243.3 MB. Free memory was 209.8 MB in the beginning and 208.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-16 02:34:30,464 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 75.5 MB. Free memory was 57.5 MB in the beginning and 57.5 MB in the end (delta: 63.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 516.60 ms. Allocated memory is still 75.5 MB. Free memory was 60.7 MB in the beginning and 53.0 MB in the end (delta: 7.8 MB). Peak memory consumption was 11.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 82.54 ms. Allocated memory is still 75.5 MB. Free memory was 52.8 MB in the beginning and 50.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 60.01 ms. Allocated memory is still 75.5 MB. Free memory was 50.5 MB in the beginning and 48.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1007.46 ms. Allocated memory is still 75.5 MB. Free memory was 48.2 MB in the beginning and 45.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 246708.70 ms. Allocated memory was 75.5 MB in the beginning and 243.3 MB in the end (delta: 167.8 MB). Free memory was 45.3 MB in the beginning and 209.8 MB in the end (delta: -164.5 MB). Peak memory consumption was 146.1 MB. Max. memory is 16.1 GB. * Witness Printer took 5.15 ms. Allocated memory is still 243.3 MB. Free memory was 209.8 MB in the beginning and 208.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. 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: 562]: 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: [L566] struct list_t *list = malloc(sizeof *list); [L567] list->first = ((void *)0) [L568] list->last = ((void *)0) [L569] struct list_t *list2 = malloc(sizeof *list2); [L570] list2->first = ((void *)0) [L571] list2->last = ((void *)0) [L572] char userInput; [L574] char userInput = __VERIFIER_nondet_char(); [L551] struct node_t *node = malloc(sizeof *node); [L552] node->data = input [L553] EXPR head->first [L553] head->first == ((void *)0) && head->last == ((void *)0) [L553] EXPR head->last [L553] head->first == ((void *)0) && head->last == ((void *)0) [L553] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L554] head->first = node [L555] head->last= node [L556] node->prev = ((void *)0) [L557] node->next = ((void *)0) [L576] COND TRUE __VERIFIER_nondet_int() [L574] char userInput = __VERIFIER_nondet_char(); [L551] struct node_t *node = malloc(sizeof *node); [L552] node->data = input [L553] EXPR head->first [L553] head->first == ((void *)0) && head->last == ((void *)0) [L553] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L560] EXPR head->last [L560] node->prev = head->last [L561] node->next = ((void *)0) [L562] EXPR head->last [L562] head->last->next = node - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 567]: 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: 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: 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: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: 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: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: 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: 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: 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: 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: 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: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: 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: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: 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: 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: 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: 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: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 590]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 590]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 593]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 593]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: 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, 167 locations, 85 error locations. Started 1 CEGAR loops. OverallTime: 246634.2ms, OverallIterations: 14, TraceHistogramMax: 2, EmptinessCheckTime: 19.2ms, AutomataDifference: 57101.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1086 SDtfs, 3302 SDslu, 1878 SDs, 0 SdLazy, 2452 SolverSat, 217 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 29568.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 248 SyntacticMatches, 15 SemanticMatches, 94 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 130507.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=3, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 146.8ms AutomataMinimizationTime, 13 MinimizatonAttempts, 710 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 167.9ms SsaConstructionTime, 905.9ms SatisfiabilityAnalysisTime, 115194.9ms InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 330 ConstructedInterpolants, 107 QuantifiedInterpolants, 5081 SizeOfPredicates, 66 NumberOfNonLiveVariables, 1130 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-10-16 02:34:30,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3830ffd-6e58-4517-8a4d-4afe6e944614/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...