./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan --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 8db9818917d4101818df459d2d32c905a41e37ef ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan --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 8db9818917d4101818df459d2d32c905a41e37ef ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 12:54:48,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 12:54:48,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 12:54:48,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 12:54:48,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 12:54:48,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 12:54:48,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 12:54:48,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 12:54:48,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 12:54:48,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 12:54:48,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 12:54:48,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 12:54:48,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 12:54:48,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 12:54:48,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 12:54:48,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 12:54:48,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 12:54:48,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 12:54:48,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 12:54:48,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 12:54:48,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 12:54:48,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 12:54:48,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 12:54:48,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 12:54:48,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 12:54:48,200 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 12:54:48,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 12:54:48,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 12:54:48,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 12:54:48,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 12:54:48,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 12:54:48,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 12:54:48,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 12:54:48,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 12:54:48,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 12:54:48,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 12:54:48,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 12:54:48,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 12:54:48,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 12:54:48,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 12:54:48,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 12:54:48,209 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-12-09 12:54:48,228 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 12:54:48,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 12:54:48,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 12:54:48,229 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 12:54:48,229 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 12:54:48,229 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 12:54:48,233 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 12:54:48,234 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 12:54:48,234 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 12:54:48,234 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 12:54:48,234 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 12:54:48,234 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 12:54:48,234 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 12:54:48,234 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 12:54:48,234 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 12:54:48,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 12:54:48,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 12:54:48,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 12:54:48,235 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 12:54:48,235 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 12:54:48,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 12:54:48,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 12:54:48,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 12:54:48,236 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 12:54:48,236 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 12:54:48,236 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 12:54:48,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 12:54:48,236 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 12:54:48,236 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 12:54:48,236 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 12:54:48,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 12:54:48,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 12:54:48,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 12:54:48,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 12:54:48,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 12:54:48,237 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 12:54:48,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 12:54:48,237 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 12:54:48,237 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 12:54:48,237 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-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/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-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan 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 -> 8db9818917d4101818df459d2d32c905a41e37ef [2020-12-09 12:54:48,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 12:54:48,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 12:54:48,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 12:54:48,414 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 12:54:48,415 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 12:54:48,415 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all.i [2020-12-09 12:54:48,455 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/data/99c8d36af/bee5206aae674801a61e31aa4579e73a/FLAGc45994eb6 [2020-12-09 12:54:48,847 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 12:54:48,847 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/sv-benchmarks/c/list-simple/sll2n_update_all.i [2020-12-09 12:54:48,856 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/data/99c8d36af/bee5206aae674801a61e31aa4579e73a/FLAGc45994eb6 [2020-12-09 12:54:48,865 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/data/99c8d36af/bee5206aae674801a61e31aa4579e73a [2020-12-09 12:54:48,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 12:54:48,872 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 12:54:48,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 12:54:48,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 12:54:48,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 12:54:48,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:54:48" (1/1) ... [2020-12-09 12:54:48,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556eea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:48, skipping insertion in model container [2020-12-09 12:54:48,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:54:48" (1/1) ... [2020-12-09 12:54:48,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 12:54:48,913 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 12:54:49,094 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2020-12-09 12:54:49,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 12:54:49,102 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 12:54:49,133 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2020-12-09 12:54:49,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 12:54:49,174 INFO L208 MainTranslator]: Completed translation [2020-12-09 12:54:49,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:49 WrapperNode [2020-12-09 12:54:49,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 12:54:49,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 12:54:49,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 12:54:49,175 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 12:54:49,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:49" (1/1) ... [2020-12-09 12:54:49,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:49" (1/1) ... [2020-12-09 12:54:49,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 12:54:49,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 12:54:49,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 12:54:49,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 12:54:49,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:49" (1/1) ... [2020-12-09 12:54:49,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:49" (1/1) ... [2020-12-09 12:54:49,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:49" (1/1) ... [2020-12-09 12:54:49,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:49" (1/1) ... [2020-12-09 12:54:49,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:49" (1/1) ... [2020-12-09 12:54:49,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:49" (1/1) ... [2020-12-09 12:54:49,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:49" (1/1) ... [2020-12-09 12:54:49,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 12:54:49,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 12:54:49,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 12:54:49,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 12:54:49,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 12:54:49,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-09 12:54:49,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 12:54:49,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 12:54:49,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-09 12:54:49,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 12:54:49,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 12:54:49,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 12:54:49,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 12:54:49,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 12:54:49,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 12:54:49,673 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 12:54:49,673 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2020-12-09 12:54:49,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:54:49 BoogieIcfgContainer [2020-12-09 12:54:49,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 12:54:49,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 12:54:49,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 12:54:49,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 12:54:49,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:54:48" (1/3) ... [2020-12-09 12:54:49,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cdb9791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:54:49, skipping insertion in model container [2020-12-09 12:54:49,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:49" (2/3) ... [2020-12-09 12:54:49,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cdb9791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:54:49, skipping insertion in model container [2020-12-09 12:54:49,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:54:49" (3/3) ... [2020-12-09 12:54:49,681 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2020-12-09 12:54:49,691 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 12:54:49,693 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2020-12-09 12:54:49,701 INFO L253 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2020-12-09 12:54:49,716 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 12:54:49,716 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 12:54:49,716 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 12:54:49,716 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 12:54:49,716 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 12:54:49,716 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 12:54:49,717 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 12:54:49,717 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 12:54:49,727 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-12-09 12:54:49,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 12:54:49,731 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:54:49,731 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 12:54:49,732 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:54:49,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:54:49,735 INFO L82 PathProgramCache]: Analyzing trace with hash 5461878, now seen corresponding path program 1 times [2020-12-09 12:54:49,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:54:49,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626477355] [2020-12-09 12:54:49,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:54:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:54:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:54:49,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626477355] [2020-12-09 12:54:49,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:54:49,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 12:54:49,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531998324] [2020-12-09 12:54:49,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 12:54:49,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:54:49,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 12:54:49,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:54:49,888 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2020-12-09 12:54:49,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:54:49,959 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2020-12-09 12:54:49,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 12:54:49,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-09 12:54:49,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:54:49,966 INFO L225 Difference]: With dead ends: 76 [2020-12-09 12:54:49,966 INFO L226 Difference]: Without dead ends: 73 [2020-12-09 12:54:49,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:54:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-12-09 12:54:49,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2020-12-09 12:54:49,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-12-09 12:54:49,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2020-12-09 12:54:49,995 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 4 [2020-12-09 12:54:49,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:54:49,995 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2020-12-09 12:54:49,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 12:54:50,000 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2020-12-09 12:54:50,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 12:54:50,001 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:54:50,001 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 12:54:50,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 12:54:50,001 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:54:50,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:54:50,002 INFO L82 PathProgramCache]: Analyzing trace with hash 5461879, now seen corresponding path program 1 times [2020-12-09 12:54:50,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:54:50,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469524769] [2020-12-09 12:54:50,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:54:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:54:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:54:50,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469524769] [2020-12-09 12:54:50,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:54:50,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 12:54:50,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819303850] [2020-12-09 12:54:50,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 12:54:50,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:54:50,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 12:54:50,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:54:50,053 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 3 states. [2020-12-09 12:54:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:54:50,095 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2020-12-09 12:54:50,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 12:54:50,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-09 12:54:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:54:50,097 INFO L225 Difference]: With dead ends: 71 [2020-12-09 12:54:50,097 INFO L226 Difference]: Without dead ends: 71 [2020-12-09 12:54:50,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:54:50,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-09 12:54:50,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 39. [2020-12-09 12:54:50,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-12-09 12:54:50,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2020-12-09 12:54:50,101 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 4 [2020-12-09 12:54:50,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:54:50,101 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2020-12-09 12:54:50,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 12:54:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-12-09 12:54:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 12:54:50,102 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:54:50,102 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 12:54:50,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 12:54:50,102 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:54:50,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:54:50,103 INFO L82 PathProgramCache]: Analyzing trace with hash 173939328, now seen corresponding path program 1 times [2020-12-09 12:54:50,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:54:50,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148504308] [2020-12-09 12:54:50,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:54:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:54:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:54:50,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148504308] [2020-12-09 12:54:50,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:54:50,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 12:54:50,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732772499] [2020-12-09 12:54:50,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 12:54:50,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:54:50,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 12:54:50,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:54:50,123 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 3 states. [2020-12-09 12:54:50,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:54:50,132 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-12-09 12:54:50,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 12:54:50,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 12:54:50,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:54:50,133 INFO L225 Difference]: With dead ends: 46 [2020-12-09 12:54:50,133 INFO L226 Difference]: Without dead ends: 46 [2020-12-09 12:54:50,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:54:50,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-12-09 12:54:50,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2020-12-09 12:54:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-12-09 12:54:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2020-12-09 12:54:50,137 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 5 [2020-12-09 12:54:50,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:54:50,137 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2020-12-09 12:54:50,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 12:54:50,137 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2020-12-09 12:54:50,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 12:54:50,138 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:54:50,138 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 12:54:50,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 12:54:50,138 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:54:50,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:54:50,138 INFO L82 PathProgramCache]: Analyzing trace with hash 953901427, now seen corresponding path program 1 times [2020-12-09 12:54:50,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:54:50,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620687201] [2020-12-09 12:54:50,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:54:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:54:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:54:50,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620687201] [2020-12-09 12:54:50,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:54:50,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 12:54:50,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153520429] [2020-12-09 12:54:50,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 12:54:50,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:54:50,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 12:54:50,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 12:54:50,173 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 4 states. [2020-12-09 12:54:50,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:54:50,228 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2020-12-09 12:54:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 12:54:50,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-12-09 12:54:50,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:54:50,229 INFO L225 Difference]: With dead ends: 54 [2020-12-09 12:54:50,229 INFO L226 Difference]: Without dead ends: 54 [2020-12-09 12:54:50,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:54:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-12-09 12:54:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2020-12-09 12:54:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-12-09 12:54:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2020-12-09 12:54:50,234 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 6 [2020-12-09 12:54:50,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:54:50,234 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2020-12-09 12:54:50,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 12:54:50,234 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-12-09 12:54:50,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 12:54:50,235 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:54:50,235 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 12:54:50,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 12:54:50,235 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:54:50,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:54:50,236 INFO L82 PathProgramCache]: Analyzing trace with hash 953901428, now seen corresponding path program 1 times [2020-12-09 12:54:50,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:54:50,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431811242] [2020-12-09 12:54:50,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:54:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:54:50,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:54:50,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431811242] [2020-12-09 12:54:50,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:54:50,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 12:54:50,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507064818] [2020-12-09 12:54:50,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 12:54:50,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:54:50,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 12:54:50,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 12:54:50,290 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 4 states. [2020-12-09 12:54:50,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:54:50,331 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2020-12-09 12:54:50,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 12:54:50,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-12-09 12:54:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:54:50,332 INFO L225 Difference]: With dead ends: 41 [2020-12-09 12:54:50,332 INFO L226 Difference]: Without dead ends: 41 [2020-12-09 12:54:50,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:54:50,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-12-09 12:54:50,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2020-12-09 12:54:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-12-09 12:54:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2020-12-09 12:54:50,337 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 6 [2020-12-09 12:54:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:54:50,337 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-12-09 12:54:50,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 12:54:50,337 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-12-09 12:54:50,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 12:54:50,338 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:54:50,338 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:54:50,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 12:54:50,338 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:54:50,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:54:50,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1211877575, now seen corresponding path program 1 times [2020-12-09 12:54:50,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:54:50,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817141057] [2020-12-09 12:54:50,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:54:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:54:50,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:54:50,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817141057] [2020-12-09 12:54:50,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326482177] [2020-12-09 12:54:50,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:54:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:54:50,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:54:50,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:54:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:54:50,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:54:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:54:50,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1514894337] [2020-12-09 12:54:50,525 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 12:54:50,525 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:54:50,528 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:54:50,532 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:54:50,533 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:54:50,735 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:54:51,733 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 12:54:52,364 WARN L197 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 108 [2020-12-09 12:54:52,979 WARN L197 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 129 [2020-12-09 12:54:53,096 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2020-12-09 12:54:53,574 WARN L197 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 88 [2020-12-09 12:54:53,947 WARN L197 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 107 [2020-12-09 12:54:54,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:54:54,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 11 [2020-12-09 12:54:54,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70536275] [2020-12-09 12:54:54,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 12:54:54,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:54:54,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 12:54:54,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-12-09 12:54:54,006 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 9 states. [2020-12-09 12:54:54,564 WARN L197 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 136 [2020-12-09 12:54:54,865 WARN L197 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 108 [2020-12-09 12:54:55,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:54:55,033 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2020-12-09 12:54:55,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 12:54:55,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2020-12-09 12:54:55,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:54:55,034 INFO L225 Difference]: With dead ends: 41 [2020-12-09 12:54:55,035 INFO L226 Difference]: Without dead ends: 41 [2020-12-09 12:54:55,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-12-09 12:54:55,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-12-09 12:54:55,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-12-09 12:54:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-12-09 12:54:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2020-12-09 12:54:55,039 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 10 [2020-12-09 12:54:55,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:54:55,039 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2020-12-09 12:54:55,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 12:54:55,039 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2020-12-09 12:54:55,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 12:54:55,040 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:54:55,040 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:54:55,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-12-09 12:54:55,242 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:54:55,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:54:55,243 INFO L82 PathProgramCache]: Analyzing trace with hash 452775265, now seen corresponding path program 1 times [2020-12-09 12:54:55,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:54:55,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622853725] [2020-12-09 12:54:55,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:54:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:54:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 12:54:55,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622853725] [2020-12-09 12:54:55,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736364292] [2020-12-09 12:54:55,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:54:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:54:55,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:54:55,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:54:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 12:54:55,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:54:55,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 12:54:55,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [333765042] [2020-12-09 12:54:55,398 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 12:54:55,398 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:54:55,399 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:54:55,399 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:54:55,399 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:54:55,502 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:54:56,483 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:54:56,622 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:54:56,880 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 12:54:57,356 WARN L197 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 108 [2020-12-09 12:54:57,959 WARN L197 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 129 [2020-12-09 12:54:58,115 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-12-09 12:54:58,264 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-09 12:54:58,853 WARN L197 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2020-12-09 12:54:59,498 WARN L197 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 103 [2020-12-09 12:54:59,893 WARN L197 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 107 [2020-12-09 12:54:59,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:54:59,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [3, 3, 3] total 12 [2020-12-09 12:54:59,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692459693] [2020-12-09 12:54:59,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 12:54:59,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:54:59,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 12:54:59,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-12-09 12:54:59,896 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 10 states. [2020-12-09 12:55:00,588 WARN L197 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 138 [2020-12-09 12:55:00,905 WARN L197 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 110 [2020-12-09 12:55:01,494 WARN L197 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 119 [2020-12-09 12:55:02,224 WARN L197 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 130 [2020-12-09 12:55:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:55:02,464 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2020-12-09 12:55:02,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-09 12:55:02,465 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2020-12-09 12:55:02,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:55:02,465 INFO L225 Difference]: With dead ends: 47 [2020-12-09 12:55:02,465 INFO L226 Difference]: Without dead ends: 47 [2020-12-09 12:55:02,465 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2020-12-09 12:55:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-12-09 12:55:02,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2020-12-09 12:55:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-12-09 12:55:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2020-12-09 12:55:02,468 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 13 [2020-12-09 12:55:02,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:55:02,468 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2020-12-09 12:55:02,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 12:55:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-12-09 12:55:02,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 12:55:02,468 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:55:02,468 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:55:02,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:02,670 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:55:02,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:55:02,671 INFO L82 PathProgramCache]: Analyzing trace with hash 452771972, now seen corresponding path program 1 times [2020-12-09 12:55:02,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:55:02,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734604971] [2020-12-09 12:55:02,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:55:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:02,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 12:55:02,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734604971] [2020-12-09 12:55:02,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151777828] [2020-12-09 12:55:02,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:02,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:55:02,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:55:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 12:55:02,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:55:02,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 12:55:02,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [913090535] [2020-12-09 12:55:02,784 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-12-09 12:55:02,784 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:55:02,785 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:55:02,785 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:55:02,785 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:55:02,857 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:02,864 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:02,870 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:03,394 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:03,487 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:03,779 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 12:55:04,107 WARN L197 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 94 [2020-12-09 12:55:04,578 WARN L197 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 108 [2020-12-09 12:55:05,459 WARN L197 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2020-12-09 12:55:06,114 WARN L197 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 103 [2020-12-09 12:55:06,526 WARN L197 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 107 [2020-12-09 12:55:06,882 WARN L197 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 89 [2020-12-09 12:55:06,884 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 12:55:06,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:55:06,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2020-12-09 12:55:06,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005020859] [2020-12-09 12:55:06,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 12:55:06,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:55:06,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 12:55:06,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-12-09 12:55:06,885 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 5 states. [2020-12-09 12:55:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:55:06,898 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-12-09 12:55:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 12:55:06,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-09 12:55:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:55:06,899 INFO L225 Difference]: With dead ends: 48 [2020-12-09 12:55:06,899 INFO L226 Difference]: Without dead ends: 48 [2020-12-09 12:55:06,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-12-09 12:55:06,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-12-09 12:55:06,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-12-09 12:55:06,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-09 12:55:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2020-12-09 12:55:06,902 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 13 [2020-12-09 12:55:06,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:55:06,902 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2020-12-09 12:55:06,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 12:55:06,903 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-12-09 12:55:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 12:55:06,903 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:55:06,903 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 12:55:07,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable139 [2020-12-09 12:55:07,105 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:55:07,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:55:07,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1543826371, now seen corresponding path program 2 times [2020-12-09 12:55:07,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:55:07,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412628127] [2020-12-09 12:55:07,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:55:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 12:55:07,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412628127] [2020-12-09 12:55:07,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336352414] [2020-12-09 12:55:07,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:07,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-09 12:55:07,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 12:55:07,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 12:55:07,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:55:07,226 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 12:55:07,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:55:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 12:55:07,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2097560736] [2020-12-09 12:55:07,237 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-12-09 12:55:07,237 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:55:07,237 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:55:07,237 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:55:07,237 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:55:07,294 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:08,202 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:08,323 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:08,643 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 12:55:09,013 WARN L197 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 94 [2020-12-09 12:55:09,585 WARN L197 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 108 [2020-12-09 12:55:10,233 WARN L197 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 129 [2020-12-09 12:55:10,401 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-12-09 12:55:10,573 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-09 12:55:11,247 WARN L197 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2020-12-09 12:55:11,974 WARN L197 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 103 [2020-12-09 12:55:12,420 WARN L197 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 107 [2020-12-09 12:55:12,832 WARN L197 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 89 [2020-12-09 12:55:12,832 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 12:55:12,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:55:12,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2020-12-09 12:55:12,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939840949] [2020-12-09 12:55:12,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 12:55:12,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:55:12,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 12:55:12,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-12-09 12:55:12,834 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 6 states. [2020-12-09 12:55:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:55:12,948 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2020-12-09 12:55:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:55:12,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-09 12:55:12,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:55:12,949 INFO L225 Difference]: With dead ends: 101 [2020-12-09 12:55:12,949 INFO L226 Difference]: Without dead ends: 101 [2020-12-09 12:55:12,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2020-12-09 12:55:12,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-12-09 12:55:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 51. [2020-12-09 12:55:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-09 12:55:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2020-12-09 12:55:12,952 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 18 [2020-12-09 12:55:12,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:55:12,952 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2020-12-09 12:55:12,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 12:55:12,952 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2020-12-09 12:55:12,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 12:55:12,953 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:55:12,953 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 12:55:13,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable232,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:13,155 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:55:13,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:55:13,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1543826370, now seen corresponding path program 1 times [2020-12-09 12:55:13,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:55:13,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196300342] [2020-12-09 12:55:13,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:55:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 12:55:13,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196300342] [2020-12-09 12:55:13,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815279687] [2020-12-09 12:55:13,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:13,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 31 conjunts are in the unsatisfiable core [2020-12-09 12:55:13,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:55:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 12:55:13,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:55:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 12:55:13,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [956040332] [2020-12-09 12:55:13,399 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-12-09 12:55:13,399 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:55:13,400 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:55:13,400 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:55:13,400 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:55:13,478 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:13,991 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:14,088 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:14,418 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 12:55:14,808 WARN L197 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 95 [2020-12-09 12:55:15,410 WARN L197 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 108 [2020-12-09 12:55:16,118 WARN L197 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 129 [2020-12-09 12:55:16,258 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2020-12-09 12:55:17,089 WARN L197 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2020-12-09 12:55:17,825 WARN L197 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 103 [2020-12-09 12:55:18,287 WARN L197 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 107 [2020-12-09 12:55:18,703 WARN L197 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 89 [2020-12-09 12:55:18,703 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 12:55:18,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:55:18,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2020-12-09 12:55:18,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180743364] [2020-12-09 12:55:18,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 12:55:18,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:55:18,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 12:55:18,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2020-12-09 12:55:18,705 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand 14 states. [2020-12-09 12:55:18,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:55:18,855 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2020-12-09 12:55:18,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:55:18,855 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-12-09 12:55:18,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:55:18,855 INFO L225 Difference]: With dead ends: 75 [2020-12-09 12:55:18,856 INFO L226 Difference]: Without dead ends: 75 [2020-12-09 12:55:18,856 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2020-12-09 12:55:18,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-12-09 12:55:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 51. [2020-12-09 12:55:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-09 12:55:18,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-12-09 12:55:18,858 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 18 [2020-12-09 12:55:18,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:55:18,859 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-12-09 12:55:18,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 12:55:18,859 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-12-09 12:55:18,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 12:55:18,859 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:55:18,859 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 12:55:19,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable320 [2020-12-09 12:55:19,061 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:55:19,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:55:19,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1853330022, now seen corresponding path program 1 times [2020-12-09 12:55:19,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:55:19,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24011250] [2020-12-09 12:55:19,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:55:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:55:19,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24011250] [2020-12-09 12:55:19,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647907473] [2020-12-09 12:55:19,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:19,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 47 conjunts are in the unsatisfiable core [2020-12-09 12:55:19,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:55:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:55:19,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:55:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:55:26,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [734112391] [2020-12-09 12:55:26,264 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-12-09 12:55:26,264 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:55:26,264 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:55:26,264 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:55:26,264 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:55:26,329 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:26,350 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:26,357 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:26,913 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:26,999 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:27,429 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-12-09 12:55:27,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:55:27,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 21 [2020-12-09 12:55:27,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709592873] [2020-12-09 12:55:27,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 12:55:27,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:55:27,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 12:55:27,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=399, Unknown=1, NotChecked=0, Total=462 [2020-12-09 12:55:27,432 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 22 states. [2020-12-09 12:55:28,892 WARN L197 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2020-12-09 12:55:28,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:55:28,961 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2020-12-09 12:55:28,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 12:55:28,961 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 20 [2020-12-09 12:55:28,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:55:28,963 INFO L225 Difference]: With dead ends: 79 [2020-12-09 12:55:28,963 INFO L226 Difference]: Without dead ends: 79 [2020-12-09 12:55:28,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=214, Invalid=715, Unknown=1, NotChecked=0, Total=930 [2020-12-09 12:55:28,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-09 12:55:28,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2020-12-09 12:55:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-09 12:55:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2020-12-09 12:55:28,966 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 20 [2020-12-09 12:55:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:55:28,966 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2020-12-09 12:55:28,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 12:55:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2020-12-09 12:55:28,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 12:55:28,967 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:55:28,967 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 12:55:29,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable408,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:29,168 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:55:29,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:55:29,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1853330021, now seen corresponding path program 1 times [2020-12-09 12:55:29,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:55:29,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509249300] [2020-12-09 12:55:29,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:55:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:55:29,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509249300] [2020-12-09 12:55:29,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880296745] [2020-12-09 12:55:29,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:29,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 59 conjunts are in the unsatisfiable core [2020-12-09 12:55:29,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:55:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:55:29,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:55:30,728 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_43 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_43) (let ((.cse0 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_43 v_DerPreprocessor_2) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_43 v_DerPreprocessor_4) .cse0)))))) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_43 Int) (v_DerPreprocessor_3 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_43) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_43 v_DerPreprocessor_3) (+ c_ULTIMATE.start_main_~s~0.offset 4)))))) is different from false [2020-12-09 12:55:31,513 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_43 Int) (v_DerPreprocessor_3 Int)) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_43) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_43 v_DerPreprocessor_3) (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))))) (forall ((v_prenex_1 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int)) (or (let ((.cse0 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_1 v_DerPreprocessor_2) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_1 v_DerPreprocessor_4) .cse0)))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_1)))) is different from false [2020-12-09 12:55:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-12-09 12:55:31,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1875079780] [2020-12-09 12:55:31,804 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-12-09 12:55:31,804 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:55:31,804 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:55:31,804 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:55:31,804 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:55:31,870 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:31,888 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:31,894 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:32,486 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:32,606 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:33,056 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-12-09 12:55:33,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:55:33,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2020-12-09 12:55:33,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915625118] [2020-12-09 12:55:33,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-12-09 12:55:33,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:55:33,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-12-09 12:55:33,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=885, Unknown=2, NotChecked=122, Total=1122 [2020-12-09 12:55:33,059 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 34 states. [2020-12-09 12:55:34,007 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base)) (.cse1 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse0 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base)) (.cse4 (select .cse3 .cse1))) (and (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_43 Int) (v_DerPreprocessor_3 Int)) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_43) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_43 v_DerPreprocessor_3) (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))))) (= (select |c_#length| (select .cse0 .cse1)) 8) (= c_ULTIMATE.start_sll_create_~head~0.offset 0) (= (select |c_#valid| c_ULTIMATE.start_sll_create_~new_head~0.base) 1) (= 8 (select |c_#length| c_ULTIMATE.start_sll_create_~new_head~0.base)) (= (select |c_#valid| c_ULTIMATE.start_sll_create_~head~0.base) 1) (= 8 (select |c_#length| (select .cse0 4))) (= (select |c_#length| c_ULTIMATE.start_sll_create_~head~0.base) 8) (forall ((v_prenex_1 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int)) (or (let ((.cse2 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_1 v_DerPreprocessor_2) .cse2) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_1 v_DerPreprocessor_4) .cse2)))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_1))) (= (select |c_#valid| c_ULTIMATE.start_node_create_~temp~0.base) 1) (<= c_ULTIMATE.start_sll_create_~head~0.offset 0) (= c_ULTIMATE.start_sll_create_~new_head~0.offset 0) (= c_ULTIMATE.start_node_create_~temp~0.offset 0) (= (select .cse3 4) 0) (<= 0 c_ULTIMATE.start_sll_create_~head~0.offset) (= 8 (select |c_#length| c_ULTIMATE.start_node_create_~temp~0.base)) (<= .cse4 0) (<= 0 .cse4)))) is different from false [2020-12-09 12:55:34,794 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base)) (.cse1 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse0 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base)) (.cse2 (select .cse4 .cse1))) (and (= (select |c_#length| (select .cse0 4)) 8) (= (select |c_#length| (select .cse0 .cse1)) 8) (<= 0 .cse2) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_43 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_43) (let ((.cse3 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_43 v_DerPreprocessor_2) .cse3) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_43 v_DerPreprocessor_4) .cse3)))))) (= c_ULTIMATE.start_main_~s~0.offset 0) (<= .cse2 0) (= (select .cse4 4) 0) (= (select |c_#length| c_ULTIMATE.start_main_~s~0.base) 8) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_43 Int) (v_DerPreprocessor_3 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_43) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_43 v_DerPreprocessor_3) (+ c_ULTIMATE.start_main_~s~0.offset 4)))))))) is different from false [2020-12-09 12:55:35,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:55:35,339 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2020-12-09 12:55:35,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 12:55:35,340 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 20 [2020-12-09 12:55:35,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:55:35,341 INFO L225 Difference]: With dead ends: 122 [2020-12-09 12:55:35,341 INFO L226 Difference]: Without dead ends: 122 [2020-12-09 12:55:35,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=221, Invalid=1351, Unknown=4, NotChecked=316, Total=1892 [2020-12-09 12:55:35,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-12-09 12:55:35,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 60. [2020-12-09 12:55:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-12-09 12:55:35,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2020-12-09 12:55:35,345 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 20 [2020-12-09 12:55:35,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:55:35,345 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2020-12-09 12:55:35,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-12-09 12:55:35,345 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2020-12-09 12:55:35,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 12:55:35,346 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:55:35,346 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2020-12-09 12:55:35,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable484,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:35,547 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:55:35,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:55:35,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1358207514, now seen corresponding path program 2 times [2020-12-09 12:55:35,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:55:35,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407936912] [2020-12-09 12:55:35,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:55:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 12:55:35,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407936912] [2020-12-09 12:55:35,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750848070] [2020-12-09 12:55:35,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:35,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 12:55:35,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 12:55:35,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 12:55:35,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:55:35,673 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 12:55:35,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:55:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 12:55:35,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1717475634] [2020-12-09 12:55:35,689 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-12-09 12:55:35,689 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:55:35,689 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:55:35,689 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:55:35,690 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:55:35,749 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:36,275 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:36,383 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:36,754 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-12-09 12:55:36,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:55:36,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2020-12-09 12:55:36,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317522132] [2020-12-09 12:55:36,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 12:55:36,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:55:36,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 12:55:36,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 12:55:36,756 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand 7 states. [2020-12-09 12:55:36,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:55:36,817 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2020-12-09 12:55:36,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 12:55:36,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-12-09 12:55:36,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:55:36,818 INFO L225 Difference]: With dead ends: 87 [2020-12-09 12:55:36,818 INFO L226 Difference]: Without dead ends: 87 [2020-12-09 12:55:36,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-12-09 12:55:36,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-12-09 12:55:36,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 49. [2020-12-09 12:55:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-12-09 12:55:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2020-12-09 12:55:36,820 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2020-12-09 12:55:36,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:55:36,820 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2020-12-09 12:55:36,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 12:55:36,821 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-12-09 12:55:36,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 12:55:36,821 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:55:36,821 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:55:37,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable560,9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:37,022 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:55:37,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:55:37,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1696617699, now seen corresponding path program 1 times [2020-12-09 12:55:37,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:55:37,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854357070] [2020-12-09 12:55:37,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:55:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:37,058 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 12:55:37,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854357070] [2020-12-09 12:55:37,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212808499] [2020-12-09 12:55:37,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:37,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 12:55:37,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:55:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 12:55:37,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:55:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 12:55:37,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 12:55:37,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [4] total 7 [2020-12-09 12:55:37,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846205638] [2020-12-09 12:55:37,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 12:55:37,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:55:37,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 12:55:37,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-09 12:55:37,167 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 7 states. [2020-12-09 12:55:37,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:55:37,279 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2020-12-09 12:55:37,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:55:37,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-12-09 12:55:37,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:55:37,280 INFO L225 Difference]: With dead ends: 79 [2020-12-09 12:55:37,280 INFO L226 Difference]: Without dead ends: 79 [2020-12-09 12:55:37,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-12-09 12:55:37,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-09 12:55:37,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 52. [2020-12-09 12:55:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-09 12:55:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2020-12-09 12:55:37,282 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 24 [2020-12-09 12:55:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:55:37,282 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2020-12-09 12:55:37,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 12:55:37,283 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2020-12-09 12:55:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 12:55:37,283 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:55:37,283 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:55:37,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable634,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:37,484 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:55:37,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:55:37,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1696617698, now seen corresponding path program 1 times [2020-12-09 12:55:37,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:55:37,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021925428] [2020-12-09 12:55:37,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:55:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 12:55:37,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021925428] [2020-12-09 12:55:37,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:55:37,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 12:55:37,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256847467] [2020-12-09 12:55:37,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 12:55:37,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:55:37,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 12:55:37,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 12:55:37,539 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 7 states. [2020-12-09 12:55:37,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:55:37,655 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2020-12-09 12:55:37,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:55:37,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-12-09 12:55:37,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:55:37,656 INFO L225 Difference]: With dead ends: 68 [2020-12-09 12:55:37,656 INFO L226 Difference]: Without dead ends: 68 [2020-12-09 12:55:37,656 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-09 12:55:37,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-12-09 12:55:37,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 52. [2020-12-09 12:55:37,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-09 12:55:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2020-12-09 12:55:37,658 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 24 [2020-12-09 12:55:37,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:55:37,658 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2020-12-09 12:55:37,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 12:55:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2020-12-09 12:55:37,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 12:55:37,659 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:55:37,659 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:55:37,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable635 [2020-12-09 12:55:37,659 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:55:37,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:55:37,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1696534824, now seen corresponding path program 1 times [2020-12-09 12:55:37,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:55:37,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096110787] [2020-12-09 12:55:37,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:55:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-09 12:55:37,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096110787] [2020-12-09 12:55:37,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:55:37,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 12:55:37,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122958936] [2020-12-09 12:55:37,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 12:55:37,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:55:37,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 12:55:37,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 12:55:37,684 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 4 states. [2020-12-09 12:55:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:55:37,702 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2020-12-09 12:55:37,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 12:55:37,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-12-09 12:55:37,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:55:37,703 INFO L225 Difference]: With dead ends: 67 [2020-12-09 12:55:37,703 INFO L226 Difference]: Without dead ends: 67 [2020-12-09 12:55:37,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 12:55:37,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-12-09 12:55:37,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2020-12-09 12:55:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-09 12:55:37,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-12-09 12:55:37,704 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 24 [2020-12-09 12:55:37,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:55:37,705 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-12-09 12:55:37,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 12:55:37,705 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-12-09 12:55:37,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 12:55:37,705 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:55:37,705 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2020-12-09 12:55:37,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable636 [2020-12-09 12:55:37,705 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:55:37,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:55:37,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1161575840, now seen corresponding path program 3 times [2020-12-09 12:55:37,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:55:37,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712507747] [2020-12-09 12:55:37,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:55:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 12:55:37,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712507747] [2020-12-09 12:55:37,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068109117] [2020-12-09 12:55:37,747 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:37,797 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 12:55:37,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 12:55:37,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 12:55:37,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:55:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 12:55:37,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:55:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 12:55:37,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1824511876] [2020-12-09 12:55:37,858 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-12-09 12:55:37,858 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:55:37,858 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:55:37,858 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:55:37,859 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:55:37,939 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:38,483 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:38,585 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:38,979 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-12-09 12:55:38,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:55:38,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 11 [2020-12-09 12:55:38,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524032893] [2020-12-09 12:55:38,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 12:55:38,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:55:38,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 12:55:38,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-09 12:55:38,981 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 11 states. [2020-12-09 12:55:39,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:55:39,033 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2020-12-09 12:55:39,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:55:39,033 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-12-09 12:55:39,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:55:39,034 INFO L225 Difference]: With dead ends: 62 [2020-12-09 12:55:39,034 INFO L226 Difference]: Without dead ends: 62 [2020-12-09 12:55:39,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-12-09 12:55:39,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-12-09 12:55:39,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2020-12-09 12:55:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 12:55:39,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2020-12-09 12:55:39,035 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 25 [2020-12-09 12:55:39,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:55:39,036 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2020-12-09 12:55:39,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 12:55:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2020-12-09 12:55:39,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 12:55:39,036 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:55:39,036 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:55:39,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable637,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:39,237 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:55:39,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:55:39,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1638022872, now seen corresponding path program 1 times [2020-12-09 12:55:39,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:55:39,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256298238] [2020-12-09 12:55:39,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:55:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:55:39,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256298238] [2020-12-09 12:55:39,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806272070] [2020-12-09 12:55:39,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:39,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 84 conjunts are in the unsatisfiable core [2020-12-09 12:55:39,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:55:40,169 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:55:40,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:55:41,160 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_sll_update_at_~data Int) (ULTIMATE.start_sll_update_at_~head.offset Int)) (<= (select (select (store |c_#memory_int| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_int| c_ULTIMATE.start_sll_update_at_~head.base) ULTIMATE.start_sll_update_at_~head.offset ULTIMATE.start_sll_update_at_~data)) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset) c_ULTIMATE.start_main_~len~0)) (forall ((v_prenex_4 Int) (v_prenex_5 Int)) (<= c_ULTIMATE.start_main_~len~0 (select (select (store |c_#memory_int| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_int| c_ULTIMATE.start_sll_update_at_~head.base) v_prenex_5 v_prenex_4)) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)))) is different from false [2020-12-09 12:55:42,357 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_sll_update_at_~data Int) (v_subst_1 Int)) (<= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) (+ c_ULTIMATE.start_sll_update_at_~head.offset 4)))) (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) v_subst_1 ULTIMATE.start_sll_update_at_~data))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset) c_ULTIMATE.start_main_~len~0)) (forall ((v_prenex_4 Int) (v_prenex_5 Int)) (<= c_ULTIMATE.start_main_~len~0 (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) (+ c_ULTIMATE.start_sll_update_at_~head.offset 4)))) (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) v_prenex_5 v_prenex_4))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)))) is different from false [2020-12-09 12:55:43,382 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_4 Int) (v_prenex_5 Int)) (<= c_ULTIMATE.start_main_~len~0 (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (+ c_ULTIMATE.start_main_~s~0.offset 4)))) (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) v_prenex_5 v_prenex_4))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (forall ((ULTIMATE.start_sll_update_at_~data Int) (v_subst_1 Int)) (<= (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (+ c_ULTIMATE.start_main_~s~0.offset 4)))) (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) v_subst_1 ULTIMATE.start_sll_update_at_~data))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset) c_ULTIMATE.start_main_~len~0))) is different from false [2020-12-09 12:55:43,531 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2020-12-09 12:55:43,646 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2020-12-09 12:55:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2020-12-09 12:55:43,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [178751529] [2020-12-09 12:55:43,914 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2020-12-09 12:55:43,915 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:55:43,915 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:55:43,915 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:55:43,915 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:55:43,991 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:44,274 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:44,312 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:44,901 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:45,221 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-12-09 12:55:45,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:55:45,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 46 [2020-12-09 12:55:45,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247890381] [2020-12-09 12:55:45,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 46 states [2020-12-09 12:55:45,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:55:45,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2020-12-09 12:55:45,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1665, Unknown=3, NotChecked=252, Total=2070 [2020-12-09 12:55:45,223 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 46 states. [2020-12-09 12:55:46,692 WARN L197 SmtUtils]: Spent 923.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2020-12-09 12:55:47,756 WARN L197 SmtUtils]: Spent 961.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2020-12-09 12:55:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:55:48,448 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2020-12-09 12:55:48,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-09 12:55:48,448 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 26 [2020-12-09 12:55:48,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:55:48,449 INFO L225 Difference]: With dead ends: 104 [2020-12-09 12:55:48,449 INFO L226 Difference]: Without dead ends: 104 [2020-12-09 12:55:48,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=608, Invalid=3307, Unknown=3, NotChecked=372, Total=4290 [2020-12-09 12:55:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-12-09 12:55:48,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 57. [2020-12-09 12:55:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-12-09 12:55:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2020-12-09 12:55:48,451 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 26 [2020-12-09 12:55:48,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:55:48,452 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2020-12-09 12:55:48,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2020-12-09 12:55:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2020-12-09 12:55:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 12:55:48,452 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:55:48,452 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:55:48,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable711 [2020-12-09 12:55:48,653 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:55:48,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:55:48,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1635842168, now seen corresponding path program 1 times [2020-12-09 12:55:48,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:55:48,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544702657] [2020-12-09 12:55:48,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:55:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-09 12:55:48,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544702657] [2020-12-09 12:55:48,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:55:48,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 12:55:48,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494076945] [2020-12-09 12:55:48,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 12:55:48,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:55:48,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 12:55:48,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 12:55:48,711 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 4 states. [2020-12-09 12:55:48,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:55:48,733 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2020-12-09 12:55:48,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 12:55:48,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-12-09 12:55:48,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:55:48,734 INFO L225 Difference]: With dead ends: 64 [2020-12-09 12:55:48,734 INFO L226 Difference]: Without dead ends: 64 [2020-12-09 12:55:48,734 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:55:48,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-09 12:55:48,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2020-12-09 12:55:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-09 12:55:48,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2020-12-09 12:55:48,739 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 26 [2020-12-09 12:55:48,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:55:48,739 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2020-12-09 12:55:48,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 12:55:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-12-09 12:55:48,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 12:55:48,739 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:55:48,739 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:55:48,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable774 [2020-12-09 12:55:48,739 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:55:48,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:55:48,740 INFO L82 PathProgramCache]: Analyzing trace with hash -2111674579, now seen corresponding path program 1 times [2020-12-09 12:55:48,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:55:48,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516820069] [2020-12-09 12:55:48,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:55:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 12:55:48,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516820069] [2020-12-09 12:55:48,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:55:48,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 12:55:48,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499794003] [2020-12-09 12:55:48,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 12:55:48,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:55:48,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 12:55:48,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-09 12:55:48,788 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 8 states. [2020-12-09 12:55:48,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:55:48,889 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2020-12-09 12:55:48,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:55:48,889 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-12-09 12:55:48,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:55:48,890 INFO L225 Difference]: With dead ends: 61 [2020-12-09 12:55:48,890 INFO L226 Difference]: Without dead ends: 61 [2020-12-09 12:55:48,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-12-09 12:55:48,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-12-09 12:55:48,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2020-12-09 12:55:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-09 12:55:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2020-12-09 12:55:48,891 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 28 [2020-12-09 12:55:48,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:55:48,891 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2020-12-09 12:55:48,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 12:55:48,891 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2020-12-09 12:55:48,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 12:55:48,892 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:55:48,892 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:55:48,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable775 [2020-12-09 12:55:48,892 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:55:48,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:55:48,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2111676022, now seen corresponding path program 1 times [2020-12-09 12:55:48,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:55:48,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734275147] [2020-12-09 12:55:48,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:55:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-09 12:55:48,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734275147] [2020-12-09 12:55:48,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136956768] [2020-12-09 12:55:48,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:48,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 12:55:48,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:55:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-09 12:55:49,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:55:49,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-09 12:55:49,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1416214779] [2020-12-09 12:55:49,066 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-12-09 12:55:49,066 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:55:49,067 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:55:49,067 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:55:49,067 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:55:49,126 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:49,135 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:49,155 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:49,444 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:49,483 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:50,050 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:50,355 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-12-09 12:55:50,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:55:50,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2020-12-09 12:55:50,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232232802] [2020-12-09 12:55:50,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 12:55:50,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:55:50,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 12:55:50,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-09 12:55:50,356 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 10 states. [2020-12-09 12:55:50,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:55:50,494 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2020-12-09 12:55:50,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 12:55:50,494 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-12-09 12:55:50,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:55:50,494 INFO L225 Difference]: With dead ends: 59 [2020-12-09 12:55:50,494 INFO L226 Difference]: Without dead ends: 59 [2020-12-09 12:55:50,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2020-12-09 12:55:50,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-12-09 12:55:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2020-12-09 12:55:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-09 12:55:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2020-12-09 12:55:50,496 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 28 [2020-12-09 12:55:50,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:55:50,496 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2020-12-09 12:55:50,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 12:55:50,496 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2020-12-09 12:55:50,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-09 12:55:50,496 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:55:50,496 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:55:50,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable776,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:50,697 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:55:50,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:55:50,698 INFO L82 PathProgramCache]: Analyzing trace with hash 2120676845, now seen corresponding path program 1 times [2020-12-09 12:55:50,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:55:50,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515678659] [2020-12-09 12:55:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:55:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:50,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-09 12:55:50,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515678659] [2020-12-09 12:55:50,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654760323] [2020-12-09 12:55:50,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:50,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:55:50,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:55:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-09 12:55:50,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:55:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-09 12:55:50,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1302865851] [2020-12-09 12:55:50,860 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2020-12-09 12:55:50,860 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:55:50,861 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:55:50,861 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:55:50,861 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:55:50,929 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:50,936 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:50,943 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:51,221 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:51,265 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:51,275 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:51,283 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:51,890 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 12:55:52,176 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-12-09 12:55:52,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:55:52,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2020-12-09 12:55:52,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282535488] [2020-12-09 12:55:52,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 12:55:52,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:55:52,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 12:55:52,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 12:55:52,177 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 6 states. [2020-12-09 12:55:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:55:52,216 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2020-12-09 12:55:52,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 12:55:52,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-12-09 12:55:52,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:55:52,217 INFO L225 Difference]: With dead ends: 52 [2020-12-09 12:55:52,217 INFO L226 Difference]: Without dead ends: 52 [2020-12-09 12:55:52,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-09 12:55:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-12-09 12:55:52,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-12-09 12:55:52,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-09 12:55:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2020-12-09 12:55:52,218 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 30 [2020-12-09 12:55:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:55:52,218 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2020-12-09 12:55:52,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 12:55:52,219 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2020-12-09 12:55:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-09 12:55:52,219 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:55:52,219 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:55:52,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable839 [2020-12-09 12:55:52,420 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:55:52,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:55:52,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2118496141, now seen corresponding path program 1 times [2020-12-09 12:55:52,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:55:52,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831191128] [2020-12-09 12:55:52,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:55:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:55:52,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831191128] [2020-12-09 12:55:52,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551279834] [2020-12-09 12:55:52,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:55:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:55:52,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 60 conjunts are in the unsatisfiable core [2020-12-09 12:55:52,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:55:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 12:55:53,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:56:06,251 WARN L197 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 22 [2020-12-09 12:56:06,920 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_8 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_101 Int)) (= (select |c_#valid| (let ((.cse1 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse1))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_101 v_DerPreprocessor_8))) c_ULTIMATE.start_main_~s~0.base) .cse1))) 1)) is different from false [2020-12-09 12:56:08,933 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_101 Int)) (= (select |c_#valid| (let ((.cse2 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_9)))) (let ((.cse1 (select (select .cse0 c_ULTIMATE.start_main_~s~0.base) .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_ULTIMATE.start_sll_update_at_~head.offset_101 v_DerPreprocessor_8)))) c_ULTIMATE.start_main_~s~0.base) .cse2))) 1)) is different from false [2020-12-09 12:56:10,392 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_103 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_101 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_103) (= (select |c_#valid| (let ((.cse3 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_103 v_DerPreprocessor_9))) (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base .cse2)) (.cse1 (select .cse2 .cse3))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_ULTIMATE.start_sll_update_at_~head.offset_101 v_DerPreprocessor_8)))) c_ULTIMATE.start_main_~s~0.base) .cse3))) 1))) is different from false [2020-12-09 12:56:11,593 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_103 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_101 Int)) (or (= (select |c_#valid| (let ((.cse3 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_103 v_DerPreprocessor_9))) (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base .cse2)) (.cse1 (select .cse2 .cse3))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_ULTIMATE.start_sll_update_at_~head.offset_101 v_DerPreprocessor_8)))) c_ULTIMATE.start_sll_create_~head~0.base) .cse3))) 1) (< c_ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_103))) is different from false [2020-12-09 12:56:11,599 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2020-12-09 12:56:11,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [416910853] [2020-12-09 12:56:11,600 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2020-12-09 12:56:11,600 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:56:11,600 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:56:11,600 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:56:11,600 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:56:11,605 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@22e5ea23 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:568) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:441) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:239) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:313) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:153) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-12-09 12:56:11,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-09 12:56:11,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-12-09 12:56:11,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632969552] [2020-12-09 12:56:11,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-09 12:56:11,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:56:11,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-09 12:56:11,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1153, Unknown=12, NotChecked=284, Total=1560 [2020-12-09 12:56:11,606 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 20 states. [2020-12-09 12:56:11,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-09 12:56:11,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable902,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:56:11,808 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@22e5ea23 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:356) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:204) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:61) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:63) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1064) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:966) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:187) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:743) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:674) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-12-09 12:56:11,813 INFO L168 Benchmark]: Toolchain (without parser) took 82940.45 ms. Allocated memory was 107.0 MB in the beginning and 188.7 MB in the end (delta: 81.8 MB). Free memory was 87.0 MB in the beginning and 48.4 MB in the end (delta: 38.6 MB). Peak memory consumption was 119.3 MB. Max. memory is 16.1 GB. [2020-12-09 12:56:11,814 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 73.4 MB. Free memory is still 48.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 12:56:11,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.35 ms. Allocated memory is still 107.0 MB. Free memory was 87.0 MB in the beginning and 67.2 MB in the end (delta: 19.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-12-09 12:56:11,815 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.12 ms. Allocated memory is still 107.0 MB. Free memory was 67.2 MB in the beginning and 65.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 12:56:11,815 INFO L168 Benchmark]: Boogie Preprocessor took 23.88 ms. Allocated memory is still 107.0 MB. Free memory was 65.1 MB in the beginning and 63.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 12:56:11,816 INFO L168 Benchmark]: RCFGBuilder took 442.27 ms. Allocated memory is still 107.0 MB. Free memory was 63.4 MB in the beginning and 64.0 MB in the end (delta: -605.8 kB). Peak memory consumption was 25.7 MB. Max. memory is 16.1 GB. [2020-12-09 12:56:11,817 INFO L168 Benchmark]: TraceAbstraction took 82135.70 ms. Allocated memory was 107.0 MB in the beginning and 188.7 MB in the end (delta: 81.8 MB). Free memory was 63.6 MB in the beginning and 48.4 MB in the end (delta: 15.2 MB). Peak memory consumption was 97.5 MB. Max. memory is 16.1 GB. [2020-12-09 12:56:11,820 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.15 ms. Allocated memory is still 73.4 MB. Free memory is still 48.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 301.35 ms. Allocated memory is still 107.0 MB. Free memory was 87.0 MB in the beginning and 67.2 MB in the end (delta: 19.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 33.12 ms. Allocated memory is still 107.0 MB. Free memory was 67.2 MB in the beginning and 65.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 23.88 ms. Allocated memory is still 107.0 MB. Free memory was 65.1 MB in the beginning and 63.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 442.27 ms. Allocated memory is still 107.0 MB. Free memory was 63.4 MB in the beginning and 64.0 MB in the end (delta: -605.8 kB). Peak memory consumption was 25.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 82135.70 ms. Allocated memory was 107.0 MB in the beginning and 188.7 MB in the end (delta: 81.8 MB). Free memory was 63.6 MB in the beginning and 48.4 MB in the end (delta: 15.2 MB). Peak memory consumption was 97.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@22e5ea23 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@22e5ea23: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-09 12:56:13,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 12:56:13,384 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 12:56:13,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 12:56:13,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 12:56:13,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 12:56:13,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 12:56:13,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 12:56:13,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 12:56:13,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 12:56:13,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 12:56:13,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 12:56:13,425 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 12:56:13,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 12:56:13,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 12:56:13,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 12:56:13,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 12:56:13,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 12:56:13,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 12:56:13,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 12:56:13,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 12:56:13,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 12:56:13,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 12:56:13,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 12:56:13,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 12:56:13,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 12:56:13,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 12:56:13,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 12:56:13,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 12:56:13,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 12:56:13,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 12:56:13,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 12:56:13,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 12:56:13,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 12:56:13,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 12:56:13,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 12:56:13,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 12:56:13,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 12:56:13,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 12:56:13,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 12:56:13,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 12:56:13,455 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2020-12-09 12:56:13,480 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 12:56:13,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 12:56:13,481 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 12:56:13,481 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 12:56:13,481 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 12:56:13,481 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 12:56:13,482 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 12:56:13,482 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 12:56:13,482 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 12:56:13,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 12:56:13,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 12:56:13,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 12:56:13,483 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 12:56:13,483 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 12:56:13,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 12:56:13,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 12:56:13,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 12:56:13,483 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 12:56:13,484 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 12:56:13,484 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 12:56:13,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 12:56:13,484 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 12:56:13,484 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 12:56:13,484 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 12:56:13,484 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 12:56:13,485 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 12:56:13,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 12:56:13,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 12:56:13,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 12:56:13,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 12:56:13,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 12:56:13,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 12:56:13,486 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 12:56:13,486 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 12:56:13,486 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 12:56:13,486 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 12:56:13,486 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-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/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-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan 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 -> 8db9818917d4101818df459d2d32c905a41e37ef [2020-12-09 12:56:13,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 12:56:13,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 12:56:13,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 12:56:13,728 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 12:56:13,729 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 12:56:13,729 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all.i [2020-12-09 12:56:13,774 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/data/29fb8b2a8/c99dce9dffc34a94a3c7af42c4821d6c/FLAG2dee82b07 [2020-12-09 12:56:14,177 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 12:56:14,178 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/sv-benchmarks/c/list-simple/sll2n_update_all.i [2020-12-09 12:56:14,187 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/data/29fb8b2a8/c99dce9dffc34a94a3c7af42c4821d6c/FLAG2dee82b07 [2020-12-09 12:56:14,197 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/data/29fb8b2a8/c99dce9dffc34a94a3c7af42c4821d6c [2020-12-09 12:56:14,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 12:56:14,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 12:56:14,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 12:56:14,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 12:56:14,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 12:56:14,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:56:14" (1/1) ... [2020-12-09 12:56:14,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5030aed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:14, skipping insertion in model container [2020-12-09 12:56:14,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:56:14" (1/1) ... [2020-12-09 12:56:14,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 12:56:14,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 12:56:14,458 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2020-12-09 12:56:14,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 12:56:14,472 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 12:56:14,514 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2020-12-09 12:56:14,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 12:56:14,573 INFO L208 MainTranslator]: Completed translation [2020-12-09 12:56:14,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:14 WrapperNode [2020-12-09 12:56:14,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 12:56:14,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 12:56:14,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 12:56:14,575 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 12:56:14,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:14" (1/1) ... [2020-12-09 12:56:14,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:14" (1/1) ... [2020-12-09 12:56:14,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 12:56:14,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 12:56:14,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 12:56:14,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 12:56:14,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:14" (1/1) ... [2020-12-09 12:56:14,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:14" (1/1) ... [2020-12-09 12:56:14,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:14" (1/1) ... [2020-12-09 12:56:14,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:14" (1/1) ... [2020-12-09 12:56:14,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:14" (1/1) ... [2020-12-09 12:56:14,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:14" (1/1) ... [2020-12-09 12:56:14,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:14" (1/1) ... [2020-12-09 12:56:14,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 12:56:14,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 12:56:14,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 12:56:14,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 12:56:14,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 12:56:14,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-12-09 12:56:14,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 12:56:14,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-09 12:56:14,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 12:56:14,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 12:56:14,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 12:56:14,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-12-09 12:56:14,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 12:56:14,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 12:56:14,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 12:56:15,111 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 12:56:15,111 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2020-12-09 12:56:15,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:56:15 BoogieIcfgContainer [2020-12-09 12:56:15,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 12:56:15,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 12:56:15,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 12:56:15,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 12:56:15,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:56:14" (1/3) ... [2020-12-09 12:56:15,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501a4924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:56:15, skipping insertion in model container [2020-12-09 12:56:15,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:14" (2/3) ... [2020-12-09 12:56:15,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501a4924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:56:15, skipping insertion in model container [2020-12-09 12:56:15,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:56:15" (3/3) ... [2020-12-09 12:56:15,118 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2020-12-09 12:56:15,128 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 12:56:15,131 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2020-12-09 12:56:15,139 INFO L253 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2020-12-09 12:56:15,154 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 12:56:15,155 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 12:56:15,155 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 12:56:15,155 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 12:56:15,155 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 12:56:15,155 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 12:56:15,155 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 12:56:15,155 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 12:56:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2020-12-09 12:56:15,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 12:56:15,170 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:56:15,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 12:56:15,171 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:56:15,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:56:15,175 INFO L82 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2020-12-09 12:56:15,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 12:56:15,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282777011] [2020-12-09 12:56:15,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-09 12:56:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:15,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 12:56:15,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:15,298 INFO L382 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 [2020-12-09 12:56:15,299 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:56:15,303 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:56:15,304 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:56:15,304 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 12:56:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:15,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 12:56:15,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282777011] [2020-12-09 12:56:15,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:56:15,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 12:56:15,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16044073] [2020-12-09 12:56:15,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 12:56:15,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 12:56:15,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 12:56:15,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:56:15,333 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 3 states. [2020-12-09 12:56:15,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:56:15,468 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2020-12-09 12:56:15,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 12:56:15,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 12:56:15,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:56:15,478 INFO L225 Difference]: With dead ends: 107 [2020-12-09 12:56:15,478 INFO L226 Difference]: Without dead ends: 102 [2020-12-09 12:56:15,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:56:15,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-12-09 12:56:15,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 58. [2020-12-09 12:56:15,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-12-09 12:56:15,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2020-12-09 12:56:15,513 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 5 [2020-12-09 12:56:15,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:56:15,513 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2020-12-09 12:56:15,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 12:56:15,513 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2020-12-09 12:56:15,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 12:56:15,514 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:56:15,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 12:56:15,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 12:56:15,716 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:56:15,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:56:15,717 INFO L82 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2020-12-09 12:56:15,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 12:56:15,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331896851] [2020-12-09 12:56:15,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-09 12:56:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:15,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:56:15,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:15,894 INFO L382 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 [2020-12-09 12:56:15,895 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:56:15,899 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:56:15,899 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:56:15,900 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-09 12:56:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:15,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 12:56:15,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331896851] [2020-12-09 12:56:15,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:56:15,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 12:56:15,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92009208] [2020-12-09 12:56:15,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 12:56:15,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 12:56:15,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 12:56:15,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:56:15,910 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 3 states. [2020-12-09 12:56:16,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:56:16,013 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2020-12-09 12:56:16,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 12:56:16,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 12:56:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:56:16,015 INFO L225 Difference]: With dead ends: 100 [2020-12-09 12:56:16,015 INFO L226 Difference]: Without dead ends: 100 [2020-12-09 12:56:16,016 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:56:16,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-12-09 12:56:16,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 56. [2020-12-09 12:56:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 12:56:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2020-12-09 12:56:16,021 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 5 [2020-12-09 12:56:16,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:56:16,021 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2020-12-09 12:56:16,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 12:56:16,021 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-12-09 12:56:16,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 12:56:16,021 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:56:16,021 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:56:16,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 12:56:16,223 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:56:16,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:56:16,224 INFO L82 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2020-12-09 12:56:16,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 12:56:16,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262765773] [2020-12-09 12:56:16,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-09 12:56:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:16,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 12:56:16,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:16,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:16,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 12:56:16,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262765773] [2020-12-09 12:56:16,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:56:16,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 12:56:16,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437851860] [2020-12-09 12:56:16,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 12:56:16,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 12:56:16,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 12:56:16,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:56:16,402 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 3 states. [2020-12-09 12:56:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:56:16,412 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2020-12-09 12:56:16,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 12:56:16,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-12-09 12:56:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:56:16,414 INFO L225 Difference]: With dead ends: 67 [2020-12-09 12:56:16,414 INFO L226 Difference]: Without dead ends: 67 [2020-12-09 12:56:16,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:56:16,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-12-09 12:56:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2020-12-09 12:56:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-12-09 12:56:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2020-12-09 12:56:16,418 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 8 [2020-12-09 12:56:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:56:16,419 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2020-12-09 12:56:16,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 12:56:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2020-12-09 12:56:16,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 12:56:16,419 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:56:16,419 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:56:16,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 12:56:16,621 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:56:16,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:56:16,622 INFO L82 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2020-12-09 12:56:16,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 12:56:16,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073564025] [2020-12-09 12:56:16,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-09 12:56:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:16,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:56:16,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:16,696 INFO L382 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 [2020-12-09 12:56:16,697 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:56:16,698 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:56:16,699 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:56:16,699 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 12:56:16,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:16,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 12:56:16,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073564025] [2020-12-09 12:56:16,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:56:16,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 12:56:16,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262641068] [2020-12-09 12:56:16,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 12:56:16,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 12:56:16,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 12:56:16,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:56:16,718 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 5 states. [2020-12-09 12:56:16,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:56:16,888 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2020-12-09 12:56:16,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 12:56:16,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 12:56:16,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:56:16,889 INFO L225 Difference]: With dead ends: 75 [2020-12-09 12:56:16,889 INFO L226 Difference]: Without dead ends: 75 [2020-12-09 12:56:16,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 12:56:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-12-09 12:56:16,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 56. [2020-12-09 12:56:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 12:56:16,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2020-12-09 12:56:16,893 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2020-12-09 12:56:16,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:56:16,893 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2020-12-09 12:56:16,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 12:56:16,894 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-12-09 12:56:16,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 12:56:16,894 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:56:16,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:56:17,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 12:56:17,096 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:56:17,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:56:17,097 INFO L82 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2020-12-09 12:56:17,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 12:56:17,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735028721] [2020-12-09 12:56:17,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-09 12:56:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:17,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 12:56:17,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:17,209 INFO L382 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 [2020-12-09 12:56:17,209 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:56:17,214 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:56:17,215 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:56:17,215 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-09 12:56:17,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:17,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 12:56:17,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735028721] [2020-12-09 12:56:17,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:56:17,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 12:56:17,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340191533] [2020-12-09 12:56:17,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 12:56:17,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 12:56:17,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 12:56:17,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:56:17,250 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 5 states. [2020-12-09 12:56:17,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:56:17,418 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2020-12-09 12:56:17,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 12:56:17,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 12:56:17,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:56:17,420 INFO L225 Difference]: With dead ends: 60 [2020-12-09 12:56:17,420 INFO L226 Difference]: Without dead ends: 60 [2020-12-09 12:56:17,420 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 12:56:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-12-09 12:56:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2020-12-09 12:56:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-09 12:56:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2020-12-09 12:56:17,423 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 9 [2020-12-09 12:56:17,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:56:17,423 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2020-12-09 12:56:17,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 12:56:17,423 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2020-12-09 12:56:17,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 12:56:17,423 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:56:17,423 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:56:17,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 12:56:17,625 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:56:17,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:56:17,626 INFO L82 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2020-12-09 12:56:17,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 12:56:17,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573829588] [2020-12-09 12:56:17,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-12-09 12:56:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:17,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:56:17,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:17,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:56:17,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:17,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573829588] [2020-12-09 12:56:17,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1885303895] [2020-12-09 12:56:17,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt [2020-12-09 12:56:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:17,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:56:17,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:17,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:56:17,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:17,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763641598] [2020-12-09 12:56:17,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:56:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:18,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 12:56:18,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:18,035 INFO L382 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 [2020-12-09 12:56:18,035 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:56:18,037 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:56:18,038 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:56:18,038 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 12:56:18,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:18,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 12:56:18,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2020-12-09 12:56:18,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4, 4, 4] total 13 [2020-12-09 12:56:18,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420020596] [2020-12-09 12:56:18,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 12:56:18,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 12:56:18,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 12:56:18,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-12-09 12:56:18,121 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 9 states. [2020-12-09 12:56:18,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:56:18,568 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2020-12-09 12:56:18,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 12:56:18,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2020-12-09 12:56:18,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:56:18,569 INFO L225 Difference]: With dead ends: 113 [2020-12-09 12:56:18,569 INFO L226 Difference]: Without dead ends: 113 [2020-12-09 12:56:18,570 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2020-12-09 12:56:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-12-09 12:56:18,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 58. [2020-12-09 12:56:18,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-12-09 12:56:18,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2020-12-09 12:56:18,574 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 17 [2020-12-09 12:56:18,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:56:18,574 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2020-12-09 12:56:18,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 12:56:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2020-12-09 12:56:18,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 12:56:18,574 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:56:18,574 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:56:19,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 mathsat -unsat_core_generation=3,8 cvc4 --incremental --print-success --lang smt [2020-12-09 12:56:19,178 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:56:19,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:56:19,179 INFO L82 PathProgramCache]: Analyzing trace with hash -806744225, now seen corresponding path program 1 times [2020-12-09 12:56:19,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 12:56:19,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095015674] [2020-12-09 12:56:19,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-12-09 12:56:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:19,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:56:19,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:19,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:56:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:19,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095015674] [2020-12-09 12:56:19,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [762961184] [2020-12-09 12:56:19,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt [2020-12-09 12:56:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:19,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:56:19,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:19,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:19,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:56:19,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:19,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158378279] [2020-12-09 12:56:19,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:56:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:19,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-09 12:56:19,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:19,469 INFO L382 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 [2020-12-09 12:56:19,470 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:56:19,474 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:56:19,474 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:56:19,474 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-09 12:56:19,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:19,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 12:56:19,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2020-12-09 12:56:19,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4, 4, 4] total 13 [2020-12-09 12:56:19,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138660156] [2020-12-09 12:56:19,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 12:56:19,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 12:56:19,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 12:56:19,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-12-09 12:56:19,584 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 9 states. [2020-12-09 12:56:20,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:56:20,184 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2020-12-09 12:56:20,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 12:56:20,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2020-12-09 12:56:20,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:56:20,186 INFO L225 Difference]: With dead ends: 99 [2020-12-09 12:56:20,186 INFO L226 Difference]: Without dead ends: 99 [2020-12-09 12:56:20,187 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2020-12-09 12:56:20,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-12-09 12:56:20,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 58. [2020-12-09 12:56:20,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-12-09 12:56:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2020-12-09 12:56:20,191 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 17 [2020-12-09 12:56:20,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:56:20,191 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2020-12-09 12:56:20,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 12:56:20,191 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2020-12-09 12:56:20,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 12:56:20,192 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:56:20,192 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:56:20,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt [2020-12-09 12:56:20,795 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:56:20,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:56:20,796 INFO L82 PathProgramCache]: Analyzing trace with hash 2106616548, now seen corresponding path program 1 times [2020-12-09 12:56:20,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 12:56:20,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288750584] [2020-12-09 12:56:20,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-12-09 12:56:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:20,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:56:20,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:20,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:20,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:56:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:20,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288750584] [2020-12-09 12:56:20,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [724037457] [2020-12-09 12:56:20,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt [2020-12-09 12:56:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:20,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:56:20,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:20,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:56:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:20,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330655797] [2020-12-09 12:56:20,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:56:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:21,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 12:56:21,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:21,046 INFO L382 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 [2020-12-09 12:56:21,047 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:56:21,048 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:56:21,048 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:56:21,048 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 12:56:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:21,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 12:56:21,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2020-12-09 12:56:21,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4, 4, 4] total 13 [2020-12-09 12:56:21,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876425258] [2020-12-09 12:56:21,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 12:56:21,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 12:56:21,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 12:56:21,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-12-09 12:56:21,122 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 9 states. [2020-12-09 12:56:21,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:56:21,577 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2020-12-09 12:56:21,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 12:56:21,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-12-09 12:56:21,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:56:21,578 INFO L225 Difference]: With dead ends: 100 [2020-12-09 12:56:21,578 INFO L226 Difference]: Without dead ends: 100 [2020-12-09 12:56:21,579 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2020-12-09 12:56:21,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-12-09 12:56:21,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 61. [2020-12-09 12:56:21,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-09 12:56:21,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2020-12-09 12:56:21,581 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 19 [2020-12-09 12:56:21,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:56:21,582 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2020-12-09 12:56:21,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 12:56:21,582 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2020-12-09 12:56:21,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 12:56:21,582 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:56:21,582 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:56:22,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt,13 mathsat -unsat_core_generation=3,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:56:22,185 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:56:22,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:56:22,186 INFO L82 PathProgramCache]: Analyzing trace with hash 2106616549, now seen corresponding path program 1 times [2020-12-09 12:56:22,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 12:56:22,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906288134] [2020-12-09 12:56:22,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-12-09 12:56:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:22,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:56:22,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:22,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:56:22,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:22,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906288134] [2020-12-09 12:56:22,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [392525789] [2020-12-09 12:56:22,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt [2020-12-09 12:56:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:22,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:56:22,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:22,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:56:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:56:22,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738495397] [2020-12-09 12:56:22,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:56:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:22,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 12:56:22,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:56:22,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 12:56:22,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2020-12-09 12:56:22,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4, 4, 4] total 8 [2020-12-09 12:56:22,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60491307] [2020-12-09 12:56:22,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 12:56:22,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 12:56:22,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 12:56:22,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-09 12:56:22,517 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 4 states. [2020-12-09 12:56:22,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:56:22,535 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2020-12-09 12:56:22,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 12:56:22,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-12-09 12:56:22,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:56:22,536 INFO L225 Difference]: With dead ends: 92 [2020-12-09 12:56:22,536 INFO L226 Difference]: Without dead ends: 92 [2020-12-09 12:56:22,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-09 12:56:22,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-12-09 12:56:22,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 63. [2020-12-09 12:56:22,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-09 12:56:22,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2020-12-09 12:56:22,539 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 19 [2020-12-09 12:56:22,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:56:22,539 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2020-12-09 12:56:22,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 12:56:22,539 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2020-12-09 12:56:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 12:56:22,540 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:56:22,540 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:56:23,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 cvc4 --incremental --print-success --lang smt [2020-12-09 12:56:23,142 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:56:23,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:56:23,144 INFO L82 PathProgramCache]: Analyzing trace with hash 921418770, now seen corresponding path program 1 times [2020-12-09 12:56:23,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 12:56:23,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004257808] [2020-12-09 12:56:23,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2020-12-09 12:56:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:23,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:56:23,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:56:23,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:56:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:56:23,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004257808] [2020-12-09 12:56:23,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1005416825] [2020-12-09 12:56:23,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt [2020-12-09 12:56:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:23,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:56:23,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:56:23,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:56:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:56:23,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182927267] [2020-12-09 12:56:23,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:56:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:23,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 12:56:23,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:56:23,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 12:56:23,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2020-12-09 12:56:23,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4, 4, 4] total 8 [2020-12-09 12:56:23,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654331632] [2020-12-09 12:56:23,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 12:56:23,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 12:56:23,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 12:56:23,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-09 12:56:23,452 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 4 states. [2020-12-09 12:56:23,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:56:23,489 INFO L93 Difference]: Finished difference Result 136 states and 159 transitions. [2020-12-09 12:56:23,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 12:56:23,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-12-09 12:56:23,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:56:23,490 INFO L225 Difference]: With dead ends: 136 [2020-12-09 12:56:23,490 INFO L226 Difference]: Without dead ends: 136 [2020-12-09 12:56:23,491 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-09 12:56:23,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-12-09 12:56:23,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 64. [2020-12-09 12:56:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-09 12:56:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2020-12-09 12:56:23,493 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 20 [2020-12-09 12:56:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:56:23,493 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2020-12-09 12:56:23,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 12:56:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2020-12-09 12:56:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 12:56:23,494 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:56:23,494 INFO L422 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] [2020-12-09 12:56:24,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3,21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 cvc4 --incremental --print-success --lang smt [2020-12-09 12:56:24,097 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:56:24,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:56:24,098 INFO L82 PathProgramCache]: Analyzing trace with hash -467805191, now seen corresponding path program 1 times [2020-12-09 12:56:24,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 12:56:24,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748050400] [2020-12-09 12:56:24,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2020-12-09 12:56:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:24,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:56:24,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:56:24,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:56:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:56:24,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748050400] [2020-12-09 12:56:24,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1914893121] [2020-12-09 12:56:24,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt [2020-12-09 12:56:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:24,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:56:24,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:56:24,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:56:24,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:56:24,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632203317] [2020-12-09 12:56:24,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:56:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:24,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 12:56:24,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:56:24,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:56:24,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:56:24,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 12:56:24,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 5, 5] total 12 [2020-12-09 12:56:24,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940497727] [2020-12-09 12:56:24,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 12:56:24,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 12:56:24,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 12:56:24,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-09 12:56:24,500 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 12 states. [2020-12-09 12:56:24,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:56:24,612 INFO L93 Difference]: Finished difference Result 131 states and 150 transitions. [2020-12-09 12:56:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 12:56:24,613 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-12-09 12:56:24,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:56:24,613 INFO L225 Difference]: With dead ends: 131 [2020-12-09 12:56:24,613 INFO L226 Difference]: Without dead ends: 131 [2020-12-09 12:56:24,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2020-12-09 12:56:24,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-12-09 12:56:24,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2020-12-09 12:56:24,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-12-09 12:56:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2020-12-09 12:56:24,617 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 23 [2020-12-09 12:56:24,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:56:24,617 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2020-12-09 12:56:24,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 12:56:24,617 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2020-12-09 12:56:24,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 12:56:24,617 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:56:24,618 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:56:25,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt,22 mathsat -unsat_core_generation=3,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:56:25,220 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:56:25,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:56:25,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1429900598, now seen corresponding path program 1 times [2020-12-09 12:56:25,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 12:56:25,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995196177] [2020-12-09 12:56:25,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2020-12-09 12:56:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:56:25,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 32 conjunts are in the unsatisfiable core [2020-12-09 12:56:25,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:56:25,363 INFO L382 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 [2020-12-09 12:56:25,364 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:56:25,365 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:56:25,365 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:56:25,366 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 12:56:25,406 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:56:25,406 INFO L382 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 19 treesize of output 41 [2020-12-09 12:56:25,408 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:56:25,415 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:56:25,419 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:56:25,419 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2020-12-09 12:56:25,530 INFO L382 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 [2020-12-09 12:56:25,531 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:56:25,549 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:56:25,552 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:56:25,552 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:30 [2020-12-09 12:56:25,749 INFO L382 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 35 treesize of output 19 [2020-12-09 12:56:25,750 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:56:25,757 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:56:25,758 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:56:25,758 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:26 [2020-12-09 12:56:25,817 INFO L382 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 27 treesize of output 15 [2020-12-09 12:56:25,818 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:56:25,824 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:56:25,825 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:56:25,825 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2020-12-09 12:56:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:56:25,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:56:26,056 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:56:26,060 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:56:26,061 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:56:26,061 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2020-12-09 12:57:00,831 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:57:00,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995196177] [2020-12-09 12:57:00,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [556500995] [2020-12-09 12:57:00,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt [2020-12-09 12:57:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:57:00,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 33 conjunts are in the unsatisfiable core [2020-12-09 12:57:00,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:57:00,986 INFO L382 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 [2020-12-09 12:57:00,987 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:00,989 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:00,990 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:57:00,990 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 12:57:01,016 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:01,017 INFO L382 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 14 treesize of output 30 [2020-12-09 12:57:01,018 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:01,043 INFO L625 ElimStorePlain]: treesize reduction 14, result has 53.3 percent of original size [2020-12-09 12:57:01,043 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:57:01,043 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2020-12-09 12:57:01,267 INFO L382 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 [2020-12-09 12:57:01,267 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:01,280 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:01,280 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:57:01,281 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2020-12-09 12:57:01,702 INFO L382 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 25 treesize of output 13 [2020-12-09 12:57:01,703 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:01,713 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:01,714 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:57:01,714 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2020-12-09 12:57:01,801 INFO L382 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 19 treesize of output 11 [2020-12-09 12:57:01,802 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:01,809 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:01,810 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:01,810 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2020-12-09 12:57:01,862 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:57:01,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:57:01,874 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:01,879 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:01,879 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:01,879 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2020-12-09 12:57:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:57:04,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991547008] [2020-12-09 12:57:04,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:57:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:57:04,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-09 12:57:04,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:57:04,214 INFO L382 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 [2020-12-09 12:57:04,215 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:04,217 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:04,217 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:57:04,218 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 12:57:04,249 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:04,249 INFO L382 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 39 [2020-12-09 12:57:04,250 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:04,261 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:04,262 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:04,262 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2020-12-09 12:57:04,284 INFO L382 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 [2020-12-09 12:57:04,285 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:04,300 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:04,302 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:04,302 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:30 [2020-12-09 12:57:04,330 INFO L382 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 35 treesize of output 19 [2020-12-09 12:57:04,331 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:04,343 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:04,343 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:04,344 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:26 [2020-12-09 12:57:04,359 INFO L382 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 27 treesize of output 15 [2020-12-09 12:57:04,360 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:04,368 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:04,369 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:04,369 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2020-12-09 12:57:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:57:04,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:57:04,389 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:04,394 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:04,395 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:04,395 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2020-12-09 12:57:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:57:17,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 12:57:17,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16, 13, 16, 14] total 37 [2020-12-09 12:57:17,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122387719] [2020-12-09 12:57:17,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-12-09 12:57:17,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 12:57:17,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-12-09 12:57:17,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1272, Unknown=11, NotChecked=0, Total=1406 [2020-12-09 12:57:17,114 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand 38 states. [2020-12-09 12:57:19,326 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-12-09 12:57:19,594 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2020-12-09 12:57:21,763 WARN L197 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2020-12-09 12:57:23,948 WARN L197 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2020-12-09 12:57:24,224 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2020-12-09 12:57:29,081 WARN L197 SmtUtils]: Spent 4.40 s on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2020-12-09 12:57:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:57:29,727 INFO L93 Difference]: Finished difference Result 173 states and 209 transitions. [2020-12-09 12:57:29,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-09 12:57:29,727 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 33 [2020-12-09 12:57:29,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:57:29,729 INFO L225 Difference]: With dead ends: 173 [2020-12-09 12:57:29,729 INFO L226 Difference]: Without dead ends: 173 [2020-12-09 12:57:29,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 148 SyntacticMatches, 9 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 60.7s TimeCoverageRelationStatistics Valid=578, Invalid=2381, Unknown=11, NotChecked=0, Total=2970 [2020-12-09 12:57:29,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-12-09 12:57:29,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 97. [2020-12-09 12:57:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-12-09 12:57:29,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 120 transitions. [2020-12-09 12:57:29,734 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 120 transitions. Word has length 33 [2020-12-09 12:57:29,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:57:29,734 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 120 transitions. [2020-12-09 12:57:29,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-12-09 12:57:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 120 transitions. [2020-12-09 12:57:29,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 12:57:29,735 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:57:29,735 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:57:30,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 mathsat -unsat_core_generation=3 [2020-12-09 12:57:30,337 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:57:30,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:57:30,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1429900597, now seen corresponding path program 1 times [2020-12-09 12:57:30,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 12:57:30,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760744170] [2020-12-09 12:57:30,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2020-12-09 12:57:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:57:30,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 40 conjunts are in the unsatisfiable core [2020-12-09 12:57:30,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:57:30,476 INFO L382 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 [2020-12-09 12:57:30,477 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:30,491 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:30,494 INFO L382 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 [2020-12-09 12:57:30,495 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:30,503 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:30,504 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:57:30,504 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 12:57:30,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 12:57:30,591 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-12-09 12:57:30,591 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:30,610 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:30,622 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:30,623 INFO L382 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 11 treesize of output 15 [2020-12-09 12:57:30,623 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:30,640 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:30,641 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:30,642 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:21 [2020-12-09 12:57:30,794 INFO L382 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 [2020-12-09 12:57:30,795 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:30,819 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:30,823 INFO L382 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 [2020-12-09 12:57:30,823 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:30,843 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:30,844 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:30,844 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:39 [2020-12-09 12:57:31,199 INFO L382 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 11 [2020-12-09 12:57:31,200 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:31,225 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:31,229 INFO L382 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 33 treesize of output 17 [2020-12-09 12:57:31,230 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:31,247 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:31,248 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:31,248 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:33 [2020-12-09 12:57:31,344 INFO L382 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 15 treesize of output 7 [2020-12-09 12:57:31,345 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:31,364 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:31,367 INFO L382 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 25 treesize of output 13 [2020-12-09 12:57:31,368 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:31,383 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:31,384 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:31,384 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2020-12-09 12:57:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:57:31,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:57:32,171 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 12:57:32,172 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 12:57:32,175 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 12:57:32,188 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:32,193 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:32,251 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:32,258 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:32,262 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:32,305 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:32,306 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-12-09 12:57:32,306 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:69 [2020-12-09 12:57:32,991 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-12-09 12:57:33,827 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 12:57:36,378 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2020-12-09 12:57:40,473 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-12-09 12:57:41,393 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-12-09 12:57:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:57:41,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760744170] [2020-12-09 12:57:41,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [762074789] [2020-12-09 12:57:41,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt [2020-12-09 12:57:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:57:41,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 43 conjunts are in the unsatisfiable core [2020-12-09 12:57:41,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:57:41,634 INFO L382 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 [2020-12-09 12:57:41,634 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:41,645 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:41,648 INFO L382 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 [2020-12-09 12:57:41,648 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:41,657 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:41,658 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:57:41,658 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 12:57:41,684 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:41,684 INFO L382 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 11 treesize of output 15 [2020-12-09 12:57:41,685 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:41,707 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:41,711 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-12-09 12:57:41,712 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:41,730 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:41,730 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:57:41,731 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:21 [2020-12-09 12:57:42,101 INFO L382 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 [2020-12-09 12:57:42,102 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:42,125 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:42,130 INFO L382 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 [2020-12-09 12:57:42,130 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:42,152 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:42,153 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:57:42,153 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:39 [2020-12-09 12:57:42,920 INFO L382 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 33 treesize of output 17 [2020-12-09 12:57:42,922 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:42,946 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:42,950 INFO L382 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 11 [2020-12-09 12:57:42,951 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:42,967 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:42,968 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:57:42,968 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:33 [2020-12-09 12:57:43,131 INFO L382 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 15 treesize of output 7 [2020-12-09 12:57:43,132 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:43,149 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:43,152 INFO L382 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 25 treesize of output 13 [2020-12-09 12:57:43,153 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:43,172 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:43,173 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:43,173 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:20 [2020-12-09 12:57:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:57:43,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:57:43,257 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 12:57:43,258 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 12:57:43,258 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 12:57:43,268 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:43,275 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:43,382 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-12-09 12:57:43,382 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:43,390 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:43,404 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:43,452 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:43,453 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-12-09 12:57:43,453 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:69 [2020-12-09 12:57:44,465 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 12:57:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:57:50,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206073818] [2020-12-09 12:57:50,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:57:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:57:50,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 40 conjunts are in the unsatisfiable core [2020-12-09 12:57:50,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:57:50,535 INFO L382 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 [2020-12-09 12:57:50,536 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:50,546 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:50,549 INFO L382 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 [2020-12-09 12:57:50,550 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:50,560 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:50,561 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:57:50,561 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 12:57:50,588 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:50,588 INFO L382 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 13 treesize of output 17 [2020-12-09 12:57:50,589 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:50,610 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:50,614 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 12:57:50,615 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:50,634 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:50,635 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:50,635 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:21 [2020-12-09 12:57:50,660 INFO L382 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 [2020-12-09 12:57:50,661 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:50,687 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:50,696 INFO L382 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 [2020-12-09 12:57:50,697 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:50,725 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:50,726 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:50,726 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:39 [2020-12-09 12:57:50,760 INFO L382 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 35 treesize of output 19 [2020-12-09 12:57:50,761 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:50,788 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:50,793 INFO L382 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 11 [2020-12-09 12:57:50,793 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:50,811 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:50,812 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:50,812 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:33 [2020-12-09 12:57:50,832 INFO L382 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 15 treesize of output 7 [2020-12-09 12:57:50,833 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:50,852 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:50,855 INFO L382 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 25 treesize of output 13 [2020-12-09 12:57:50,856 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:50,870 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:50,871 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:50,871 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:20 [2020-12-09 12:57:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:57:51,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:57:51,018 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 12:57:51,019 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 12:57:51,019 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 12:57:51,035 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:57:51,040 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:51,101 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:51,108 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:51,114 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 12:57:51,169 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:57:51,170 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-12-09 12:57:51,170 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:69 [2020-12-09 12:57:52,286 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 12:57:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:57:58,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 12:57:58,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16, 14, 16, 14] total 38 [2020-12-09 12:57:58,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293158906] [2020-12-09 12:57:58,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-12-09 12:57:58,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 12:57:58,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-12-09 12:57:58,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1339, Unknown=7, NotChecked=0, Total=1482 [2020-12-09 12:57:58,752 INFO L87 Difference]: Start difference. First operand 97 states and 120 transitions. Second operand 39 states. [2020-12-09 12:58:00,654 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2020-12-09 12:58:01,362 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2020-12-09 12:58:01,788 WARN L197 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2020-12-09 12:58:02,173 WARN L197 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2020-12-09 12:58:02,529 WARN L197 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2020-12-09 12:58:03,048 WARN L197 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 90 [2020-12-09 12:58:03,594 WARN L197 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 86 [2020-12-09 12:58:04,537 WARN L197 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2020-12-09 12:58:14,610 WARN L197 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2020-12-09 12:58:23,780 WARN L197 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2020-12-09 12:58:36,015 WARN L197 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 136 DAG size of output: 89 [2020-12-09 12:58:40,713 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2020-12-09 12:58:49,816 WARN L197 SmtUtils]: Spent 2.83 s on a formula simplification. DAG size of input: 128 DAG size of output: 83 [2020-12-09 12:58:55,231 WARN L197 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-12-09 12:59:01,859 WARN L197 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 54 [2020-12-09 12:59:10,778 WARN L197 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2020-12-09 12:59:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:59:17,003 INFO L93 Difference]: Finished difference Result 297 states and 351 transitions. [2020-12-09 12:59:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-09 12:59:17,003 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 33 [2020-12-09 12:59:17,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:59:17,005 INFO L225 Difference]: With dead ends: 297 [2020-12-09 12:59:17,005 INFO L226 Difference]: Without dead ends: 297 [2020-12-09 12:59:17,006 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 140 SyntacticMatches, 15 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 75.2s TimeCoverageRelationStatistics Valid=725, Invalid=3283, Unknown=24, NotChecked=0, Total=4032 [2020-12-09 12:59:17,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-12-09 12:59:17,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 104. [2020-12-09 12:59:17,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-12-09 12:59:17,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2020-12-09 12:59:17,011 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 33 [2020-12-09 12:59:17,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:59:17,011 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2020-12-09 12:59:17,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-12-09 12:59:17,011 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2020-12-09 12:59:17,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 12:59:17,012 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:59:17,012 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:59:17,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 cvc4 --incremental --print-success --lang smt,28 mathsat -unsat_core_generation=3 [2020-12-09 12:59:17,615 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:59:17,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:59:17,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2001466815, now seen corresponding path program 2 times [2020-12-09 12:59:17,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 12:59:17,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224127809] [2020-12-09 12:59:17,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2020-12-09 12:59:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:59:17,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:59:17,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:59:17,801 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-09 12:59:17,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:59:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-09 12:59:17,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224127809] [2020-12-09 12:59:17,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [374588791] [2020-12-09 12:59:17,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt [2020-12-09 12:59:18,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-09 12:59:18,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 12:59:18,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:59:18,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:59:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-09 12:59:18,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:59:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-09 12:59:18,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137895055] [2020-12-09 12:59:18,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:59:18,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-09 12:59:18,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 12:59:18,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-09 12:59:18,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:59:18,117 INFO L382 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 [2020-12-09 12:59:18,118 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:59:18,126 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:59:18,127 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:59:18,127 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-09 12:59:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 12:59:18,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 12:59:18,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2020-12-09 12:59:18,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 5, 5, 5] total 15 [2020-12-09 12:59:18,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679432129] [2020-12-09 12:59:18,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 12:59:18,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 12:59:18,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 12:59:18,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-09 12:59:18,380 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand 9 states. [2020-12-09 12:59:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:59:19,247 INFO L93 Difference]: Finished difference Result 133 states and 157 transitions. [2020-12-09 12:59:19,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 12:59:19,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2020-12-09 12:59:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:59:19,249 INFO L225 Difference]: With dead ends: 133 [2020-12-09 12:59:19,249 INFO L226 Difference]: Without dead ends: 133 [2020-12-09 12:59:19,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2020-12-09 12:59:19,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-12-09 12:59:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 104. [2020-12-09 12:59:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-12-09 12:59:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2020-12-09 12:59:19,252 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 36 [2020-12-09 12:59:19,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:59:19,252 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2020-12-09 12:59:19,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 12:59:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2020-12-09 12:59:19,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 12:59:19,252 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:59:19,252 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:59:19,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 cvc4 --incremental --print-success --lang smt,31 mathsat -unsat_core_generation=3 [2020-12-09 12:59:19,854 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:59:19,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:59:19,856 INFO L82 PathProgramCache]: Analyzing trace with hash -681406170, now seen corresponding path program 2 times [2020-12-09 12:59:19,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 12:59:19,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118426696] [2020-12-09 12:59:19,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2020-12-09 12:59:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:59:19,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 12:59:19,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:59:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-09 12:59:20,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:59:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-09 12:59:20,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118426696] [2020-12-09 12:59:20,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1392361110] [2020-12-09 12:59:20,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt [2020-12-09 12:59:20,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-09 12:59:20,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 12:59:20,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 12:59:20,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:59:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-09 12:59:20,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:59:20,333 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-09 12:59:20,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576526359] [2020-12-09 12:59:20,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:59:20,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-09 12:59:20,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 12:59:20,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 12:59:20,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:59:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-09 12:59:20,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:59:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-09 12:59:20,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 12:59:20,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 8] total 16 [2020-12-09 12:59:20,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448230442] [2020-12-09 12:59:20,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-09 12:59:20,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 12:59:20,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-09 12:59:20,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-12-09 12:59:20,722 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand 16 states. [2020-12-09 12:59:22,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:59:22,217 INFO L93 Difference]: Finished difference Result 375 states and 423 transitions. [2020-12-09 12:59:22,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-12-09 12:59:22,218 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2020-12-09 12:59:22,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:59:22,219 INFO L225 Difference]: With dead ends: 375 [2020-12-09 12:59:22,220 INFO L226 Difference]: Without dead ends: 375 [2020-12-09 12:59:22,220 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2020-12-09 12:59:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2020-12-09 12:59:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 130. [2020-12-09 12:59:22,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-12-09 12:59:22,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 166 transitions. [2020-12-09 12:59:22,223 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 166 transitions. Word has length 36 [2020-12-09 12:59:22,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:59:22,224 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 166 transitions. [2020-12-09 12:59:22,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-09 12:59:22,224 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 166 transitions. [2020-12-09 12:59:22,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-09 12:59:22,224 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:59:22,224 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 12:59:22,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 cvc4 --incremental --print-success --lang smt,34 mathsat -unsat_core_generation=3,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:59:22,827 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:59:22,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:59:22,828 INFO L82 PathProgramCache]: Analyzing trace with hash -768960311, now seen corresponding path program 1 times [2020-12-09 12:59:22,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 12:59:22,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405797368] [2020-12-09 12:59:22,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/mathsat Starting monitored process 37 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with mathsat -unsat_core_generation=3 [2020-12-09 12:59:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:59:23,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:59:23,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:59:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-09 12:59:23,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:59:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-09 12:59:23,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405797368] [2020-12-09 12:59:23,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1626931380] [2020-12-09 12:59:23,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt [2020-12-09 12:59:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:59:23,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 12:59:23,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:59:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-09 12:59:23,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:59:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-09 12:59:23,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761861439] [2020-12-09 12:59:23,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:59:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:59:23,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 12:59:23,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:59:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-09 12:59:23,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:59:24,004 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-09 12:59:24,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 12:59:24,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 7, 9] total 17 [2020-12-09 12:59:24,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479013790] [2020-12-09 12:59:24,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 12:59:24,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 12:59:24,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 12:59:24,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2020-12-09 12:59:24,006 INFO L87 Difference]: Start difference. First operand 130 states and 166 transitions. Second operand 17 states. [2020-12-09 12:59:24,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:59:24,203 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2020-12-09 12:59:24,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 12:59:24,204 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2020-12-09 12:59:24,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:59:24,204 INFO L225 Difference]: With dead ends: 88 [2020-12-09 12:59:24,204 INFO L226 Difference]: Without dead ends: 88 [2020-12-09 12:59:24,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 216 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2020-12-09 12:59:24,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-12-09 12:59:24,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2020-12-09 12:59:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-12-09 12:59:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2020-12-09 12:59:24,207 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 40 [2020-12-09 12:59:24,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:59:24,207 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2020-12-09 12:59:24,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 12:59:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2020-12-09 12:59:24,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-09 12:59:24,207 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:59:24,207 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:59:24,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 cvc4 --incremental --print-success --lang smt [2020-12-09 12:59:24,810 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:59:24,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:59:24,811 INFO L82 PathProgramCache]: Analyzing trace with hash -803558610, now seen corresponding path program 1 times [2020-12-09 12:59:24,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 12:59:24,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815074317] [2020-12-09 12:59:24,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/mathsat Starting monitored process 40 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with mathsat -unsat_core_generation=3 [2020-12-09 12:59:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:59:24,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 12:59:24,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:59:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-09 12:59:24,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 12:59:24,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815074317] [2020-12-09 12:59:24,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:59:24,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 12:59:24,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140480159] [2020-12-09 12:59:24,992 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 12:59:24,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 12:59:24,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 12:59:24,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 12:59:24,993 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 4 states. [2020-12-09 12:59:25,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:59:25,050 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2020-12-09 12:59:25,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 12:59:25,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-12-09 12:59:25,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:59:25,051 INFO L225 Difference]: With dead ends: 79 [2020-12-09 12:59:25,051 INFO L226 Difference]: Without dead ends: 79 [2020-12-09 12:59:25,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:59:25,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-09 12:59:25,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2020-12-09 12:59:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-12-09 12:59:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2020-12-09 12:59:25,052 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 42 [2020-12-09 12:59:25,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:59:25,052 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2020-12-09 12:59:25,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 12:59:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2020-12-09 12:59:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-09 12:59:25,053 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:59:25,053 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:59:25,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 mathsat -unsat_core_generation=3 [2020-12-09 12:59:25,254 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 12:59:25,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:59:25,255 INFO L82 PathProgramCache]: Analyzing trace with hash 808916518, now seen corresponding path program 1 times [2020-12-09 12:59:25,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 12:59:25,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978997851] [2020-12-09 12:59:25,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/mathsat Starting monitored process 41 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with mathsat -unsat_core_generation=3 [2020-12-09 12:59:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:59:25,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 49 conjunts are in the unsatisfiable core [2020-12-09 12:59:25,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:59:25,529 INFO L382 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 [2020-12-09 12:59:25,529 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:59:25,532 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:59:25,532 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:59:25,532 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 12:59:25,587 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:59:25,587 INFO L382 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 13 treesize of output 17 [2020-12-09 12:59:25,588 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:59:25,597 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:59:25,597 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:59:25,597 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2020-12-09 12:59:25,704 INFO L382 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 [2020-12-09 12:59:25,705 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:59:25,719 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:59:25,720 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:59:25,720 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2020-12-09 12:59:25,996 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_126|], 2=[|v_#memory_$Pointer$.base_140|]} [2020-12-09 12:59:26,002 INFO L382 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 [2020-12-09 12:59:26,002 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:59:26,023 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:59:26,027 INFO L382 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 24 treesize of output 12 [2020-12-09 12:59:26,028 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 12:59:26,041 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:59:26,041 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:59:26,041 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:19 [2020-12-09 12:59:26,195 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 12:59:26,196 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2020-12-09 12:59:26,197 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:59:26,211 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:59:26,212 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:59:26,212 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:15 [2020-12-09 12:59:26,377 INFO L382 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 19 treesize of output 18 [2020-12-09 12:59:26,378 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:59:26,398 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:59:26,400 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:59:26,400 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2020-12-09 12:59:26,619 INFO L382 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 15 treesize of output 7 [2020-12-09 12:59:26,619 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 12:59:26,623 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 12:59:26,623 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 12:59:26,623 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-12-09 12:59:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:59:26,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:59:29,134 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_sll_update_at_~data (_ BitVec 32)) (ULTIMATE.start_sll_update_at_~head.offset (_ BitVec 32))) (= c_ULTIMATE.start_main_~len~0 (select (select (store |c_#memory_int| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_int| c_ULTIMATE.start_sll_update_at_~head.base) ULTIMATE.start_sll_update_at_~head.offset ULTIMATE.start_sll_update_at_~data)) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) is different from false [2020-12-09 13:00:02,642 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_sll_update_at_~data (_ BitVec 32)) (v_ULTIMATE.start_sll_update_at_~head.offset_69 (_ BitVec 32))) (= c_ULTIMATE.start_main_~len~0 (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (bvadd c_ULTIMATE.start_main_~s~0.offset (_ bv4 32))))) (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_69 ULTIMATE.start_sll_update_at_~data))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) is different from false [2020-12-09 13:00:02,656 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 13:00:02,670 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:02,675 INFO L382 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 242 treesize of output 234 [2020-12-09 13:00:02,678 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:02,846 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2020-12-09 13:00:02,847 INFO L625 ElimStorePlain]: treesize reduction 56, result has 50.9 percent of original size [2020-12-09 13:00:02,848 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2020-12-09 13:00:02,848 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:28 [2020-12-09 13:00:03,431 INFO L382 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 18 treesize of output 16 [2020-12-09 13:00:03,436 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:03,439 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:03,439 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:03,442 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:03,443 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:03,443 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:4 [2020-12-09 13:00:03,727 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2020-12-09 13:00:03,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978997851] [2020-12-09 13:00:03,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1703859283] [2020-12-09 13:00:03,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/cvc4 Starting monitored process 42 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with cvc4 --incremental --print-success --lang smt [2020-12-09 13:00:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:00:03,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 48 conjunts are in the unsatisfiable core [2020-12-09 13:00:03,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:00:04,046 INFO L382 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 [2020-12-09 13:00:04,046 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:04,055 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:04,056 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:04,056 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:13 [2020-12-09 13:00:04,478 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:04,478 INFO L382 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 11 treesize of output 15 [2020-12-09 13:00:04,479 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:04,491 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:04,492 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:04,492 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2020-12-09 13:00:04,878 INFO L382 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 [2020-12-09 13:00:04,879 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:04,898 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:04,898 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:04,899 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2020-12-09 13:00:05,627 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_136|], 2=[|v_#memory_$Pointer$.base_150|]} [2020-12-09 13:00:05,633 INFO L382 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 [2020-12-09 13:00:05,634 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:05,660 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:05,665 INFO L382 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 24 treesize of output 12 [2020-12-09 13:00:05,666 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:05,684 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:05,685 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:05,685 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:24 [2020-12-09 13:00:06,019 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 13:00:06,019 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2020-12-09 13:00:06,020 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:06,037 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:06,038 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:06,038 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:20 [2020-12-09 13:00:06,352 INFO L382 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 19 treesize of output 18 [2020-12-09 13:00:06,352 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:06,375 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:06,376 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:06,377 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:16 [2020-12-09 13:00:06,884 INFO L382 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 15 treesize of output 7 [2020-12-09 13:00:06,885 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:06,894 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:06,894 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:06,894 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2020-12-09 13:00:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:00:07,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 13:00:09,317 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_73 (_ BitVec 32)) (ULTIMATE.start_sll_update_at_~data (_ BitVec 32))) (= c_ULTIMATE.start_main_~len~0 (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) (bvadd c_ULTIMATE.start_sll_update_at_~head.offset (_ bv4 32))))) (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_73 ULTIMATE.start_sll_update_at_~data))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) is different from false [2020-12-09 13:00:11,328 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_73 (_ BitVec 32)) (ULTIMATE.start_sll_update_at_~data (_ BitVec 32))) (= c_ULTIMATE.start_main_~len~0 (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (bvadd c_ULTIMATE.start_main_~s~0.offset (_ bv4 32))))) (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_73 ULTIMATE.start_sll_update_at_~data))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) is different from false [2020-12-09 13:00:11,343 INFO L382 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 194 treesize of output 186 [2020-12-09 13:00:11,346 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:11,525 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2020-12-09 13:00:11,525 INFO L625 ElimStorePlain]: treesize reduction 48, result has 54.7 percent of original size [2020-12-09 13:00:11,529 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 13:00:11,529 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 13:00:11,530 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 13:00:11,530 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 13:00:11,531 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 13:00:11,598 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:11,601 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2020-12-09 13:00:11,601 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:28 [2020-12-09 13:00:11,828 INFO L382 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 18 treesize of output 16 [2020-12-09 13:00:11,832 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:11,835 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:11,835 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:11,838 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:11,839 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:11,839 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:4 [2020-12-09 13:00:11,866 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2020-12-09 13:00:11,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941212355] [2020-12-09 13:00:11,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 13:00:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:00:11,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 48 conjunts are in the unsatisfiable core [2020-12-09 13:00:11,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:00:11,948 INFO L382 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 [2020-12-09 13:00:11,948 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:11,955 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:11,956 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:11,956 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:13 [2020-12-09 13:00:11,980 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:11,980 INFO L382 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 13 treesize of output 17 [2020-12-09 13:00:11,981 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:11,992 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:11,993 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:11,993 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:13 [2020-12-09 13:00:12,005 INFO L382 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 [2020-12-09 13:00:12,006 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:12,022 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:12,023 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:12,023 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2020-12-09 13:00:12,034 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_146|], 2=[|v_#memory_$Pointer$.base_160|]} [2020-12-09 13:00:12,040 INFO L382 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 [2020-12-09 13:00:12,040 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:12,064 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:12,068 INFO L382 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 24 treesize of output 12 [2020-12-09 13:00:12,069 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:12,085 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:12,085 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:12,085 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:24 [2020-12-09 13:00:12,097 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 13:00:12,098 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2020-12-09 13:00:12,098 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:12,114 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:12,114 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:12,114 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:20 [2020-12-09 13:00:12,125 INFO L382 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 19 treesize of output 18 [2020-12-09 13:00:12,126 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:12,146 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:12,147 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:12,148 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:16 [2020-12-09 13:00:12,158 INFO L382 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 15 treesize of output 7 [2020-12-09 13:00:12,159 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:12,167 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:12,167 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:12,167 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2020-12-09 13:00:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:00:12,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 13:00:14,192 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_sll_update_at_~data (_ BitVec 32)) (v_ULTIMATE.start_sll_update_at_~head.offset_77 (_ BitVec 32))) (= c_ULTIMATE.start_main_~len~0 (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) (bvadd c_ULTIMATE.start_sll_update_at_~head.offset (_ bv4 32))))) (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_77 ULTIMATE.start_sll_update_at_~data))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) is different from false [2020-12-09 13:00:16,203 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_sll_update_at_~data (_ BitVec 32)) (v_ULTIMATE.start_sll_update_at_~head.offset_77 (_ BitVec 32))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (bvadd c_ULTIMATE.start_main_~s~0.offset (_ bv4 32))))) (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_77 ULTIMATE.start_sll_update_at_~data))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset) c_ULTIMATE.start_main_~len~0)) is different from false [2020-12-09 13:00:16,219 INFO L382 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 194 treesize of output 186 [2020-12-09 13:00:16,223 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:16,418 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2020-12-09 13:00:16,418 INFO L625 ElimStorePlain]: treesize reduction 48, result has 54.7 percent of original size [2020-12-09 13:00:16,421 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 13:00:16,421 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 13:00:16,422 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 13:00:16,422 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 13:00:16,423 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 13:00:16,491 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:16,494 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2020-12-09 13:00:16,494 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:28 [2020-12-09 13:00:16,739 INFO L382 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 18 treesize of output 16 [2020-12-09 13:00:16,742 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 13:00:16,745 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:16,746 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:16,750 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:00:16,751 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:00:16,751 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:4 [2020-12-09 13:00:16,788 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2020-12-09 13:00:16,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 13:00:16,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 25, 24, 25, 24] total 66 [2020-12-09 13:00:16,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323548091] [2020-12-09 13:00:16,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 66 states [2020-12-09 13:00:16,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 13:00:16,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2020-12-09 13:00:16,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=3320, Unknown=19, NotChecked=726, Total=4290 [2020-12-09 13:00:16,790 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 66 states. [2020-12-09 13:00:25,088 WARN L197 SmtUtils]: Spent 4.41 s on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2020-12-09 13:00:29,875 WARN L197 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2020-12-09 13:01:08,696 WARN L197 SmtUtils]: Spent 38.36 s on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2020-12-09 13:01:17,790 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2020-12-09 13:01:19,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:01:19,985 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2020-12-09 13:01:19,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-12-09 13:01:19,986 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 43 [2020-12-09 13:01:19,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:01:19,986 INFO L225 Difference]: With dead ends: 98 [2020-12-09 13:01:19,986 INFO L226 Difference]: Without dead ends: 98 [2020-12-09 13:01:19,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 180 SyntacticMatches, 8 SemanticMatches, 93 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 99.8s TimeCoverageRelationStatistics Valid=999, Invalid=6838, Unknown=19, NotChecked=1074, Total=8930 [2020-12-09 13:01:19,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-12-09 13:01:19,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 77. [2020-12-09 13:01:19,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-12-09 13:01:19,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2020-12-09 13:01:19,991 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 43 [2020-12-09 13:01:19,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:01:19,991 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2020-12-09 13:01:19,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2020-12-09 13:01:19,991 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2020-12-09 13:01:19,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-09 13:01:19,991 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:01:19,992 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:01:20,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 mathsat -unsat_core_generation=3,42 cvc4 --incremental --print-success --lang smt,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 13:01:20,594 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-12-09 13:01:20,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:01:20,595 INFO L82 PathProgramCache]: Analyzing trace with hash -310561794, now seen corresponding path program 1 times [2020-12-09 13:01:20,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 13:01:20,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259047423] [2020-12-09 13:01:20,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/mathsat Starting monitored process 44 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with mathsat -unsat_core_generation=3 [2020-12-09 13:01:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:01:20,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 42 conjunts are in the unsatisfiable core [2020-12-09 13:01:20,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:01:20,898 INFO L382 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 [2020-12-09 13:01:20,898 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:01:20,902 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:01:20,902 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:01:20,903 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 13:01:20,960 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:01:20,960 INFO L382 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 11 treesize of output 15 [2020-12-09 13:01:20,961 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:01:20,973 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:01:20,974 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:01:20,974 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2020-12-09 13:01:21,072 INFO L382 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 [2020-12-09 13:01:21,072 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:01:21,085 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:01:21,086 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:01:21,086 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2020-12-09 13:01:21,319 INFO L382 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 24 treesize of output 12 [2020-12-09 13:01:21,319 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:01:21,329 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:01:21,329 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:01:21,329 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2020-12-09 13:01:21,478 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 13:01:21,578 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:01:21,578 INFO L382 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 55 treesize of output 107 [2020-12-09 13:01:21,581 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-09 13:01:21,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 13:01:21,582 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:01:21,611 INFO L625 ElimStorePlain]: treesize reduction 13, result has 65.8 percent of original size [2020-12-09 13:01:21,612 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:01:21,612 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:25 [2020-12-09 13:01:21,758 INFO L382 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 27 treesize of output 15 [2020-12-09 13:01:21,759 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:01:21,768 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:01:21,770 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 13:01:21,770 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2020-12-09 13:01:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 13:01:21,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 13:01:22,050 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:01:22,050 INFO L382 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 22 treesize of output 26 [2020-12-09 13:01:22,051 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 13:01:22,053 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 13:01:22,069 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:01:22,072 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 13:01:22,078 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:01:22,078 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 13:01:22,078 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:17 [2020-12-09 13:01:51,485 WARN L197 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-12-09 13:02:07,439 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 16 [2020-12-09 13:02:07,448 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 13:02:07,459 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 13:02:07,459 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 13:02:07,460 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:75 [2020-12-09 13:02:23,112 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_ULTIMATE.start_sll_update_at_~head.offset_81 (_ BitVec 32))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset v_DerPreprocessor_20)) (.cse3 (bvadd c_ULTIMATE.start_main_~s~0.offset (_ bv4 32)))) (let ((.cse0 (select .cse2 .cse3))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base .cse2))) (store .cse1 .cse0 (store (select .cse1 .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_81 v_DerPreprocessor_19))) c_ULTIMATE.start_main_~s~0.base) .cse3))))) is different from false [2020-12-09 13:02:25,124 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_ULTIMATE.start_sll_update_at_~head.offset_81 (_ BitVec 32))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res.base|) |c_ULTIMATE.start_sll_create_#res.offset| v_DerPreprocessor_20)) (.cse3 (bvadd |c_ULTIMATE.start_sll_create_#res.offset| (_ bv4 32)))) (let ((.cse0 (select .cse2 .cse3))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res.base| .cse2))) (store .cse1 .cse0 (store (select .cse1 .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_81 v_DerPreprocessor_19))) |c_ULTIMATE.start_sll_create_#res.base|) .cse3))))) is different from false [2020-12-09 13:02:45,739 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2020-12-09 13:02:47,750 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_ULTIMATE.start_sll_update_at_~head.offset_81 (_ BitVec 32))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~new_head~0.base) c_ULTIMATE.start_sll_create_~new_head~0.offset v_DerPreprocessor_20)) (.cse3 (bvadd c_ULTIMATE.start_sll_create_~new_head~0.offset (_ bv4 32)))) (let ((.cse0 (select .cse2 .cse3))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~new_head~0.base .cse2))) (store .cse1 .cse0 (store (select .cse1 .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_81 v_DerPreprocessor_19))) c_ULTIMATE.start_sll_create_~new_head~0.base) .cse3))))) is different from false [2020-12-09 13:02:47,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259047423] [2020-12-09 13:02:47,759 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2020-12-09 13:02:47,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [5745490] [2020-12-09 13:02:47,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/cvc4 Starting monitored process 45 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with cvc4 --incremental --print-success --lang smt [2020-12-09 13:02:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:02:48,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 41 conjunts are in the unsatisfiable core [2020-12-09 13:02:48,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:02:48,026 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@4c3f4480 [2020-12-09 13:02:48,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439012959] [2020-12-09 13:02:48,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44cbbd4c-d7c7-4c76-a376-5dbcc71f9c2b/bin/utaipan/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 13:02:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:02:48,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 40 conjunts are in the unsatisfiable core [2020-12-09 13:02:48,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:02:48,108 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@4c3f4480 [2020-12-09 13:02:48,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:02:48,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-12-09 13:02:48,109 ERROR L205 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2020-12-09 13:02:48,109 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 13:02:48,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 mathsat -unsat_core_generation=3,46 z3 -smt2 -in SMTLIB2_COMPLIANT=true,45 cvc4 --incremental --print-success --lang smt [2020-12-09 13:02:48,734 WARN L254 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-12-09 13:02:48,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:02:48 BoogieIcfgContainer [2020-12-09 13:02:48,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 13:02:48,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 13:02:48,735 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 13:02:48,735 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 13:02:48,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:56:15" (3/4) ... [2020-12-09 13:02:48,738 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-09 13:02:48,738 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 13:02:48,738 INFO L168 Benchmark]: Toolchain (without parser) took 394538.91 ms. Allocated memory was 56.6 MB in the beginning and 83.9 MB in the end (delta: 27.3 MB). Free memory was 34.8 MB in the beginning and 18.4 MB in the end (delta: 16.5 MB). Peak memory consumption was 43.4 MB. Max. memory is 16.1 GB. [2020-12-09 13:02:48,739 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 56.6 MB. Free memory was 39.3 MB in the beginning and 39.2 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 13:02:48,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.33 ms. Allocated memory was 56.6 MB in the beginning and 83.9 MB in the end (delta: 27.3 MB). Free memory was 34.7 MB in the beginning and 52.9 MB in the end (delta: -18.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 13:02:48,739 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.48 ms. Allocated memory is still 83.9 MB. Free memory was 52.9 MB in the beginning and 50.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 13:02:48,739 INFO L168 Benchmark]: Boogie Preprocessor took 34.82 ms. Allocated memory is still 83.9 MB. Free memory was 50.8 MB in the beginning and 49.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 13:02:48,739 INFO L168 Benchmark]: RCFGBuilder took 453.18 ms. Allocated memory is still 83.9 MB. Free memory was 49.1 MB in the beginning and 46.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 12.1 MB. Max. memory is 16.1 GB. [2020-12-09 13:02:48,740 INFO L168 Benchmark]: TraceAbstraction took 393620.57 ms. Allocated memory is still 83.9 MB. Free memory was 45.8 MB in the beginning and 18.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.5 MB. Max. memory is 16.1 GB. [2020-12-09 13:02:48,740 INFO L168 Benchmark]: Witness Printer took 2.95 ms. Allocated memory is still 83.9 MB. Free memory is still 18.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 13:02:48,741 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.11 ms. Allocated memory is still 56.6 MB. Free memory was 39.3 MB in the beginning and 39.2 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 374.33 ms. Allocated memory was 56.6 MB in the beginning and 83.9 MB in the end (delta: 27.3 MB). Free memory was 34.7 MB in the beginning and 52.9 MB in the end (delta: -18.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 48.48 ms. Allocated memory is still 83.9 MB. Free memory was 52.9 MB in the beginning and 50.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.82 ms. Allocated memory is still 83.9 MB. Free memory was 50.8 MB in the beginning and 49.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 453.18 ms. Allocated memory is still 83.9 MB. Free memory was 49.1 MB in the beginning and 46.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 12.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 393620.57 ms. Allocated memory is still 83.9 MB. Free memory was 45.8 MB in the beginning and 18.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.5 MB. Max. memory is 16.1 GB. * Witness Printer took 2.95 ms. Allocated memory is still 83.9 MB. Free memory is still 18.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 604]: 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: [L614] const int len = 2; [L615] const int data = 1; [L584] SLL head = ((void *)0); [L585] COND TRUE len > 0 [L575] SLL temp = (SLL) malloc(sizeof(struct node)); [L576] COND FALSE !(((void *)0) == temp) [L579] temp->next = ((void *)0) [L580] temp->data = data [L581] return temp; [L586] SLL new_head = node_create(data); [L587] new_head->next = head [L588] head = new_head [L585] len-- [L585] COND TRUE len > 0 [L575] SLL temp = (SLL) malloc(sizeof(struct node)); [L576] COND FALSE !(((void *)0) == temp) [L579] temp->next = ((void *)0) [L580] temp->data = data [L581] return temp; [L586] SLL new_head = node_create(data); [L587] new_head->next = head [L588] head = new_head [L585] len-- [L585] COND FALSE !(len > 0) [L590] return head; [L616] SLL s = sll_create(len, data); [L617] int i; [L618] i = 0 [L618] COND TRUE i < len [L619] int new_data = i + len; [L607] COND FALSE !(index > 0) [L611] head->data = data [L618] i++ [L618] COND TRUE i < len [L619] int new_data = i + len; [L607] COND TRUE index > 0 [L608] EXPR head->next [L608] head = head->next [L609] index-- [L607] COND FALSE !(index > 0) [L611] head->data = data [L618] i++ [L618] COND FALSE !(i < len) [L622] i = 0 [L622] COND TRUE i < len [L623] int expected = i + len; [L600] COND FALSE !(index > 0) [L604] EXPR head->data [L604] return head->data; [L624] COND FALSE !(expected != sll_get_data_at(s, i)) [L622] i++ [L622] COND TRUE i < len [L623] int expected = i + len; [L600] COND TRUE index > 0 [L601] EXPR head->next [L601] head = head->next [L602] index-- [L600] COND FALSE !(index > 0) [L604] head->data - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 63 locations, 21 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 393.5s, OverallIterations: 19, TraceHistogramMax: 3, AutomataDifference: 158.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 994 SDtfs, 8302 SDslu, 3626 SDs, 0 SdLazy, 4097 SolverSat, 525 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 45.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2027 GetRequests, 1614 SyntacticMatches, 37 SemanticMatches, 376 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3876 ImplicationChecksByTransitivity, 239.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 973 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 133.2s InterpolantComputationTime, 1086 NumberOfCodeBlocks, 1086 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1894 ConstructedInterpolants, 189 QuantifiedInterpolants, 492980 SizeOfPredicates, 475 NumberOfNonLiveVariables, 5038 ConjunctsInSsa, 573 ConjunctsInUnsatCore, 72 InterpolantComputations, 12 PerfectInterpolantSequences, 408/759 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 Received shutdown request...