./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 129dca108ba5ab1702fbcd782a34bbf933adb446 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 129dca108ba5ab1702fbcd782a34bbf933adb446 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [1212387895] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [803200897] failed with TRACE_FEASIBLE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 14:14:08,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 14:14:08,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 14:14:08,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 14:14:08,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 14:14:08,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 14:14:08,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 14:14:08,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 14:14:08,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 14:14:08,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 14:14:08,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 14:14:08,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 14:14:08,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 14:14:08,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 14:14:08,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 14:14:08,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 14:14:08,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 14:14:08,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 14:14:08,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 14:14:08,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 14:14:08,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 14:14:08,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 14:14:08,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 14:14:08,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 14:14:08,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 14:14:08,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 14:14:08,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 14:14:08,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 14:14:08,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 14:14:08,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 14:14:08,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 14:14:08,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 14:14:08,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 14:14:08,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 14:14:08,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 14:14:08,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 14:14:08,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 14:14:08,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 14:14:08,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 14:14:08,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 14:14:08,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 14:14:08,515 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2020-12-09 14:14:08,537 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 14:14:08,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 14:14:08,538 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 14:14:08,539 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 14:14:08,539 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 14:14:08,539 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 14:14:08,539 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 14:14:08,539 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 14:14:08,540 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 14:14:08,540 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 14:14:08,540 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 14:14:08,540 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 14:14:08,540 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 14:14:08,540 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 14:14:08,541 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 14:14:08,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 14:14:08,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 14:14:08,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 14:14:08,542 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 14:14:08,542 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 14:14:08,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 14:14:08,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 14:14:08,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 14:14:08,543 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 14:14:08,543 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 14:14:08,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 14:14:08,543 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 14:14:08,543 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 14:14:08,543 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 14:14:08,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 14:14:08,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 14:14:08,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 14:14:08,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 14:14:08,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 14:14:08,545 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 14:14:08,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 14:14:08,545 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 14:14:08,545 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 14:14:08,545 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_8703cea7-aa9b-4409-a950-1a765ef3873f/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_8703cea7-aa9b-4409-a950-1a765ef3873f/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-memcleanup) ) 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 -> 129dca108ba5ab1702fbcd782a34bbf933adb446 [2020-12-09 14:14:08,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 14:14:08,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 14:14:08,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 14:14:08,749 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 14:14:08,749 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 14:14:08,750 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/../../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2020-12-09 14:14:08,789 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/data/d26ccca77/fb3206f6246342d382be92cbeb26c9de/FLAG5f4c5d230 [2020-12-09 14:14:09,197 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 14:14:09,198 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2020-12-09 14:14:09,210 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/data/d26ccca77/fb3206f6246342d382be92cbeb26c9de/FLAG5f4c5d230 [2020-12-09 14:14:09,222 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/data/d26ccca77/fb3206f6246342d382be92cbeb26c9de [2020-12-09 14:14:09,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 14:14:09,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 14:14:09,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 14:14:09,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 14:14:09,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 14:14:09,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:14:09" (1/1) ... [2020-12-09 14:14:09,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@739a5498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:14:09, skipping insertion in model container [2020-12-09 14:14:09,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:14:09" (1/1) ... [2020-12-09 14:14:09,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 14:14:09,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 14:14:09,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 14:14:09,505 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 14:14:09,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 14:14:09,580 INFO L208 MainTranslator]: Completed translation [2020-12-09 14:14:09,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:14:09 WrapperNode [2020-12-09 14:14:09,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 14:14:09,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 14:14:09,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 14:14:09,582 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 14:14:09,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:14:09" (1/1) ... [2020-12-09 14:14:09,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:14:09" (1/1) ... [2020-12-09 14:14:09,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 14:14:09,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 14:14:09,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 14:14:09,622 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 14:14:09,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:14:09" (1/1) ... [2020-12-09 14:14:09,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:14:09" (1/1) ... [2020-12-09 14:14:09,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:14:09" (1/1) ... [2020-12-09 14:14:09,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:14:09" (1/1) ... [2020-12-09 14:14:09,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:14:09" (1/1) ... [2020-12-09 14:14:09,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:14:09" (1/1) ... [2020-12-09 14:14:09,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:14:09" (1/1) ... [2020-12-09 14:14:09,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 14:14:09,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 14:14:09,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 14:14:09,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 14:14:09,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:14:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/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 14:14:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-09 14:14:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 14:14:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 14:14:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 14:14:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 14:14:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-09 14:14:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 14:14:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 14:14:09,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 14:14:10,204 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 14:14:10,204 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2020-12-09 14:14:10,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:14:10 BoogieIcfgContainer [2020-12-09 14:14:10,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 14:14:10,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 14:14:10,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 14:14:10,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 14:14:10,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:14:09" (1/3) ... [2020-12-09 14:14:10,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464ccdbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:14:10, skipping insertion in model container [2020-12-09 14:14:10,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:14:09" (2/3) ... [2020-12-09 14:14:10,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464ccdbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:14:10, skipping insertion in model container [2020-12-09 14:14:10,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:14:10" (3/3) ... [2020-12-09 14:14:10,212 INFO L111 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2020-12-09 14:14:10,222 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 14:14:10,224 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 58 error locations. [2020-12-09 14:14:10,231 INFO L253 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2020-12-09 14:14:10,246 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 14:14:10,246 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 14:14:10,246 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 14:14:10,246 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 14:14:10,246 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 14:14:10,246 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 14:14:10,246 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 14:14:10,246 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 14:14:10,260 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2020-12-09 14:14:10,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 14:14:10,264 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:14:10,264 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 14:14:10,265 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:14:10,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:14:10,268 INFO L82 PathProgramCache]: Analyzing trace with hash 287661, now seen corresponding path program 1 times [2020-12-09 14:14:10,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:14:10,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352886645] [2020-12-09 14:14:10,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:14:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:10,402 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 14:14:10,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352886645] [2020-12-09 14:14:10,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:14:10,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 14:14:10,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126673619] [2020-12-09 14:14:10,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 14:14:10,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:14:10,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 14:14:10,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 14:14:10,417 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2020-12-09 14:14:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:14:10,507 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2020-12-09 14:14:10,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 14:14:10,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 14:14:10,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:14:10,516 INFO L225 Difference]: With dead ends: 153 [2020-12-09 14:14:10,516 INFO L226 Difference]: Without dead ends: 151 [2020-12-09 14:14:10,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 14:14:10,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-12-09 14:14:10,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2020-12-09 14:14:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-12-09 14:14:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2020-12-09 14:14:10,547 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 3 [2020-12-09 14:14:10,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:14:10,547 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2020-12-09 14:14:10,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 14:14:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2020-12-09 14:14:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 14:14:10,547 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:14:10,547 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 14:14:10,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 14:14:10,548 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:14:10,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:14:10,549 INFO L82 PathProgramCache]: Analyzing trace with hash 287662, now seen corresponding path program 1 times [2020-12-09 14:14:10,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:14:10,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413460614] [2020-12-09 14:14:10,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:14:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:10,605 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 14:14:10,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413460614] [2020-12-09 14:14:10,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:14:10,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 14:14:10,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924519512] [2020-12-09 14:14:10,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 14:14:10,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:14:10,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 14:14:10,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 14:14:10,607 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand 3 states. [2020-12-09 14:14:10,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:14:10,731 INFO L93 Difference]: Finished difference Result 249 states and 284 transitions. [2020-12-09 14:14:10,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 14:14:10,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 14:14:10,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:14:10,736 INFO L225 Difference]: With dead ends: 249 [2020-12-09 14:14:10,736 INFO L226 Difference]: Without dead ends: 249 [2020-12-09 14:14:10,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 14:14:10,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-12-09 14:14:10,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 202. [2020-12-09 14:14:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-12-09 14:14:10,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 262 transitions. [2020-12-09 14:14:10,754 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 262 transitions. Word has length 3 [2020-12-09 14:14:10,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:14:10,754 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 262 transitions. [2020-12-09 14:14:10,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 14:14:10,755 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 262 transitions. [2020-12-09 14:14:10,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 14:14:10,755 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:14:10,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 14:14:10,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 14:14:10,756 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:14:10,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:14:10,757 INFO L82 PathProgramCache]: Analyzing trace with hash 8917474, now seen corresponding path program 1 times [2020-12-09 14:14:10,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:14:10,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153509873] [2020-12-09 14:14:10,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:14:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:10,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 14:14:10,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153509873] [2020-12-09 14:14:10,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:14:10,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 14:14:10,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664109051] [2020-12-09 14:14:10,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 14:14:10,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:14:10,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 14:14:10,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 14:14:10,874 INFO L87 Difference]: Start difference. First operand 202 states and 262 transitions. Second operand 4 states. [2020-12-09 14:14:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:14:11,080 INFO L93 Difference]: Finished difference Result 319 states and 400 transitions. [2020-12-09 14:14:11,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 14:14:11,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-12-09 14:14:11,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:14:11,082 INFO L225 Difference]: With dead ends: 319 [2020-12-09 14:14:11,083 INFO L226 Difference]: Without dead ends: 319 [2020-12-09 14:14:11,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 14:14:11,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-12-09 14:14:11,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 242. [2020-12-09 14:14:11,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-12-09 14:14:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 323 transitions. [2020-12-09 14:14:11,094 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 323 transitions. Word has length 4 [2020-12-09 14:14:11,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:14:11,094 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 323 transitions. [2020-12-09 14:14:11,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 14:14:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 323 transitions. [2020-12-09 14:14:11,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 14:14:11,095 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:14:11,095 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 14:14:11,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 14:14:11,095 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:14:11,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:14:11,096 INFO L82 PathProgramCache]: Analyzing trace with hash 276441741, now seen corresponding path program 1 times [2020-12-09 14:14:11,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:14:11,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826256223] [2020-12-09 14:14:11,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:14:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:11,207 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 14:14:11,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826256223] [2020-12-09 14:14:11,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:14:11,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 14:14:11,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593421571] [2020-12-09 14:14:11,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 14:14:11,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:14:11,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 14:14:11,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 14:14:11,208 INFO L87 Difference]: Start difference. First operand 242 states and 323 transitions. Second operand 4 states. [2020-12-09 14:14:11,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:14:11,380 INFO L93 Difference]: Finished difference Result 285 states and 341 transitions. [2020-12-09 14:14:11,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 14:14:11,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-12-09 14:14:11,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:14:11,382 INFO L225 Difference]: With dead ends: 285 [2020-12-09 14:14:11,382 INFO L226 Difference]: Without dead ends: 285 [2020-12-09 14:14:11,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 14:14:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-12-09 14:14:11,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 242. [2020-12-09 14:14:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-12-09 14:14:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 319 transitions. [2020-12-09 14:14:11,393 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 319 transitions. Word has length 5 [2020-12-09 14:14:11,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:14:11,393 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 319 transitions. [2020-12-09 14:14:11,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 14:14:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 319 transitions. [2020-12-09 14:14:11,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 14:14:11,394 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:14:11,394 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 14:14:11,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 14:14:11,394 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:14:11,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:14:11,395 INFO L82 PathProgramCache]: Analyzing trace with hash -20240572, now seen corresponding path program 1 times [2020-12-09 14:14:11,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:14:11,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210133491] [2020-12-09 14:14:11,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:14:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:11,438 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 14:14:11,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210133491] [2020-12-09 14:14:11,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:14:11,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 14:14:11,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079754452] [2020-12-09 14:14:11,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 14:14:11,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:14:11,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 14:14:11,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 14:14:11,440 INFO L87 Difference]: Start difference. First operand 242 states and 319 transitions. Second operand 4 states. [2020-12-09 14:14:11,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:14:11,531 INFO L93 Difference]: Finished difference Result 263 states and 340 transitions. [2020-12-09 14:14:11,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 14:14:11,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-12-09 14:14:11,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:14:11,532 INFO L225 Difference]: With dead ends: 263 [2020-12-09 14:14:11,532 INFO L226 Difference]: Without dead ends: 263 [2020-12-09 14:14:11,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 14:14:11,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-12-09 14:14:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 251. [2020-12-09 14:14:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-12-09 14:14:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 335 transitions. [2020-12-09 14:14:11,538 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 335 transitions. Word has length 6 [2020-12-09 14:14:11,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:14:11,538 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 335 transitions. [2020-12-09 14:14:11,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 14:14:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 335 transitions. [2020-12-09 14:14:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 14:14:11,539 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:14:11,539 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:14:11,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 14:14:11,539 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:14:11,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:14:11,540 INFO L82 PathProgramCache]: Analyzing trace with hash -627457681, now seen corresponding path program 1 times [2020-12-09 14:14:11,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:14:11,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385908518] [2020-12-09 14:14:11,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:14:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:11,579 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 14:14:11,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385908518] [2020-12-09 14:14:11,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:14:11,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 14:14:11,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380840916] [2020-12-09 14:14:11,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 14:14:11,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:14:11,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 14:14:11,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 14:14:11,581 INFO L87 Difference]: Start difference. First operand 251 states and 335 transitions. Second operand 3 states. [2020-12-09 14:14:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:14:11,628 INFO L93 Difference]: Finished difference Result 254 states and 337 transitions. [2020-12-09 14:14:11,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 14:14:11,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-09 14:14:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:14:11,630 INFO L225 Difference]: With dead ends: 254 [2020-12-09 14:14:11,630 INFO L226 Difference]: Without dead ends: 254 [2020-12-09 14:14:11,630 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 14:14:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-12-09 14:14:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2020-12-09 14:14:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-09 14:14:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 333 transitions. [2020-12-09 14:14:11,635 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 333 transitions. Word has length 7 [2020-12-09 14:14:11,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:14:11,635 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 333 transitions. [2020-12-09 14:14:11,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 14:14:11,635 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 333 transitions. [2020-12-09 14:14:11,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 14:14:11,635 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:14:11,636 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:14:11,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 14:14:11,636 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:14:11,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:14:11,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1943894891, now seen corresponding path program 1 times [2020-12-09 14:14:11,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:14:11,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041898157] [2020-12-09 14:14:11,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:14:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:14:11,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041898157] [2020-12-09 14:14:11,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192086124] [2020-12-09 14:14:11,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/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 14:14:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:11,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 14:14:11,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:14:11,900 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 14:14:11,901 INFO L348 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2020-12-09 14:14:11,902 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2020-12-09 14:14:11,908 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:14:11,968 INFO L625 ElimStorePlain]: treesize reduction 50, result has 53.3 percent of original size [2020-12-09 14:14:11,977 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 14:14:11,977 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:28, output treesize:12 [2020-12-09 14:14:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:14:12,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 14:14:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:14:12,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [228801626] [2020-12-09 14:14:12,074 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 14:14:12,074 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 14:14:12,078 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 14:14:12,083 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 14:14:12,084 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 14:14:12,151 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:12,241 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:12,252 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:12,891 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 14:14:13,063 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-12-09 14:14:14,812 WARN L197 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 257 DAG size of output: 197 [2020-12-09 14:14:16,530 WARN L197 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 267 DAG size of output: 204 [2020-12-09 14:14:17,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 14:14:17,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 2, 2] total 9 [2020-12-09 14:14:17,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034504808] [2020-12-09 14:14:17,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 14:14:17,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:14:17,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 14:14:17,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-12-09 14:14:17,016 INFO L87 Difference]: Start difference. First operand 250 states and 333 transitions. Second operand 5 states. [2020-12-09 14:14:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:14:17,509 INFO L93 Difference]: Finished difference Result 264 states and 338 transitions. [2020-12-09 14:14:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 14:14:17,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-09 14:14:17,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:14:17,511 INFO L225 Difference]: With dead ends: 264 [2020-12-09 14:14:17,511 INFO L226 Difference]: Without dead ends: 264 [2020-12-09 14:14:17,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-12-09 14:14:17,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2020-12-09 14:14:17,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 239. [2020-12-09 14:14:17,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-12-09 14:14:17,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 328 transitions. [2020-12-09 14:14:17,518 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 328 transitions. Word has length 11 [2020-12-09 14:14:17,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:14:17,518 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 328 transitions. [2020-12-09 14:14:17,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 14:14:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 328 transitions. [2020-12-09 14:14:17,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 14:14:17,519 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:14:17,519 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:14:17,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-09 14:14:17,721 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:14:17,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:14:17,723 INFO L82 PathProgramCache]: Analyzing trace with hash 235754267, now seen corresponding path program 1 times [2020-12-09 14:14:17,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:14:17,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718810708] [2020-12-09 14:14:17,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:14:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:17,755 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 14:14:17,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718810708] [2020-12-09 14:14:17,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970884535] [2020-12-09 14:14:17,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/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 14:14:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:17,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 14:14:17,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:14:17,819 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 14:14:17,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 14:14:17,831 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 14:14:17,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [920076133] [2020-12-09 14:14:17,833 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2020-12-09 14:14:17,833 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 14:14:17,833 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 14:14:17,833 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 14:14:17,833 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 14:14:17,866 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:17,877 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:17,888 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:18,679 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 14:14:18,884 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-12-09 14:14:19,019 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-12-09 14:14:19,206 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2020-12-09 14:14:19,385 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2020-12-09 14:14:19,578 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2020-12-09 14:14:20,027 WARN L197 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 83 [2020-12-09 14:14:22,113 WARN L197 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 265 DAG size of output: 203 [2020-12-09 14:14:24,157 WARN L197 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 260 DAG size of output: 199 [2020-12-09 14:14:24,302 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-12-09 14:14:24,386 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 14:14:24,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 14:14:24,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2020-12-09 14:14:24,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661033664] [2020-12-09 14:14:24,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 14:14:24,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:14:24,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 14:14:24,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-12-09 14:14:24,387 INFO L87 Difference]: Start difference. First operand 239 states and 328 transitions. Second operand 5 states. [2020-12-09 14:14:24,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:14:24,449 INFO L93 Difference]: Finished difference Result 327 states and 415 transitions. [2020-12-09 14:14:24,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 14:14:24,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-09 14:14:24,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:14:24,451 INFO L225 Difference]: With dead ends: 327 [2020-12-09 14:14:24,451 INFO L226 Difference]: Without dead ends: 327 [2020-12-09 14:14:24,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-12-09 14:14:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-12-09 14:14:24,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 253. [2020-12-09 14:14:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-12-09 14:14:24,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 345 transitions. [2020-12-09 14:14:24,456 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 345 transitions. Word has length 13 [2020-12-09 14:14:24,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:14:24,457 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 345 transitions. [2020-12-09 14:14:24,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 14:14:24,457 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 345 transitions. [2020-12-09 14:14:24,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 14:14:24,457 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:14:24,457 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 14:14:24,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 14:14:24,660 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:14:24,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:14:24,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1332796270, now seen corresponding path program 1 times [2020-12-09 14:14:24,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:14:24,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486473092] [2020-12-09 14:14:24,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:14:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:24,684 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 14:14:24,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486473092] [2020-12-09 14:14:24,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:14:24,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 14:14:24,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817376923] [2020-12-09 14:14:24,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 14:14:24,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:14:24,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 14:14:24,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 14:14:24,685 INFO L87 Difference]: Start difference. First operand 253 states and 345 transitions. Second operand 3 states. [2020-12-09 14:14:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:14:24,696 INFO L93 Difference]: Finished difference Result 322 states and 412 transitions. [2020-12-09 14:14:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 14:14:24,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-12-09 14:14:24,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:14:24,698 INFO L225 Difference]: With dead ends: 322 [2020-12-09 14:14:24,698 INFO L226 Difference]: Without dead ends: 322 [2020-12-09 14:14:24,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:14:24,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-12-09 14:14:24,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 234. [2020-12-09 14:14:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-12-09 14:14:24,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 308 transitions. [2020-12-09 14:14:24,702 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 308 transitions. Word has length 17 [2020-12-09 14:14:24,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:14:24,702 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 308 transitions. [2020-12-09 14:14:24,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 14:14:24,703 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 308 transitions. [2020-12-09 14:14:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 14:14:24,703 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:14:24,703 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 14:14:24,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-09 14:14:24,704 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:14:24,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:14:24,704 INFO L82 PathProgramCache]: Analyzing trace with hash 672798198, now seen corresponding path program 1 times [2020-12-09 14:14:24,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:14:24,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502613952] [2020-12-09 14:14:24,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:14:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:24,748 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 14:14:24,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502613952] [2020-12-09 14:14:24,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:14:24,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 14:14:24,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946507272] [2020-12-09 14:14:24,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 14:14:24,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:14:24,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 14:14:24,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 14:14:24,749 INFO L87 Difference]: Start difference. First operand 234 states and 308 transitions. Second operand 5 states. [2020-12-09 14:14:24,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:14:24,897 INFO L93 Difference]: Finished difference Result 307 states and 363 transitions. [2020-12-09 14:14:24,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 14:14:24,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-12-09 14:14:24,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:14:24,898 INFO L225 Difference]: With dead ends: 307 [2020-12-09 14:14:24,898 INFO L226 Difference]: Without dead ends: 307 [2020-12-09 14:14:24,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 14:14:24,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2020-12-09 14:14:24,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 230. [2020-12-09 14:14:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-09 14:14:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 285 transitions. [2020-12-09 14:14:24,903 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 285 transitions. Word has length 19 [2020-12-09 14:14:24,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:14:24,903 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 285 transitions. [2020-12-09 14:14:24,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 14:14:24,904 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 285 transitions. [2020-12-09 14:14:24,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 14:14:24,904 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:14:24,904 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 14:14:24,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-12-09 14:14:24,905 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:14:24,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:14:24,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1363071017, now seen corresponding path program 1 times [2020-12-09 14:14:24,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:14:24,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866757386] [2020-12-09 14:14:24,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:14:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:24,944 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 14:14:24,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866757386] [2020-12-09 14:14:24,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:14:24,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 14:14:24,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143092668] [2020-12-09 14:14:24,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 14:14:24,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:14:24,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 14:14:24,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 14:14:24,945 INFO L87 Difference]: Start difference. First operand 230 states and 285 transitions. Second operand 5 states. [2020-12-09 14:14:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:14:25,031 INFO L93 Difference]: Finished difference Result 287 states and 344 transitions. [2020-12-09 14:14:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 14:14:25,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-12-09 14:14:25,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:14:25,033 INFO L225 Difference]: With dead ends: 287 [2020-12-09 14:14:25,033 INFO L226 Difference]: Without dead ends: 287 [2020-12-09 14:14:25,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 14:14:25,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-12-09 14:14:25,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 229. [2020-12-09 14:14:25,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-12-09 14:14:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 281 transitions. [2020-12-09 14:14:25,038 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 281 transitions. Word has length 20 [2020-12-09 14:14:25,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:14:25,038 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 281 transitions. [2020-12-09 14:14:25,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 14:14:25,038 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 281 transitions. [2020-12-09 14:14:25,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 14:14:25,039 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:14:25,039 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] [2020-12-09 14:14:25,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-12-09 14:14:25,039 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:14:25,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:14:25,039 INFO L82 PathProgramCache]: Analyzing trace with hash 694471571, now seen corresponding path program 1 times [2020-12-09 14:14:25,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:14:25,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755615464] [2020-12-09 14:14:25,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:14:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:25,098 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 14:14:25,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755615464] [2020-12-09 14:14:25,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:14:25,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 14:14:25,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396062671] [2020-12-09 14:14:25,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 14:14:25,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:14:25,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 14:14:25,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 14:14:25,099 INFO L87 Difference]: Start difference. First operand 229 states and 281 transitions. Second operand 4 states. [2020-12-09 14:14:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:14:25,198 INFO L93 Difference]: Finished difference Result 316 states and 380 transitions. [2020-12-09 14:14:25,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 14:14:25,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-12-09 14:14:25,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:14:25,200 INFO L225 Difference]: With dead ends: 316 [2020-12-09 14:14:25,200 INFO L226 Difference]: Without dead ends: 316 [2020-12-09 14:14:25,200 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 14:14:25,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-12-09 14:14:25,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 241. [2020-12-09 14:14:25,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-12-09 14:14:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 298 transitions. [2020-12-09 14:14:25,205 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 298 transitions. Word has length 21 [2020-12-09 14:14:25,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:14:25,205 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 298 transitions. [2020-12-09 14:14:25,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 14:14:25,205 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 298 transitions. [2020-12-09 14:14:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 14:14:25,205 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:14:25,205 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] [2020-12-09 14:14:25,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-12-09 14:14:25,206 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:14:25,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:14:25,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1980992075, now seen corresponding path program 1 times [2020-12-09 14:14:25,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:14:25,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828663177] [2020-12-09 14:14:25,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:14:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:25,396 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 14:14:25,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828663177] [2020-12-09 14:14:25,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:14:25,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 14:14:25,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891233192] [2020-12-09 14:14:25,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 14:14:25,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:14:25,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 14:14:25,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 14:14:25,398 INFO L87 Difference]: Start difference. First operand 241 states and 298 transitions. Second operand 7 states. [2020-12-09 14:14:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:14:25,754 INFO L93 Difference]: Finished difference Result 310 states and 361 transitions. [2020-12-09 14:14:25,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 14:14:25,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-12-09 14:14:25,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:14:25,756 INFO L225 Difference]: With dead ends: 310 [2020-12-09 14:14:25,756 INFO L226 Difference]: Without dead ends: 310 [2020-12-09 14:14:25,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-12-09 14:14:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-12-09 14:14:25,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 240. [2020-12-09 14:14:25,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2020-12-09 14:14:25,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 292 transitions. [2020-12-09 14:14:25,761 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 292 transitions. Word has length 21 [2020-12-09 14:14:25,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:14:25,762 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 292 transitions. [2020-12-09 14:14:25,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 14:14:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 292 transitions. [2020-12-09 14:14:25,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 14:14:25,762 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:14:25,762 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 14:14:25,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-12-09 14:14:25,763 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:14:25,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:14:25,763 INFO L82 PathProgramCache]: Analyzing trace with hash 783755557, now seen corresponding path program 1 times [2020-12-09 14:14:25,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:14:25,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508456934] [2020-12-09 14:14:25,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:14:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:25,898 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 14:14:25,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508456934] [2020-12-09 14:14:25,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941044471] [2020-12-09 14:14:25,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/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 14:14:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:25,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 14:14:25,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:14:25,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 14:14:25,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 14:14:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 14:14:26,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [786704658] [2020-12-09 14:14:26,034 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2020-12-09 14:14:26,034 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 14:14:26,034 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 14:14:26,034 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 14:14:26,034 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 14:14:26,068 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:26,149 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:26,158 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:26,857 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 14:14:27,083 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-12-09 14:14:27,216 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-12-09 14:14:27,401 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2020-12-09 14:14:27,588 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2020-12-09 14:14:27,794 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2020-12-09 14:14:28,239 WARN L197 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 83 [2020-12-09 14:14:30,426 WARN L197 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 265 DAG size of output: 203 [2020-12-09 14:14:32,573 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 260 DAG size of output: 199 [2020-12-09 14:14:32,733 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-12-09 14:14:32,968 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 14:14:32,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 14:14:32,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2020-12-09 14:14:32,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521439886] [2020-12-09 14:14:32,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 14:14:32,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:14:32,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 14:14:32,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2020-12-09 14:14:32,969 INFO L87 Difference]: Start difference. First operand 240 states and 292 transitions. Second operand 13 states. [2020-12-09 14:14:33,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:14:33,316 INFO L93 Difference]: Finished difference Result 395 states and 452 transitions. [2020-12-09 14:14:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 14:14:33,316 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-12-09 14:14:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:14:33,318 INFO L225 Difference]: With dead ends: 395 [2020-12-09 14:14:33,318 INFO L226 Difference]: Without dead ends: 395 [2020-12-09 14:14:33,318 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2020-12-09 14:14:33,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2020-12-09 14:14:33,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 192. [2020-12-09 14:14:33,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-12-09 14:14:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 231 transitions. [2020-12-09 14:14:33,322 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 231 transitions. Word has length 22 [2020-12-09 14:14:33,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:14:33,322 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 231 transitions. [2020-12-09 14:14:33,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 14:14:33,323 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 231 transitions. [2020-12-09 14:14:33,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 14:14:33,323 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:14:33,323 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 14:14:33,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2020-12-09 14:14:33,524 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:14:33,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:14:33,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1062867593, now seen corresponding path program 1 times [2020-12-09 14:14:33,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:14:33,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504918731] [2020-12-09 14:14:33,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:14:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:33,647 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 14:14:33,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504918731] [2020-12-09 14:14:33,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:14:33,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 14:14:33,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510350726] [2020-12-09 14:14:33,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 14:14:33,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:14:33,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 14:14:33,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 14:14:33,648 INFO L87 Difference]: Start difference. First operand 192 states and 231 transitions. Second operand 6 states. [2020-12-09 14:14:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:14:33,800 INFO L93 Difference]: Finished difference Result 200 states and 237 transitions. [2020-12-09 14:14:33,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 14:14:33,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-12-09 14:14:33,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:14:33,802 INFO L225 Difference]: With dead ends: 200 [2020-12-09 14:14:33,802 INFO L226 Difference]: Without dead ends: 200 [2020-12-09 14:14:33,802 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-09 14:14:33,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-12-09 14:14:33,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 179. [2020-12-09 14:14:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-12-09 14:14:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 210 transitions. [2020-12-09 14:14:33,806 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 210 transitions. Word has length 23 [2020-12-09 14:14:33,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:14:33,806 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 210 transitions. [2020-12-09 14:14:33,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 14:14:33,807 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 210 transitions. [2020-12-09 14:14:33,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 14:14:33,807 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:14:33,807 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:14:33,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2020-12-09 14:14:33,808 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:14:33,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:14:33,808 INFO L82 PathProgramCache]: Analyzing trace with hash 209500793, now seen corresponding path program 1 times [2020-12-09 14:14:33,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:14:33,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358904698] [2020-12-09 14:14:33,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:14:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:14:33,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358904698] [2020-12-09 14:14:33,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484340153] [2020-12-09 14:14:33,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/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 14:14:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:33,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 14:14:33,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:14:34,043 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 14:14:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:14:34,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 14:14:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:14:34,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [86511692] [2020-12-09 14:14:34,174 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 14:14:34,174 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 14:14:34,174 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 14:14:34,174 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 14:14:34,174 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 14:14:34,199 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:34,278 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:34,286 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:34,462 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 14:14:35,038 WARN L197 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 183 [2020-12-09 14:14:35,706 WARN L197 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 191 [2020-12-09 14:14:36,542 WARN L197 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 190 [2020-12-09 14:14:37,508 WARN L197 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 204 [2020-12-09 14:14:37,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 14:14:37,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 3, 3] total 13 [2020-12-09 14:14:37,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267170234] [2020-12-09 14:14:37,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 14:14:37,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:14:37,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 14:14:37,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-12-09 14:14:37,511 INFO L87 Difference]: Start difference. First operand 179 states and 210 transitions. Second operand 6 states. [2020-12-09 14:14:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:14:37,897 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2020-12-09 14:14:37,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 14:14:37,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-12-09 14:14:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:14:37,898 INFO L225 Difference]: With dead ends: 181 [2020-12-09 14:14:37,898 INFO L226 Difference]: Without dead ends: 181 [2020-12-09 14:14:37,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-12-09 14:14:37,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-12-09 14:14:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2020-12-09 14:14:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-12-09 14:14:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 211 transitions. [2020-12-09 14:14:37,901 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 211 transitions. Word has length 25 [2020-12-09 14:14:37,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:14:37,902 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 211 transitions. [2020-12-09 14:14:37,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 14:14:37,902 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 211 transitions. [2020-12-09 14:14:37,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 14:14:37,902 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:14:37,902 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:14:38,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 14:14:38,103 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:14:38,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:14:38,103 INFO L82 PathProgramCache]: Analyzing trace with hash -120436131, now seen corresponding path program 1 times [2020-12-09 14:14:38,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:14:38,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663476810] [2020-12-09 14:14:38,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:14:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:14:38,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663476810] [2020-12-09 14:14:38,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681857748] [2020-12-09 14:14:38,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/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 14:14:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:38,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 14:14:38,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:14:38,356 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 14:14:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:14:38,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 14:14:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:14:38,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2104246908] [2020-12-09 14:14:38,645 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2020-12-09 14:14:38,645 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 14:14:38,645 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 14:14:38,645 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 14:14:38,645 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 14:14:38,672 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:38,681 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:38,765 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:38,962 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:39,346 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 14:14:39,590 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2020-12-09 14:14:40,207 WARN L197 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 183 [2020-12-09 14:14:40,942 WARN L197 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 191 [2020-12-09 14:14:42,074 WARN L197 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 190 [2020-12-09 14:14:43,155 WARN L197 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 204 [2020-12-09 14:14:44,122 WARN L197 SmtUtils]: Spent 872.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 212 [2020-12-09 14:14:44,727 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2020-12-09 14:14:44,970 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-12-09 14:14:45,225 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2020-12-09 14:14:45,505 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2020-12-09 14:14:45,793 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2020-12-09 14:14:46,395 WARN L197 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 113 [2020-12-09 14:14:46,857 WARN L197 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 107 [2020-12-09 14:14:46,858 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 14:14:46,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 14:14:46,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2020-12-09 14:14:46,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585116342] [2020-12-09 14:14:46,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-09 14:14:46,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:14:46,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-09 14:14:46,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2020-12-09 14:14:46,859 INFO L87 Difference]: Start difference. First operand 181 states and 211 transitions. Second operand 15 states. [2020-12-09 14:14:47,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:14:47,580 INFO L93 Difference]: Finished difference Result 366 states and 405 transitions. [2020-12-09 14:14:47,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 14:14:47,580 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-09 14:14:47,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:14:47,582 INFO L225 Difference]: With dead ends: 366 [2020-12-09 14:14:47,582 INFO L226 Difference]: Without dead ends: 366 [2020-12-09 14:14:47,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=296, Invalid=1344, Unknown=0, NotChecked=0, Total=1640 [2020-12-09 14:14:47,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2020-12-09 14:14:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 173. [2020-12-09 14:14:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-12-09 14:14:47,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 203 transitions. [2020-12-09 14:14:47,586 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 203 transitions. Word has length 27 [2020-12-09 14:14:47,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:14:47,586 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 203 transitions. [2020-12-09 14:14:47,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-09 14:14:47,586 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2020-12-09 14:14:47,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 14:14:47,586 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:14:47,587 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:14:47,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 14:14:47,788 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:14:47,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:14:47,790 INFO L82 PathProgramCache]: Analyzing trace with hash 561447274, now seen corresponding path program 1 times [2020-12-09 14:14:47,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:14:47,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069192770] [2020-12-09 14:14:47,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:14:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:14:47,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069192770] [2020-12-09 14:14:47,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016238654] [2020-12-09 14:14:47,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/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 14:14:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:14:48,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 14:14:48,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:14:48,193 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 37 [2020-12-09 14:14:49,267 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 14:14:49,444 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 14:14:49,621 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 14:14:49,799 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 14:14:49,975 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 14:14:50,149 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 14:14:50,368 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2020-12-09 14:14:50,649 WARN L197 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2020-12-09 14:14:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:14:51,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 14:14:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:14:51,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1894905308] [2020-12-09 14:14:51,825 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2020-12-09 14:14:51,825 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 14:14:51,825 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 14:14:51,825 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 14:14:51,825 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 14:14:51,847 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:51,856 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:51,865 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:52,120 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:14:52,480 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 14:14:52,660 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2020-12-09 14:14:53,290 WARN L197 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 183 [2020-12-09 14:14:54,066 WARN L197 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 191 [2020-12-09 14:14:55,239 WARN L197 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 190 [2020-12-09 14:14:56,283 WARN L197 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 204 [2020-12-09 14:14:57,415 WARN L197 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 255 DAG size of output: 218 [2020-12-09 14:14:58,817 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 260 DAG size of output: 217 [2020-12-09 14:15:00,082 WARN L197 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 256 DAG size of output: 213 [2020-12-09 14:15:00,512 WARN L197 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2020-12-09 14:15:00,976 WARN L197 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2020-12-09 14:15:01,496 WARN L197 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2020-12-09 14:15:01,989 WARN L197 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2020-12-09 14:15:02,522 WARN L197 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2020-12-09 14:15:03,069 WARN L197 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2020-12-09 14:15:03,259 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2020-12-09 14:15:03,308 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 14:15:03,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 14:15:03,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 14 [2020-12-09 14:15:03,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69007718] [2020-12-09 14:15:03,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-09 14:15:03,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:15:03,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-09 14:15:03,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=744, Unknown=0, NotChecked=0, Total=930 [2020-12-09 14:15:03,309 INFO L87 Difference]: Start difference. First operand 173 states and 203 transitions. Second operand 16 states. [2020-12-09 14:15:03,552 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2020-12-09 14:15:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:15:04,443 INFO L93 Difference]: Finished difference Result 335 states and 384 transitions. [2020-12-09 14:15:04,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 14:15:04,444 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2020-12-09 14:15:04,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:15:04,445 INFO L225 Difference]: With dead ends: 335 [2020-12-09 14:15:04,445 INFO L226 Difference]: Without dead ends: 335 [2020-12-09 14:15:04,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 28 SyntacticMatches, 34 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=252, Invalid=1008, Unknown=0, NotChecked=0, Total=1260 [2020-12-09 14:15:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-12-09 14:15:04,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 190. [2020-12-09 14:15:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-12-09 14:15:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 229 transitions. [2020-12-09 14:15:04,449 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 229 transitions. Word has length 28 [2020-12-09 14:15:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:15:04,449 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 229 transitions. [2020-12-09 14:15:04,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-09 14:15:04,449 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 229 transitions. [2020-12-09 14:15:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-09 14:15:04,450 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:15:04,450 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:15:04,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 14:15:04,651 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:15:04,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:15:04,653 INFO L82 PathProgramCache]: Analyzing trace with hash 224996444, now seen corresponding path program 1 times [2020-12-09 14:15:04,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:15:04,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84788481] [2020-12-09 14:15:04,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:15:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:15:04,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:15:04,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84788481] [2020-12-09 14:15:04,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154669437] [2020-12-09 14:15:04,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/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 14:15:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:15:05,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-09 14:15:05,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:15:05,179 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2020-12-09 14:15:06,050 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2020-12-09 14:15:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:15:06,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 14:15:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:15:29,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1127571381] [2020-12-09 14:15:29,663 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2020-12-09 14:15:29,664 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 14:15:29,664 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 14:15:29,664 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 14:15:29,664 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 14:15:29,686 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:15:29,697 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:15:29,706 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:15:29,993 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:15:30,320 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 14:15:30,643 WARN L197 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 86 [2020-12-09 14:15:31,364 WARN L197 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 183 [2020-12-09 14:15:32,266 WARN L197 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 191 [2020-12-09 14:15:33,771 WARN L197 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 190 [2020-12-09 14:15:35,054 WARN L197 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 235 DAG size of output: 204 [2020-12-09 14:15:36,149 WARN L197 SmtUtils]: Spent 960.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 212 [2020-12-09 14:15:37,669 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 263 DAG size of output: 212 [2020-12-09 14:15:38,901 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 259 DAG size of output: 208 [2020-12-09 14:15:39,188 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-12-09 14:15:39,469 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2020-12-09 14:15:39,810 WARN L197 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2020-12-09 14:15:40,149 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2020-12-09 14:15:40,494 WARN L197 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2020-12-09 14:15:40,862 WARN L197 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2020-12-09 14:15:41,117 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2020-12-09 14:15:41,194 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 14:15:41,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 14:15:41,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2020-12-09 14:15:41,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109344054] [2020-12-09 14:15:41,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-09 14:15:41,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:15:41,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-09 14:15:41,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1021, Unknown=1, NotChecked=0, Total=1260 [2020-12-09 14:15:41,196 INFO L87 Difference]: Start difference. First operand 190 states and 229 transitions. Second operand 21 states. [2020-12-09 14:15:41,917 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2020-12-09 14:15:43,216 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2020-12-09 14:15:43,548 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2020-12-09 14:15:44,027 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2020-12-09 14:15:44,434 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2020-12-09 14:15:44,692 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2020-12-09 14:15:45,538 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2020-12-09 14:15:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:15:47,506 INFO L93 Difference]: Finished difference Result 597 states and 674 transitions. [2020-12-09 14:15:47,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-12-09 14:15:47,507 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2020-12-09 14:15:47,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:15:47,509 INFO L225 Difference]: With dead ends: 597 [2020-12-09 14:15:47,509 INFO L226 Difference]: Without dead ends: 597 [2020-12-09 14:15:47,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 25 SyntacticMatches, 34 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1813 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=711, Invalid=3578, Unknown=1, NotChecked=0, Total=4290 [2020-12-09 14:15:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-12-09 14:15:47,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 188. [2020-12-09 14:15:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-12-09 14:15:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 226 transitions. [2020-12-09 14:15:47,514 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 226 transitions. Word has length 29 [2020-12-09 14:15:47,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:15:47,514 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 226 transitions. [2020-12-09 14:15:47,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-09 14:15:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 226 transitions. [2020-12-09 14:15:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-09 14:15:47,515 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:15:47,515 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, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:15:47,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 14:15:47,717 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:15:47,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:15:47,718 INFO L82 PathProgramCache]: Analyzing trace with hash 162650540, now seen corresponding path program 1 times [2020-12-09 14:15:47,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:15:47,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484135065] [2020-12-09 14:15:47,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:15:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:15:47,771 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 14:15:47,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484135065] [2020-12-09 14:15:47,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:15:47,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 14:15:47,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799893771] [2020-12-09 14:15:47,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 14:15:47,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:15:47,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 14:15:47,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 14:15:47,773 INFO L87 Difference]: Start difference. First operand 188 states and 226 transitions. Second operand 3 states. [2020-12-09 14:15:47,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:15:47,784 INFO L93 Difference]: Finished difference Result 267 states and 327 transitions. [2020-12-09 14:15:47,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 14:15:47,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-12-09 14:15:47,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:15:47,785 INFO L225 Difference]: With dead ends: 267 [2020-12-09 14:15:47,785 INFO L226 Difference]: Without dead ends: 267 [2020-12-09 14:15:47,786 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:15:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-12-09 14:15:47,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 163. [2020-12-09 14:15:47,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-09 14:15:47,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 199 transitions. [2020-12-09 14:15:47,788 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 199 transitions. Word has length 30 [2020-12-09 14:15:47,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:15:47,788 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 199 transitions. [2020-12-09 14:15:47,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 14:15:47,788 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 199 transitions. [2020-12-09 14:15:47,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-09 14:15:47,789 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:15:47,789 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:15:47,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2020-12-09 14:15:47,789 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:15:47,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:15:47,789 INFO L82 PathProgramCache]: Analyzing trace with hash 747815319, now seen corresponding path program 1 times [2020-12-09 14:15:47,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:15:47,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375970719] [2020-12-09 14:15:47,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:15:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:15:47,813 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 14:15:47,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375970719] [2020-12-09 14:15:47,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:15:47,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 14:15:47,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800682719] [2020-12-09 14:15:47,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 14:15:47,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:15:47,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 14:15:47,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 14:15:47,814 INFO L87 Difference]: Start difference. First operand 163 states and 199 transitions. Second operand 4 states. [2020-12-09 14:15:47,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:15:47,857 INFO L93 Difference]: Finished difference Result 208 states and 254 transitions. [2020-12-09 14:15:47,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 14:15:47,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-12-09 14:15:47,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:15:47,858 INFO L225 Difference]: With dead ends: 208 [2020-12-09 14:15:47,858 INFO L226 Difference]: Without dead ends: 208 [2020-12-09 14:15:47,859 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 14:15:47,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-12-09 14:15:47,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 161. [2020-12-09 14:15:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-12-09 14:15:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 197 transitions. [2020-12-09 14:15:47,863 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 197 transitions. Word has length 31 [2020-12-09 14:15:47,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:15:47,864 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 197 transitions. [2020-12-09 14:15:47,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 14:15:47,864 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 197 transitions. [2020-12-09 14:15:47,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-09 14:15:47,864 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:15:47,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:15:47,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2020-12-09 14:15:47,864 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:15:47,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:15:47,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1707438595, now seen corresponding path program 1 times [2020-12-09 14:15:47,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:15:47,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019720074] [2020-12-09 14:15:47,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:15:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:15:47,891 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 14:15:47,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019720074] [2020-12-09 14:15:47,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:15:47,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 14:15:47,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318116895] [2020-12-09 14:15:47,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 14:15:47,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:15:47,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 14:15:47,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 14:15:47,893 INFO L87 Difference]: Start difference. First operand 161 states and 197 transitions. Second operand 4 states. [2020-12-09 14:15:47,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:15:47,956 INFO L93 Difference]: Finished difference Result 206 states and 252 transitions. [2020-12-09 14:15:47,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 14:15:47,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-12-09 14:15:47,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:15:47,958 INFO L225 Difference]: With dead ends: 206 [2020-12-09 14:15:47,958 INFO L226 Difference]: Without dead ends: 206 [2020-12-09 14:15:47,958 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 14:15:47,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-12-09 14:15:47,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 159. [2020-12-09 14:15:47,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-12-09 14:15:47,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 195 transitions. [2020-12-09 14:15:47,961 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 195 transitions. Word has length 32 [2020-12-09 14:15:47,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:15:47,961 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 195 transitions. [2020-12-09 14:15:47,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 14:15:47,961 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 195 transitions. [2020-12-09 14:15:47,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 14:15:47,961 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:15:47,961 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:15:47,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2020-12-09 14:15:47,962 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:15:47,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:15:47,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1390989081, now seen corresponding path program 1 times [2020-12-09 14:15:47,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:15:47,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400359551] [2020-12-09 14:15:47,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:15:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:15:47,996 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 14:15:47,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400359551] [2020-12-09 14:15:47,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:15:47,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 14:15:47,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261859867] [2020-12-09 14:15:47,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 14:15:47,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:15:47,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 14:15:47,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 14:15:47,997 INFO L87 Difference]: Start difference. First operand 159 states and 195 transitions. Second operand 4 states. [2020-12-09 14:15:48,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:15:48,118 INFO L93 Difference]: Finished difference Result 219 states and 267 transitions. [2020-12-09 14:15:48,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 14:15:48,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-12-09 14:15:48,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:15:48,120 INFO L225 Difference]: With dead ends: 219 [2020-12-09 14:15:48,120 INFO L226 Difference]: Without dead ends: 219 [2020-12-09 14:15:48,120 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 14:15:48,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-12-09 14:15:48,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 209. [2020-12-09 14:15:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-12-09 14:15:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 260 transitions. [2020-12-09 14:15:48,124 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 260 transitions. Word has length 33 [2020-12-09 14:15:48,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:15:48,124 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 260 transitions. [2020-12-09 14:15:48,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 14:15:48,124 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 260 transitions. [2020-12-09 14:15:48,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 14:15:48,124 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:15:48,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:15:48,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2020-12-09 14:15:48,125 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:15:48,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:15:48,125 INFO L82 PathProgramCache]: Analyzing trace with hash -884626401, now seen corresponding path program 1 times [2020-12-09 14:15:48,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:15:48,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362025468] [2020-12-09 14:15:48,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:15:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:15:48,180 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 14:15:48,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362025468] [2020-12-09 14:15:48,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:15:48,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 14:15:48,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355442931] [2020-12-09 14:15:48,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 14:15:48,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:15:48,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 14:15:48,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 14:15:48,181 INFO L87 Difference]: Start difference. First operand 209 states and 260 transitions. Second operand 5 states. [2020-12-09 14:15:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:15:48,281 INFO L93 Difference]: Finished difference Result 230 states and 276 transitions. [2020-12-09 14:15:48,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 14:15:48,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2020-12-09 14:15:48,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:15:48,283 INFO L225 Difference]: With dead ends: 230 [2020-12-09 14:15:48,283 INFO L226 Difference]: Without dead ends: 230 [2020-12-09 14:15:48,283 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 14:15:48,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-12-09 14:15:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 209. [2020-12-09 14:15:48,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-12-09 14:15:48,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 257 transitions. [2020-12-09 14:15:48,286 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 257 transitions. Word has length 36 [2020-12-09 14:15:48,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:15:48,286 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 257 transitions. [2020-12-09 14:15:48,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 14:15:48,286 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 257 transitions. [2020-12-09 14:15:48,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-09 14:15:48,287 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:15:48,287 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:15:48,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2020-12-09 14:15:48,287 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:15:48,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:15:48,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1653614430, now seen corresponding path program 1 times [2020-12-09 14:15:48,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:15:48,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53773705] [2020-12-09 14:15:48,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:15:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:15:48,358 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 14:15:48,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53773705] [2020-12-09 14:15:48,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:15:48,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 14:15:48,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274141817] [2020-12-09 14:15:48,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 14:15:48,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:15:48,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 14:15:48,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 14:15:48,360 INFO L87 Difference]: Start difference. First operand 209 states and 257 transitions. Second operand 5 states. [2020-12-09 14:15:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:15:48,453 INFO L93 Difference]: Finished difference Result 212 states and 253 transitions. [2020-12-09 14:15:48,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 14:15:48,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-12-09 14:15:48,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:15:48,455 INFO L225 Difference]: With dead ends: 212 [2020-12-09 14:15:48,455 INFO L226 Difference]: Without dead ends: 212 [2020-12-09 14:15:48,455 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 14:15:48,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-12-09 14:15:48,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 208. [2020-12-09 14:15:48,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-12-09 14:15:48,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 250 transitions. [2020-12-09 14:15:48,457 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 250 transitions. Word has length 37 [2020-12-09 14:15:48,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:15:48,458 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 250 transitions. [2020-12-09 14:15:48,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 14:15:48,458 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 250 transitions. [2020-12-09 14:15:48,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-09 14:15:48,458 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:15:48,458 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:15:48,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2020-12-09 14:15:48,458 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:15:48,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:15:48,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1361604076, now seen corresponding path program 1 times [2020-12-09 14:15:48,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:15:48,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752934464] [2020-12-09 14:15:48,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:15:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:15:48,530 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 14:15:48,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752934464] [2020-12-09 14:15:48,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:15:48,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 14:15:48,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27502410] [2020-12-09 14:15:48,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 14:15:48,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:15:48,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 14:15:48,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 14:15:48,531 INFO L87 Difference]: Start difference. First operand 208 states and 250 transitions. Second operand 6 states. [2020-12-09 14:15:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:15:48,644 INFO L93 Difference]: Finished difference Result 214 states and 256 transitions. [2020-12-09 14:15:48,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 14:15:48,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-12-09 14:15:48,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:15:48,646 INFO L225 Difference]: With dead ends: 214 [2020-12-09 14:15:48,646 INFO L226 Difference]: Without dead ends: 214 [2020-12-09 14:15:48,646 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 14:15:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-12-09 14:15:48,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 207. [2020-12-09 14:15:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-12-09 14:15:48,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 249 transitions. [2020-12-09 14:15:48,648 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 249 transitions. Word has length 38 [2020-12-09 14:15:48,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:15:48,649 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 249 transitions. [2020-12-09 14:15:48,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 14:15:48,649 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 249 transitions. [2020-12-09 14:15:48,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-09 14:15:48,649 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:15:48,649 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:15:48,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2020-12-09 14:15:48,649 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:15:48,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:15:48,650 INFO L82 PathProgramCache]: Analyzing trace with hash 739946761, now seen corresponding path program 1 times [2020-12-09 14:15:48,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:15:48,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697991225] [2020-12-09 14:15:48,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:15:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:15:49,128 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 14:15:49,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697991225] [2020-12-09 14:15:49,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:15:49,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-09 14:15:49,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012681380] [2020-12-09 14:15:49,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 14:15:49,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:15:49,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 14:15:49,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2020-12-09 14:15:49,129 INFO L87 Difference]: Start difference. First operand 207 states and 249 transitions. Second operand 17 states. [2020-12-09 14:15:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:15:49,554 INFO L93 Difference]: Finished difference Result 261 states and 307 transitions. [2020-12-09 14:15:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 14:15:49,554 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2020-12-09 14:15:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:15:49,555 INFO L225 Difference]: With dead ends: 261 [2020-12-09 14:15:49,555 INFO L226 Difference]: Without dead ends: 261 [2020-12-09 14:15:49,556 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2020-12-09 14:15:49,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-12-09 14:15:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 207. [2020-12-09 14:15:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-12-09 14:15:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 248 transitions. [2020-12-09 14:15:49,559 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 248 transitions. Word has length 39 [2020-12-09 14:15:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:15:49,559 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 248 transitions. [2020-12-09 14:15:49,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 14:15:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 248 transitions. [2020-12-09 14:15:49,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-09 14:15:49,559 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:15:49,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:15:49,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2020-12-09 14:15:49,560 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:15:49,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:15:49,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1875726741, now seen corresponding path program 1 times [2020-12-09 14:15:49,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:15:49,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171272478] [2020-12-09 14:15:49,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:15:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:15:49,659 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 14:15:49,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171272478] [2020-12-09 14:15:49,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:15:49,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 14:15:49,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065879435] [2020-12-09 14:15:49,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 14:15:49,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:15:49,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 14:15:49,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-12-09 14:15:49,661 INFO L87 Difference]: Start difference. First operand 207 states and 248 transitions. Second operand 9 states. [2020-12-09 14:15:49,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:15:49,960 INFO L93 Difference]: Finished difference Result 218 states and 258 transitions. [2020-12-09 14:15:49,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 14:15:49,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2020-12-09 14:15:49,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:15:49,962 INFO L225 Difference]: With dead ends: 218 [2020-12-09 14:15:49,962 INFO L226 Difference]: Without dead ends: 218 [2020-12-09 14:15:49,962 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2020-12-09 14:15:49,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-12-09 14:15:49,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 206. [2020-12-09 14:15:49,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-12-09 14:15:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 247 transitions. [2020-12-09 14:15:49,965 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 247 transitions. Word has length 41 [2020-12-09 14:15:49,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:15:49,965 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 247 transitions. [2020-12-09 14:15:49,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 14:15:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 247 transitions. [2020-12-09 14:15:49,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-09 14:15:49,966 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:15:49,966 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, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:15:49,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2020-12-09 14:15:49,966 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:15:49,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:15:49,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2083072908, now seen corresponding path program 1 times [2020-12-09 14:15:49,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:15:49,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75575855] [2020-12-09 14:15:49,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:15:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:15:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-09 14:15:49,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75575855] [2020-12-09 14:15:49,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:15:49,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 14:15:49,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385277698] [2020-12-09 14:15:49,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 14:15:49,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:15:49,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 14:15:49,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 14:15:49,992 INFO L87 Difference]: Start difference. First operand 206 states and 247 transitions. Second operand 3 states. [2020-12-09 14:15:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:15:50,030 INFO L93 Difference]: Finished difference Result 212 states and 252 transitions. [2020-12-09 14:15:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 14:15:50,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-12-09 14:15:50,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:15:50,031 INFO L225 Difference]: With dead ends: 212 [2020-12-09 14:15:50,031 INFO L226 Difference]: Without dead ends: 212 [2020-12-09 14:15:50,031 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 14:15:50,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-12-09 14:15:50,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 186. [2020-12-09 14:15:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-12-09 14:15:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 223 transitions. [2020-12-09 14:15:50,034 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 223 transitions. Word has length 43 [2020-12-09 14:15:50,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:15:50,034 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 223 transitions. [2020-12-09 14:15:50,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 14:15:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 223 transitions. [2020-12-09 14:15:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-09 14:15:50,035 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:15:50,035 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, 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 14:15:50,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2020-12-09 14:15:50,035 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:15:50,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:15:50,035 INFO L82 PathProgramCache]: Analyzing trace with hash -19654730, now seen corresponding path program 1 times [2020-12-09 14:15:50,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:15:50,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186254487] [2020-12-09 14:15:50,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:15:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:15:50,167 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 14:15:50,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186254487] [2020-12-09 14:15:50,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:15:50,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 14:15:50,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746033076] [2020-12-09 14:15:50,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 14:15:50,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:15:50,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 14:15:50,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-09 14:15:50,169 INFO L87 Difference]: Start difference. First operand 186 states and 223 transitions. Second operand 7 states. [2020-12-09 14:15:50,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:15:50,398 INFO L93 Difference]: Finished difference Result 397 states and 463 transitions. [2020-12-09 14:15:50,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 14:15:50,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2020-12-09 14:15:50,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:15:50,401 INFO L225 Difference]: With dead ends: 397 [2020-12-09 14:15:50,401 INFO L226 Difference]: Without dead ends: 397 [2020-12-09 14:15:50,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-09 14:15:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2020-12-09 14:15:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 196. [2020-12-09 14:15:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-12-09 14:15:50,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 233 transitions. [2020-12-09 14:15:50,404 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 233 transitions. Word has length 46 [2020-12-09 14:15:50,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:15:50,405 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 233 transitions. [2020-12-09 14:15:50,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 14:15:50,405 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 233 transitions. [2020-12-09 14:15:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-09 14:15:50,405 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:15:50,405 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:15:50,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2020-12-09 14:15:50,406 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:15:50,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:15:50,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1266175234, now seen corresponding path program 1 times [2020-12-09 14:15:50,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:15:50,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322325312] [2020-12-09 14:15:50,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:15:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:15:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:15:50,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322325312] [2020-12-09 14:15:50,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733309447] [2020-12-09 14:15:50,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/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 14:15:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:15:50,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 27 conjunts are in the unsatisfiable core [2020-12-09 14:15:50,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:15:50,967 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2020-12-09 14:15:51,871 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-12-09 14:15:52,027 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-12-09 14:15:52,426 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-12-09 14:15:52,913 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-12-09 14:15:53,379 WARN L197 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2020-12-09 14:15:53,748 WARN L197 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 85 [2020-12-09 14:15:54,148 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 77 [2020-12-09 14:15:54,644 WARN L197 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2020-12-09 14:15:54,860 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-12-09 14:15:55,193 WARN L197 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 88 [2020-12-09 14:15:55,672 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-12-09 14:15:55,890 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-12-09 14:15:56,201 WARN L197 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 103 [2020-12-09 14:15:56,791 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2020-12-09 14:15:56,941 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-12-09 14:15:56,943 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-12-09 14:15:59,127 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-12-09 14:15:59,129 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-12-09 14:16:02,271 WARN L197 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 100 [2020-12-09 14:16:03,251 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-12-09 14:16:03,503 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 115 [2020-12-09 14:16:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:16:04,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 14:16:04,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:16:04,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [522884396] [2020-12-09 14:16:04,499 INFO L159 IcfgInterpreter]: Started Sifa with 45 locations of interest [2020-12-09 14:16:04,499 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 14:16:04,499 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 14:16:04,499 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 14:16:04,499 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 14:16:04,637 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:04,648 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:04,658 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:05,063 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:05,628 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:05,650 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:05,853 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2020-12-09 14:16:05,872 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:05,891 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:06,081 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-12-09 14:16:06,298 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-12-09 14:16:06,318 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:06,544 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-12-09 14:16:06,563 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:06,580 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:06,785 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-12-09 14:16:06,980 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-12-09 14:16:06,999 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:07,016 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:07,033 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:07,236 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-12-09 14:16:07,253 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:07,269 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:07,466 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-12-09 14:16:07,613 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:07,812 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-12-09 14:16:07,829 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:08,038 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2020-12-09 14:16:08,055 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:08,259 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-12-09 14:16:08,481 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-12-09 14:16:08,498 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 14:16:08,712 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-12-09 14:16:09,022 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-12-09 14:16:09,165 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2020-12-09 14:16:09,225 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,236 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,244 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,251 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,258 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,264 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,271 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,278 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,284 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,290 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,297 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,303 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,310 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,316 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,322 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,329 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,352 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,358 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,364 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,371 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,377 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,383 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,389 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,398 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,404 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,410 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,416 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,422 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,428 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,434 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,440 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:09,446 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:10,058 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:10,064 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:10,070 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:10,076 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:10,085 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:10,091 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:10,098 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:10,104 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:10,110 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:10,116 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:10,122 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:10,128 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:10,134 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:10,140 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:10,146 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:10,152 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 14:16:10,311 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 14:16:11,367 WARN L197 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 183 [2020-12-09 14:16:12,588 WARN L197 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 191 [2020-12-09 14:16:14,896 WARN L197 SmtUtils]: Spent 760.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 190 [2020-12-09 14:16:16,580 WARN L197 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 235 DAG size of output: 204 [2020-12-09 14:16:17,886 WARN L197 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 264 DAG size of output: 212 [2020-12-09 14:16:18,336 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-09 14:16:18,901 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2020-12-09 14:16:19,260 WARN L197 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2020-12-09 14:16:19,625 WARN L197 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2020-12-09 14:16:19,999 WARN L197 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 94 [2020-12-09 14:16:20,402 WARN L197 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 96 [2020-12-09 14:16:20,782 WARN L197 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 92 [2020-12-09 14:16:21,178 WARN L197 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 98 [2020-12-09 14:16:21,561 WARN L197 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2020-12-09 14:16:22,039 WARN L197 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 109 [2020-12-09 14:16:23,527 WARN L197 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 142 DAG size of output: 127 [2020-12-09 14:16:25,278 WARN L197 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 154 DAG size of output: 131 [2020-12-09 14:16:27,084 WARN L197 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 155 DAG size of output: 132 [2020-12-09 14:16:28,120 WARN L197 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 109 [2020-12-09 14:16:28,832 WARN L197 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 112 [2020-12-09 14:16:29,550 WARN L197 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 112 [2020-12-09 14:16:30,313 WARN L197 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 112 [2020-12-09 14:16:30,967 WARN L197 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 107 [2020-12-09 14:16:30,968 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 14:16:30,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 14:16:30,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 25 [2020-12-09 14:16:30,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181997118] [2020-12-09 14:16:30,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-09 14:16:30,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:16:30,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-09 14:16:30,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=2617, Unknown=0, NotChecked=0, Total=2970 [2020-12-09 14:16:30,969 INFO L87 Difference]: Start difference. First operand 196 states and 233 transitions. Second operand 27 states. [2020-12-09 14:16:32,541 WARN L197 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 200 DAG size of output: 141 [2020-12-09 14:16:38,675 WARN L197 SmtUtils]: Spent 3.83 s on a formula simplification. DAG size of input: 203 DAG size of output: 144 [2020-12-09 14:16:41,340 WARN L197 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 206 DAG size of output: 136 [2020-12-09 14:16:45,983 WARN L197 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 232 DAG size of output: 149 [2020-12-09 14:16:46,536 WARN L197 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 97 [2020-12-09 14:16:47,166 WARN L197 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 99 [2020-12-09 14:16:49,077 WARN L197 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 136 [2020-12-09 14:16:52,536 WARN L197 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 136 [2020-12-09 14:16:53,776 WARN L197 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 102 [2020-12-09 14:16:54,263 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 65 [2020-12-09 14:17:01,242 WARN L197 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 198 DAG size of output: 139 [2020-12-09 14:17:01,894 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 67 [2020-12-09 14:17:02,579 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 66 [2020-12-09 14:17:03,922 WARN L197 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 98 [2020-12-09 14:17:04,413 WARN L197 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 97 [2020-12-09 14:17:05,212 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 64 [2020-12-09 14:17:07,191 WARN L197 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 94 [2020-12-09 14:17:08,150 WARN L197 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 136 [2020-12-09 14:17:14,396 WARN L197 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 139 [2020-12-09 14:17:15,400 WARN L197 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 136 [2020-12-09 14:17:23,563 WARN L197 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 149 [2020-12-09 14:17:24,118 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2020-12-09 14:17:28,496 WARN L197 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 126 [2020-12-09 14:17:34,308 WARN L197 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 150 DAG size of output: 136 [2020-12-09 14:17:36,332 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2020-12-09 14:17:39,649 WARN L197 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 136 [2020-12-09 14:17:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:17:39,921 INFO L93 Difference]: Finished difference Result 324 states and 358 transitions. [2020-12-09 14:17:39,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-09 14:17:39,922 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2020-12-09 14:17:39,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:17:39,924 INFO L225 Difference]: With dead ends: 324 [2020-12-09 14:17:39,924 INFO L226 Difference]: Without dead ends: 324 [2020-12-09 14:17:39,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 65 SyntacticMatches, 33 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2647 ImplicationChecksByTransitivity, 65.0s TimeCoverageRelationStatistics Valid=852, Invalid=5624, Unknown=4, NotChecked=0, Total=6480 [2020-12-09 14:17:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-12-09 14:17:39,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 195. [2020-12-09 14:17:39,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-12-09 14:17:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 232 transitions. [2020-12-09 14:17:39,928 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 232 transitions. Word has length 47 [2020-12-09 14:17:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:17:39,929 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 232 transitions. [2020-12-09 14:17:39,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-09 14:17:39,929 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 232 transitions. [2020-12-09 14:17:39,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-09 14:17:39,929 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:17:39,929 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, 1, 1, 1, 1, 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 14:17:40,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable194 [2020-12-09 14:17:40,131 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:17:40,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:17:40,132 INFO L82 PathProgramCache]: Analyzing trace with hash -384525554, now seen corresponding path program 1 times [2020-12-09 14:17:40,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:17:40,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063762507] [2020-12-09 14:17:40,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:17:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:17:40,167 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 14:17:40,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063762507] [2020-12-09 14:17:40,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:17:40,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 14:17:40,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383179977] [2020-12-09 14:17:40,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 14:17:40,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:17:40,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 14:17:40,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 14:17:40,168 INFO L87 Difference]: Start difference. First operand 195 states and 232 transitions. Second operand 4 states. [2020-12-09 14:17:40,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:17:40,225 INFO L93 Difference]: Finished difference Result 201 states and 234 transitions. [2020-12-09 14:17:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 14:17:40,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-12-09 14:17:40,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:17:40,227 INFO L225 Difference]: With dead ends: 201 [2020-12-09 14:17:40,227 INFO L226 Difference]: Without dead ends: 201 [2020-12-09 14:17:40,227 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 14:17:40,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-12-09 14:17:40,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 195. [2020-12-09 14:17:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-12-09 14:17:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 229 transitions. [2020-12-09 14:17:40,230 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 229 transitions. Word has length 50 [2020-12-09 14:17:40,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:17:40,230 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 229 transitions. [2020-12-09 14:17:40,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 14:17:40,231 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 229 transitions. [2020-12-09 14:17:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-09 14:17:40,231 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:17:40,231 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, 1, 1, 1, 1, 1, 1, 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 14:17:40,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable234 [2020-12-09 14:17:40,231 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:17:40,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:17:40,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2147087682, now seen corresponding path program 1 times [2020-12-09 14:17:40,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:17:40,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687175395] [2020-12-09 14:17:40,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:17:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:17:40,278 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 14:17:40,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687175395] [2020-12-09 14:17:40,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:17:40,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 14:17:40,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623816643] [2020-12-09 14:17:40,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 14:17:40,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 14:17:40,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 14:17:40,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 14:17:40,279 INFO L87 Difference]: Start difference. First operand 195 states and 229 transitions. Second operand 5 states. [2020-12-09 14:17:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:17:40,485 INFO L93 Difference]: Finished difference Result 200 states and 233 transitions. [2020-12-09 14:17:40,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 14:17:40,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2020-12-09 14:17:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:17:40,487 INFO L225 Difference]: With dead ends: 200 [2020-12-09 14:17:40,487 INFO L226 Difference]: Without dead ends: 200 [2020-12-09 14:17:40,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 14:17:40,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-12-09 14:17:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 161. [2020-12-09 14:17:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-12-09 14:17:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2020-12-09 14:17:40,490 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 52 [2020-12-09 14:17:40,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:17:40,490 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2020-12-09 14:17:40,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 14:17:40,490 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2020-12-09 14:17:40,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-09 14:17:40,490 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:17:40,491 INFO L422 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1] [2020-12-09 14:17:40,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable235 [2020-12-09 14:17:40,491 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:17:40,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:17:40,491 INFO L82 PathProgramCache]: Analyzing trace with hash 678870213, now seen corresponding path program 1 times [2020-12-09 14:17:40,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 14:17:40,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819776757] [2020-12-09 14:17:40,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 14:17:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 14:17:40,519 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 14:17:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 14:17:40,548 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 14:17:40,572 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 14:17:40,573 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 14:17:40,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2020-12-09 14:17:40,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:17:40 BoogieIcfgContainer [2020-12-09 14:17:40,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 14:17:40,636 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 14:17:40,636 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 14:17:40,637 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 14:17:40,637 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:14:10" (3/4) ... [2020-12-09 14:17:40,639 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-09 14:17:40,639 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 14:17:40,640 INFO L168 Benchmark]: Toolchain (without parser) took 211414.30 ms. Allocated memory was 90.2 MB in the beginning and 192.9 MB in the end (delta: 102.8 MB). Free memory was 55.1 MB in the beginning and 68.4 MB in the end (delta: -13.2 MB). Peak memory consumption was 88.6 MB. Max. memory is 16.1 GB. [2020-12-09 14:17:40,640 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 90.2 MB. Free memory is still 72.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 14:17:40,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.43 ms. Allocated memory is still 90.2 MB. Free memory was 54.9 MB in the beginning and 48.0 MB in the end (delta: 6.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 14:17:40,640 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.31 ms. Allocated memory is still 90.2 MB. Free memory was 48.0 MB in the beginning and 45.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 14:17:40,640 INFO L168 Benchmark]: Boogie Preprocessor took 28.81 ms. Allocated memory is still 90.2 MB. Free memory was 45.3 MB in the beginning and 43.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 14:17:40,640 INFO L168 Benchmark]: RCFGBuilder took 554.75 ms. Allocated memory was 90.2 MB in the beginning and 109.1 MB in the end (delta: 18.9 MB). Free memory was 43.2 MB in the beginning and 85.5 MB in the end (delta: -42.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 16.1 GB. [2020-12-09 14:17:40,641 INFO L168 Benchmark]: TraceAbstraction took 210427.93 ms. Allocated memory was 109.1 MB in the beginning and 192.9 MB in the end (delta: 83.9 MB). Free memory was 84.8 MB in the beginning and 69.4 MB in the end (delta: 15.3 MB). Peak memory consumption was 99.6 MB. Max. memory is 16.1 GB. [2020-12-09 14:17:40,641 INFO L168 Benchmark]: Witness Printer took 2.86 ms. Allocated memory is still 192.9 MB. Free memory was 69.4 MB in the beginning and 68.4 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 14:17:40,642 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 90.2 MB. Free memory is still 72.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 354.43 ms. Allocated memory is still 90.2 MB. Free memory was 54.9 MB in the beginning and 48.0 MB in the end (delta: 6.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.31 ms. Allocated memory is still 90.2 MB. Free memory was 48.0 MB in the beginning and 45.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.81 ms. Allocated memory is still 90.2 MB. Free memory was 45.3 MB in the beginning and 43.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 554.75 ms. Allocated memory was 90.2 MB in the beginning and 109.1 MB in the end (delta: 18.9 MB). Free memory was 43.2 MB in the beginning and 85.5 MB in the end (delta: -42.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 210427.93 ms. Allocated memory was 109.1 MB in the beginning and 192.9 MB in the end (delta: 83.9 MB). Free memory was 84.8 MB in the beginning and 69.4 MB in the end (delta: 15.3 MB). Peak memory consumption was 99.6 MB. Max. memory is 16.1 GB. * Witness Printer took 2.86 ms. Allocated memory is still 192.9 MB. Free memory was 69.4 MB in the beginning and 68.4 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 721]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L692] int i = 0; VAL [commands={10:0}, global={0:0}, state=0] [L692] COND TRUE i < 2 VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR commands[i].name VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [commands={10:0}, global={0:0}, state=0] [L692] COND TRUE i < 2 VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR commands[i].name VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [commands={10:0}, global={0:0}, state=0] [L692] COND FALSE !(i < 2) VAL [commands={10:0}, global={0:0}, state=0] [L692] int i = 0; VAL [commands={10:0}, global={0:0}, state=0] [L692] COND TRUE i < 2 VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR commands[i].name VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [commands={10:0}, global={0:0}, state=0] [L692] COND TRUE i < 2 VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR commands[i].name VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [commands={10:0}, global={0:0}, state=0] [L692] COND FALSE !(i < 2) VAL [commands={10:0}, global={0:0}, state=0] [L692] int i = 0; VAL [commands={10:0}, global={0:0}, state=0] [L692] COND TRUE i < 2 VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR commands[i].name VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [commands={10:0}, global={0:0}, state=0] [L694] COND TRUE state >= commands[i].state_needed [L695] commands[i].function [L702] char *x = (char *)malloc(sizeof(char)); VAL [commands={10:0}, global={0:0}, state=0] [L703] COND FALSE !(!x) VAL [commands={10:0}, global={0:0}, state=0] [L706] COND FALSE !(\read(*global)) VAL [commands={10:0}, global={0:0}, state=0] [L709] global = x [L710] state = STATE_2 VAL [commands={10:0}, global={-3:0}, state=1] [L725] return 0; VAL [commands={10:0}, global={-3:0}, state=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 58 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 210.3s, OverallIterations: 34, TraceHistogramMax: 2, AutomataDifference: 81.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3246 SDtfs, 14144 SDslu, 5591 SDs, 0 SdLazy, 7225 SolverSat, 1779 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 36.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 855 GetRequests, 329 SyntacticMatches, 135 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6244 ImplicationChecksByTransitivity, 145.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 2335 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 45.8s InterpolantComputationTime, 1115 NumberOfCodeBlocks, 1115 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1214 ConstructedInterpolants, 152 QuantifiedInterpolants, 1105813 SizeOfPredicates, 67 NumberOfNonLiveVariables, 1573 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 49 InterpolantComputations, 25 PerfectInterpolantSequences, 30/98 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: OVERALL_TIME[ms]: 1106, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 22, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 38, TOOLS_POST_TIME[ms]: 658, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 38, TOOLS_QUANTIFIERELIM_TIME[ms]: 644, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 342, FLUID_QUERY_TIME[ms]: 4, FLUID_QUERIES: 67, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME[ms]: 103, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME[ms]: 181, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME[ms]: 10, DOMAIN_ISBOTTOM_APPLICATIONS: 22, DOMAIN_ISBOTTOM_TIME[ms]: 108, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 243, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 243, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 2, PATH_EXPR_TIME[ms]: 3, REGEX_TO_DAG_TIME[ms]: 3, DAG_COMPRESSION_TIME[ms]: 11, DAG_COMPRESSION_PROCESSED_NODES: 558, DAG_COMPRESSION_RETAINED_NODES: 92, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-09 14:17:42,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 14:17:42,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 14:17:42,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 14:17:42,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 14:17:42,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 14:17:42,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 14:17:42,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 14:17:42,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 14:17:42,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 14:17:42,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 14:17:42,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 14:17:42,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 14:17:42,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 14:17:42,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 14:17:42,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 14:17:42,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 14:17:42,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 14:17:42,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 14:17:42,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 14:17:42,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 14:17:42,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 14:17:42,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 14:17:42,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 14:17:42,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 14:17:42,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 14:17:42,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 14:17:42,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 14:17:42,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 14:17:42,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 14:17:42,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 14:17:42,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 14:17:42,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 14:17:42,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 14:17:42,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 14:17:42,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 14:17:42,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 14:17:42,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 14:17:42,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 14:17:42,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 14:17:42,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 14:17:42,386 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Bitvector.epf [2020-12-09 14:17:42,413 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 14:17:42,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 14:17:42,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 14:17:42,415 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 14:17:42,415 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 14:17:42,415 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 14:17:42,415 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 14:17:42,415 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 14:17:42,416 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 14:17:42,416 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 14:17:42,416 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 14:17:42,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 14:17:42,417 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 14:17:42,417 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 14:17:42,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 14:17:42,417 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 14:17:42,418 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 14:17:42,418 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 14:17:42,418 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 14:17:42,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 14:17:42,418 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 14:17:42,419 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 14:17:42,419 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 14:17:42,419 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 14:17:42,419 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 14:17:42,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 14:17:42,420 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 14:17:42,420 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 14:17:42,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 14:17:42,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 14:17:42,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 14:17:42,421 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 14:17:42,421 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 14:17:42,421 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 14:17:42,421 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 14:17:42,421 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_8703cea7-aa9b-4409-a950-1a765ef3873f/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_8703cea7-aa9b-4409-a950-1a765ef3873f/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-memcleanup) ) 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 -> 129dca108ba5ab1702fbcd782a34bbf933adb446 [2020-12-09 14:17:42,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 14:17:42,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 14:17:42,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 14:17:42,670 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 14:17:42,670 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 14:17:42,671 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/../../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2020-12-09 14:17:42,714 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/data/7cfec9b54/fafebd8089434abfa811664caa2d8508/FLAG91e10ec03 [2020-12-09 14:17:43,154 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 14:17:43,155 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2020-12-09 14:17:43,167 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/data/7cfec9b54/fafebd8089434abfa811664caa2d8508/FLAG91e10ec03 [2020-12-09 14:17:43,180 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/data/7cfec9b54/fafebd8089434abfa811664caa2d8508 [2020-12-09 14:17:43,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 14:17:43,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 14:17:43,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 14:17:43,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 14:17:43,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 14:17:43,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:17:43" (1/1) ... [2020-12-09 14:17:43,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e4f7d87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:17:43, skipping insertion in model container [2020-12-09 14:17:43,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:17:43" (1/1) ... [2020-12-09 14:17:43,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 14:17:43,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 14:17:43,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 14:17:43,488 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 14:17:43,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 14:17:43,578 INFO L208 MainTranslator]: Completed translation [2020-12-09 14:17:43,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:17:43 WrapperNode [2020-12-09 14:17:43,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 14:17:43,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 14:17:43,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 14:17:43,579 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 14:17:43,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:17:43" (1/1) ... [2020-12-09 14:17:43,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:17:43" (1/1) ... [2020-12-09 14:17:43,621 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 14:17:43,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 14:17:43,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 14:17:43,622 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 14:17:43,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:17:43" (1/1) ... [2020-12-09 14:17:43,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:17:43" (1/1) ... [2020-12-09 14:17:43,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:17:43" (1/1) ... [2020-12-09 14:17:43,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:17:43" (1/1) ... [2020-12-09 14:17:43,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:17:43" (1/1) ... [2020-12-09 14:17:43,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:17:43" (1/1) ... [2020-12-09 14:17:43,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:17:43" (1/1) ... [2020-12-09 14:17:43,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 14:17:43,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 14:17:43,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 14:17:43,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 14:17:43,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:17:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/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 14:17:43,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2020-12-09 14:17:43,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 14:17:43,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 14:17:43,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 14:17:43,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 14:17:43,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-09 14:17:43,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 14:17:43,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 14:17:43,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 14:17:44,280 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 14:17:44,280 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2020-12-09 14:17:44,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:17:44 BoogieIcfgContainer [2020-12-09 14:17:44,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 14:17:44,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 14:17:44,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 14:17:44,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 14:17:44,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:17:43" (1/3) ... [2020-12-09 14:17:44,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235abec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:17:44, skipping insertion in model container [2020-12-09 14:17:44,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:17:43" (2/3) ... [2020-12-09 14:17:44,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235abec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:17:44, skipping insertion in model container [2020-12-09 14:17:44,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:17:44" (3/3) ... [2020-12-09 14:17:44,288 INFO L111 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2020-12-09 14:17:44,297 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 14:17:44,300 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 58 error locations. [2020-12-09 14:17:44,307 INFO L253 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2020-12-09 14:17:44,320 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 14:17:44,320 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 14:17:44,320 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 14:17:44,320 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 14:17:44,320 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 14:17:44,320 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 14:17:44,320 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 14:17:44,321 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 14:17:44,334 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2020-12-09 14:17:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 14:17:44,337 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:17:44,338 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 14:17:44,338 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:17:44,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:17:44,342 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-12-09 14:17:44,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 14:17:44,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879733974] [2020-12-09 14:17:44,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/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 14:17:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:17:44,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 14:17:44,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:17:44,659 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2020-12-09 14:17:44,660 INFO L348 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2020-12-09 14:17:44,661 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2020-12-09 14:17:44,672 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:17:44,745 INFO L625 ElimStorePlain]: treesize reduction 12, result has 83.6 percent of original size [2020-12-09 14:17:44,763 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 14:17:44,769 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 14:17:44,773 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 14:17:44,777 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 14:17:44,779 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 14:17:44,783 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 14:17:44,789 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-12-09 14:17:44,789 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:63 [2020-12-09 14:17:44,797 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 14:17:44,800 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 14:17:44,802 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 14:17:44,805 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 14:17:44,807 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 14:17:44,810 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 14:17:44,840 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 14:17:44,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 14:17:44,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879733974] [2020-12-09 14:17:44,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:17:44,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 14:17:44,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254732233] [2020-12-09 14:17:44,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 14:17:44,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 14:17:44,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 14:17:44,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 14:17:44,857 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 3 states. [2020-12-09 14:17:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:17:45,118 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2020-12-09 14:17:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 14:17:45,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-09 14:17:45,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:17:45,126 INFO L225 Difference]: With dead ends: 159 [2020-12-09 14:17:45,126 INFO L226 Difference]: Without dead ends: 155 [2020-12-09 14:17:45,127 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:17:45,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-12-09 14:17:45,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 148. [2020-12-09 14:17:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-12-09 14:17:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 172 transitions. [2020-12-09 14:17:45,158 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 172 transitions. Word has length 4 [2020-12-09 14:17:45,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:17:45,158 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 172 transitions. [2020-12-09 14:17:45,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 14:17:45,158 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 172 transitions. [2020-12-09 14:17:45,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 14:17:45,159 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:17:45,159 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 14:17:45,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 14:17:45,362 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:17:45,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:17:45,364 INFO L82 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2020-12-09 14:17:45,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 14:17:45,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433552066] [2020-12-09 14:17:45,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/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 14:17:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:17:45,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 14:17:45,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:17:45,758 WARN L197 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 14:17:45,758 INFO L348 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2020-12-09 14:17:45,759 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2020-12-09 14:17:45,765 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:17:45,862 INFO L625 ElimStorePlain]: treesize reduction 50, result has 53.7 percent of original size [2020-12-09 14:17:45,867 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 14:17:45,867 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:11 [2020-12-09 14:17:45,887 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 14:17:45,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 14:17:45,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433552066] [2020-12-09 14:17:45,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:17:45,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 14:17:45,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953228747] [2020-12-09 14:17:45,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 14:17:45,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 14:17:45,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 14:17:45,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 14:17:45,890 INFO L87 Difference]: Start difference. First operand 148 states and 172 transitions. Second operand 4 states. [2020-12-09 14:17:46,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:17:46,218 INFO L93 Difference]: Finished difference Result 334 states and 378 transitions. [2020-12-09 14:17:46,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 14:17:46,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-12-09 14:17:46,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:17:46,221 INFO L225 Difference]: With dead ends: 334 [2020-12-09 14:17:46,222 INFO L226 Difference]: Without dead ends: 334 [2020-12-09 14:17:46,222 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 14:17:46,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-12-09 14:17:46,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 210. [2020-12-09 14:17:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-12-09 14:17:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 272 transitions. [2020-12-09 14:17:46,236 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 272 transitions. Word has length 4 [2020-12-09 14:17:46,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:17:46,236 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 272 transitions. [2020-12-09 14:17:46,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 14:17:46,236 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 272 transitions. [2020-12-09 14:17:46,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 14:17:46,236 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:17:46,236 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 14:17:46,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 14:17:46,439 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:17:46,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:17:46,441 INFO L82 PathProgramCache]: Analyzing trace with hash 28698698, now seen corresponding path program 1 times [2020-12-09 14:17:46,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 14:17:46,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530486112] [2020-12-09 14:17:46,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/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 14:17:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:17:46,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-09 14:17:46,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:17:46,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 14:17:46,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 14:17:46,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 14:17:46,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 14:17:46,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 14:17:46,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 14:17:46,808 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 47 [2020-12-09 14:17:46,808 INFO L348 Elim1Store]: treesize reduction 322, result has 20.7 percent of original size [2020-12-09 14:17:46,808 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 190 treesize of output 242 [2020-12-09 14:17:46,816 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-12-09 14:17:46,816 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:46,817 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-12-09 14:17:46,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:46,819 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 1] term [2020-12-09 14:17:46,819 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:46,821 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 2, 3, 1] term [2020-12-09 14:17:46,821 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:46,824 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:17:46,933 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2020-12-09 14:17:46,934 INFO L625 ElimStorePlain]: treesize reduction 12, result has 91.7 percent of original size [2020-12-09 14:17:46,999 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:17:46,999 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 65 [2020-12-09 14:17:47,002 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 14:17:47,126 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2020-12-09 14:17:47,127 INFO L625 ElimStorePlain]: treesize reduction 24, result has 83.3 percent of original size [2020-12-09 14:17:47,136 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 14:17:47,139 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 14:17:47,142 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 14:17:47,144 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 14:17:47,147 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 13 disjuncts [2020-12-09 14:17:47,183 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-09 14:17:47,183 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:122, output treesize:122 [2020-12-09 14:17:47,187 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 14:17:47,189 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 14:17:47,190 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 14:17:47,192 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 14:17:47,193 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 13 disjuncts [2020-12-09 14:17:47,257 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 14:17:47,259 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 14:17:47,262 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 14:17:47,264 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 14:17:47,266 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 13 disjuncts [2020-12-09 14:17:47,523 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 51 [2020-12-09 14:17:47,591 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 51 treesize of output 27 [2020-12-09 14:17:47,592 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:17:47,638 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:17:47,644 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-12-09 14:17:47,645 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:98, output treesize:69 [2020-12-09 14:17:47,689 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 14:17:47,689 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 14:17:47,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530486112] [2020-12-09 14:17:47,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:17:47,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 14:17:47,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183092195] [2020-12-09 14:17:47,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 14:17:47,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 14:17:47,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 14:17:47,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 14:17:47,690 INFO L87 Difference]: Start difference. First operand 210 states and 272 transitions. Second operand 5 states. [2020-12-09 14:17:49,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:17:49,210 INFO L93 Difference]: Finished difference Result 436 states and 552 transitions. [2020-12-09 14:17:49,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 14:17:49,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2020-12-09 14:17:49,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:17:49,213 INFO L225 Difference]: With dead ends: 436 [2020-12-09 14:17:49,213 INFO L226 Difference]: Without dead ends: 436 [2020-12-09 14:17:49,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 14:17:49,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2020-12-09 14:17:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 262. [2020-12-09 14:17:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2020-12-09 14:17:49,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 356 transitions. [2020-12-09 14:17:49,232 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 356 transitions. Word has length 5 [2020-12-09 14:17:49,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:17:49,232 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 356 transitions. [2020-12-09 14:17:49,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 14:17:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 356 transitions. [2020-12-09 14:17:49,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 14:17:49,233 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:17:49,233 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 14:17:49,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 14:17:49,435 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:17:49,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:17:49,437 INFO L82 PathProgramCache]: Analyzing trace with hash 889659685, now seen corresponding path program 1 times [2020-12-09 14:17:49,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 14:17:49,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42519205] [2020-12-09 14:17:49,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/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 14:17:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:17:49,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 14:17:49,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:17:49,673 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_45|], 12=[|v_#valid_77|]} [2020-12-09 14:17:49,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 14:17:49,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 14:17:49,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 14:17:49,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 14:17:49,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 14:17:49,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 14:17:49,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 14:17:49,931 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2020-12-09 14:17:49,931 INFO L348 Elim1Store]: treesize reduction 48, result has 70.0 percent of original size [2020-12-09 14:17:49,932 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 117 [2020-12-09 14:17:49,935 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:17:50,154 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2020-12-09 14:17:50,155 INFO L625 ElimStorePlain]: treesize reduction 60, result has 71.6 percent of original size [2020-12-09 14:17:50,192 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:17:50,193 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 182 [2020-12-09 14:17:50,195 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 1] term [2020-12-09 14:17:50,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:50,196 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-12-09 14:17:50,196 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:50,197 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 5, 2, 1] term [2020-12-09 14:17:50,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:50,199 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 5, 3, 5, 2, 4, 1] term [2020-12-09 14:17:50,200 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:50,200 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-12-09 14:17:50,201 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:50,204 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 14:17:50,448 WARN L197 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2020-12-09 14:17:50,448 INFO L625 ElimStorePlain]: treesize reduction 287, result has 31.7 percent of original size [2020-12-09 14:17:50,462 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 14:17:50,469 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:17:50,469 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2020-12-09 14:17:50,470 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2020-12-09 14:17:50,637 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2020-12-09 14:17:50,638 INFO L625 ElimStorePlain]: treesize reduction 6, result has 95.0 percent of original size [2020-12-09 14:17:50,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,643 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 14:17:50,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:50,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,651 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:50,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 14:17:50,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:50,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 14:17:50,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:50,669 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-09 14:17:50,670 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:116, output treesize:117 [2020-12-09 14:17:50,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,673 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,673 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 14:17:50,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:50,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:50,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 14:17:50,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:50,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 14:17:50,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:50,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 14:17:50,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:50,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:50,795 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 14:17:50,802 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,802 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:50,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:50,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 14:17:51,003 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2020-12-09 14:17:51,044 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:51,053 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:51,059 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 1] term [2020-12-09 14:17:51,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:51,087 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 14:17:51,088 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:17:51,246 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2020-12-09 14:17:51,247 INFO L625 ElimStorePlain]: treesize reduction 32, result has 79.1 percent of original size [2020-12-09 14:17:51,257 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 14:17:51,258 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 14:17:51,332 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:17:51,338 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 33 treesize of output 17 [2020-12-09 14:17:51,340 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-09 14:17:51,400 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:17:51,414 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 14:17:51,415 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-09 14:17:51,476 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:17:51,481 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2020-12-09 14:17:51,481 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:164, output treesize:79 [2020-12-09 14:17:51,576 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 14:17:51,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 14:17:51,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42519205] [2020-12-09 14:17:51,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:17:51,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 14:17:51,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307984036] [2020-12-09 14:17:51,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 14:17:51,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 14:17:51,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 14:17:51,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 14:17:51,578 INFO L87 Difference]: Start difference. First operand 262 states and 356 transitions. Second operand 5 states. [2020-12-09 14:17:51,872 WARN L197 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2020-12-09 14:17:52,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:17:52,826 INFO L93 Difference]: Finished difference Result 388 states and 466 transitions. [2020-12-09 14:17:52,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 14:17:52,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-12-09 14:17:52,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:17:52,829 INFO L225 Difference]: With dead ends: 388 [2020-12-09 14:17:52,829 INFO L226 Difference]: Without dead ends: 388 [2020-12-09 14:17:52,829 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 14:17:52,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2020-12-09 14:17:52,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 262. [2020-12-09 14:17:52,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2020-12-09 14:17:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 352 transitions. [2020-12-09 14:17:52,837 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 352 transitions. Word has length 6 [2020-12-09 14:17:52,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:17:52,837 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 352 transitions. [2020-12-09 14:17:52,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 14:17:52,837 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 352 transitions. [2020-12-09 14:17:52,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 14:17:52,838 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:17:52,838 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:17:53,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 14:17:53,040 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:17:53,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:17:53,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1809646508, now seen corresponding path program 1 times [2020-12-09 14:17:53,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 14:17:53,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133705771] [2020-12-09 14:17:53,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/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 14:17:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:17:53,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 14:17:53,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:17:53,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 14:17:53,304 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 33 [2020-12-09 14:17:53,304 INFO L348 Elim1Store]: treesize reduction 336, result has 15.2 percent of original size [2020-12-09 14:17:53,305 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 64 treesize of output 102 [2020-12-09 14:17:53,307 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:17:53,406 INFO L625 ElimStorePlain]: treesize reduction 34, result has 72.4 percent of original size [2020-12-09 14:17:53,415 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:17:53,416 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2020-12-09 14:17:53,416 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-09 14:17:53,493 INFO L625 ElimStorePlain]: treesize reduction 6, result has 92.8 percent of original size [2020-12-09 14:17:53,495 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 14:17:53,496 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 14:17:53,497 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 14:17:53,497 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 14:17:53,498 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 14:17:53,499 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 10 disjuncts [2020-12-09 14:17:53,504 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-12-09 14:17:53,505 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:58, output treesize:79 [2020-12-09 14:17:53,506 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 14:17:53,507 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 14:17:53,508 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 14:17:53,508 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 14:17:53,509 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 14:17:53,510 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 10 disjuncts [2020-12-09 14:17:53,537 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 14:17:53,538 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 14:17:53,538 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 14:17:53,539 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 14:17:53,540 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 14:17:53,541 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 10 disjuncts [2020-12-09 14:17:53,704 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 14:17:53,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 14:17:53,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133705771] [2020-12-09 14:17:53,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:17:53,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 14:17:53,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041649008] [2020-12-09 14:17:53,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 14:17:53,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 14:17:53,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 14:17:53,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 14:17:53,705 INFO L87 Difference]: Start difference. First operand 262 states and 352 transitions. Second operand 4 states. [2020-12-09 14:17:54,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:17:54,212 INFO L93 Difference]: Finished difference Result 338 states and 430 transitions. [2020-12-09 14:17:54,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 14:17:54,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-12-09 14:17:54,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:17:54,214 INFO L225 Difference]: With dead ends: 338 [2020-12-09 14:17:54,214 INFO L226 Difference]: Without dead ends: 338 [2020-12-09 14:17:54,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 14:17:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-12-09 14:17:54,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 281. [2020-12-09 14:17:54,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2020-12-09 14:17:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 384 transitions. [2020-12-09 14:17:54,222 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 384 transitions. Word has length 7 [2020-12-09 14:17:54,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:17:54,222 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 384 transitions. [2020-12-09 14:17:54,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 14:17:54,223 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 384 transitions. [2020-12-09 14:17:54,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 14:17:54,223 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:17:54,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:17:54,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 14:17:54,425 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:17:54,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:17:54,426 INFO L82 PathProgramCache]: Analyzing trace with hash 264466951, now seen corresponding path program 1 times [2020-12-09 14:17:54,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 14:17:54,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019623164] [2020-12-09 14:17:54,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/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 14:17:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:17:54,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 14:17:54,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:17:54,526 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_46|], 4=[|v_#valid_79|]} [2020-12-09 14:17:54,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 14:17:54,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 14:17:54,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 14:17:54,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 14:17:54,756 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2020-12-09 14:17:54,757 INFO L348 Elim1Store]: treesize reduction 108, result has 47.1 percent of original size [2020-12-09 14:17:54,757 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2020-12-09 14:17:54,759 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:17:54,889 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-12-09 14:17:54,889 INFO L625 ElimStorePlain]: treesize reduction 50, result has 65.0 percent of original size [2020-12-09 14:17:54,904 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 37 [2020-12-09 14:17:54,906 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-09 14:17:55,047 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2020-12-09 14:17:55,048 INFO L625 ElimStorePlain]: treesize reduction 22, result has 80.0 percent of original size [2020-12-09 14:17:55,055 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 14:17:55,059 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:17:55,060 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2020-12-09 14:17:55,060 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2020-12-09 14:17:55,216 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2020-12-09 14:17:55,216 INFO L625 ElimStorePlain]: treesize reduction 6, result has 92.5 percent of original size [2020-12-09 14:17:55,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,221 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,221 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,222 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,222 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-09 14:17:55,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,225 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,225 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 14:17:55,227 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,227 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,228 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,228 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,229 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,229 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,230 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:55,230 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,231 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,232 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,232 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,233 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:55,233 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,234 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,235 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:55,239 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,245 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,245 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,247 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,249 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,250 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,250 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,256 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,257 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,257 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,260 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,262 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,262 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,267 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 14:17:55,270 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,270 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,270 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,273 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 14:17:55,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:55,277 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,277 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,278 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,280 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,280 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:55,282 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,284 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,285 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 14:17:55,286 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,287 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,287 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:55,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 14:17:55,294 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-12-09 14:17:55,294 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:60, output treesize:74 [2020-12-09 14:17:55,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,299 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,299 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-09 14:17:55,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 14:17:55,306 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,307 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,307 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,309 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,309 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:55,310 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,310 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:55,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,313 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,313 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:55,316 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,321 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,321 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,323 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,323 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,325 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,326 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,326 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,326 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,327 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,327 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,328 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,328 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,330 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,330 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,331 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,332 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,332 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,332 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,333 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,333 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,336 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,336 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,337 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,337 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 14:17:55,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,339 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,340 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 14:17:55,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:55,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:55,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,351 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,351 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 14:17:55,353 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:55,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,356 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,357 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 14:17:55,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,390 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,390 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,391 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-09 14:17:55,391 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,392 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,392 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,392 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,393 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,393 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 14:17:55,395 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,397 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,397 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,397 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:55,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:55,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,401 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,405 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,405 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,405 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 14:17:55,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 14:17:55,414 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,415 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:55,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:55,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 14:17:55,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 14:17:55,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 14:17:55,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 14:17:55,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 14:17:55,448 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,448 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:55,451 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:17:55,451 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:55,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:17:55,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 14:17:55,455 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,456 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 14:17:55,456 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 14:17:55,658 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 35 [2020-12-09 14:17:55,754 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 14:17:55,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 14:17:55,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019623164] [2020-12-09 14:17:55,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 14:17:55,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 14:17:55,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643350360] [2020-12-09 14:17:55,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 14:17:55,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 14:17:55,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 14:17:55,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 14:17:55,755 INFO L87 Difference]: Start difference. First operand 281 states and 384 transitions. Second operand 4 states. [2020-12-09 14:17:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:17:56,364 INFO L93 Difference]: Finished difference Result 342 states and 441 transitions. [2020-12-09 14:17:56,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 14:17:56,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-12-09 14:17:56,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:17:56,366 INFO L225 Difference]: With dead ends: 342 [2020-12-09 14:17:56,366 INFO L226 Difference]: Without dead ends: 342 [2020-12-09 14:17:56,367 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 14:17:56,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2020-12-09 14:17:56,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 280. [2020-12-09 14:17:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-12-09 14:17:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 382 transitions. [2020-12-09 14:17:56,371 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 382 transitions. Word has length 8 [2020-12-09 14:17:56,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:17:56,372 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 382 transitions. [2020-12-09 14:17:56,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 14:17:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 382 transitions. [2020-12-09 14:17:56,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 14:17:56,372 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:17:56,372 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:17:56,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 14:17:56,574 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:17:56,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:17:56,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1118688979, now seen corresponding path program 1 times [2020-12-09 14:17:56,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 14:17:56,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039322485] [2020-12-09 14:17:56,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-12-09 14:17:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:17:56,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 14:17:56,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:17:56,938 WARN L197 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 14:17:56,939 INFO L348 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2020-12-09 14:17:56,939 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2020-12-09 14:17:56,941 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:17:57,034 INFO L625 ElimStorePlain]: treesize reduction 50, result has 53.7 percent of original size [2020-12-09 14:17:57,037 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 14:17:57,037 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:11 [2020-12-09 14:17:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:17:57,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 14:17:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:17:57,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039322485] [2020-12-09 14:17:57,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [159368395] [2020-12-09 14:17:57,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt [2020-12-09 14:17:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:17:57,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 14:17:57,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:17:57,634 WARN L197 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 14:17:57,634 INFO L348 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2020-12-09 14:17:57,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2020-12-09 14:17:57,637 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:17:57,720 INFO L625 ElimStorePlain]: treesize reduction 50, result has 53.7 percent of original size [2020-12-09 14:17:57,723 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 14:17:57,724 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:11 [2020-12-09 14:17:57,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:17:57,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 14:17:57,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:17:57,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170450608] [2020-12-09 14:17:57,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/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 14:17:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:17:57,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 14:17:57,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:17:58,088 WARN L197 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 14:17:58,088 INFO L348 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2020-12-09 14:17:58,088 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2020-12-09 14:17:58,090 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:17:58,170 INFO L625 ElimStorePlain]: treesize reduction 50, result has 53.7 percent of original size [2020-12-09 14:17:58,172 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 14:17:58,172 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:11 [2020-12-09 14:17:58,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:17:58,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 14:17:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:17:58,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 14:17:58,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3, 3, 3, 4] total 8 [2020-12-09 14:17:58,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593261210] [2020-12-09 14:17:58,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 14:17:58,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 14:17:58,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 14:17:58,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-12-09 14:17:58,431 INFO L87 Difference]: Start difference. First operand 280 states and 382 transitions. Second operand 10 states. [2020-12-09 14:17:58,667 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2020-12-09 14:17:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 14:17:59,952 INFO L93 Difference]: Finished difference Result 757 states and 919 transitions. [2020-12-09 14:17:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 14:17:59,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2020-12-09 14:17:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 14:17:59,956 INFO L225 Difference]: With dead ends: 757 [2020-12-09 14:17:59,956 INFO L226 Difference]: Without dead ends: 757 [2020-12-09 14:17:59,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2020-12-09 14:17:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2020-12-09 14:17:59,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 395. [2020-12-09 14:17:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-12-09 14:17:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 564 transitions. [2020-12-09 14:17:59,965 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 564 transitions. Word has length 12 [2020-12-09 14:17:59,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 14:17:59,965 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 564 transitions. [2020-12-09 14:17:59,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 14:17:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 564 transitions. [2020-12-09 14:17:59,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 14:17:59,965 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 14:17:59,965 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 14:18:00,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt,8 mathsat -unsat_core_generation=3,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 14:18:00,569 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 14:18:00,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 14:18:00,571 INFO L82 PathProgramCache]: Analyzing trace with hash -319620029, now seen corresponding path program 1 times [2020-12-09 14:18:00,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 14:18:00,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212387895] [2020-12-09 14:18:00,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-12-09 14:18:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:18:00,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 14:18:00,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:18:00,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 14:18:00,902 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 44 [2020-12-09 14:18:00,903 INFO L348 Elim1Store]: treesize reduction 429, result has 15.7 percent of original size [2020-12-09 14:18:00,903 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 133 treesize of output 183 [2020-12-09 14:18:00,905 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2020-12-09 14:18:00,905 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:18:00,906 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 1] term [2020-12-09 14:18:00,906 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:18:00,908 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:18:01,061 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2020-12-09 14:18:01,061 INFO L625 ElimStorePlain]: treesize reduction 106, result has 55.8 percent of original size [2020-12-09 14:18:01,079 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:18:01,079 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2020-12-09 14:18:01,080 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-09 14:18:01,206 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2020-12-09 14:18:01,207 INFO L625 ElimStorePlain]: treesize reduction 6, result has 95.3 percent of original size [2020-12-09 14:18:01,209 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 14:18:01,210 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 14:18:01,211 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 14:18:01,212 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 14:18:01,212 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 12 disjuncts [2020-12-09 14:18:01,224 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-09 14:18:01,224 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:102, output treesize:124 [2020-12-09 14:18:01,226 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 14:18:01,227 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 14:18:01,227 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 14:18:01,228 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 14:18:01,229 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 12 disjuncts [2020-12-09 14:18:01,268 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 14:18:01,269 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 14:18:01,270 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 14:18:01,271 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 14:18:01,271 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 12 disjuncts [2020-12-09 14:18:06,133 WARN L197 SmtUtils]: Spent 4.78 s on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2020-12-09 14:18:08,715 WARN L197 SmtUtils]: Spent 1.95 s on a formula simplification that was a NOOP. DAG size: 113 [2020-12-09 14:18:08,741 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 7, 1] term [2020-12-09 14:18:08,742 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 14:18:08,767 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 41 treesize of output 21 [2020-12-09 14:18:08,768 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:18:08,929 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-12-09 14:18:08,930 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:18:08,936 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 41 treesize of output 21 [2020-12-09 14:18:08,937 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 14:18:09,095 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-12-09 14:18:09,096 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:18:09,107 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 41 treesize of output 21 [2020-12-09 14:18:09,108 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-09 14:18:09,260 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-09 14:18:09,260 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:18:09,267 INFO L547 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-2 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2020-12-09 14:18:09,267 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:276, output treesize:209 [2020-12-09 14:18:09,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:18:09,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 14:18:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:18:09,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212387895] [2020-12-09 14:18:09,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [472182051] [2020-12-09 14:18:09,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/bin/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt [2020-12-09 14:18:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 14:18:09,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 14:18:09,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 14:18:10,173 WARN L197 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 53 [2020-12-09 14:18:10,173 INFO L348 Elim1Store]: treesize reduction 591, result has 15.0 percent of original size [2020-12-09 14:18:10,174 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 675 treesize of output 729 [2020-12-09 14:18:10,177 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-12-09 14:18:10,177 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:18:10,178 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-12-09 14:18:10,178 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:18:10,179 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 3, 2, 2, 1] term [2020-12-09 14:18:10,179 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:18:10,179 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 3, 2, 2, 1] term [2020-12-09 14:18:10,179 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:18:10,180 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-12-09 14:18:10,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:18:10,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 3, 3, 3, 3, 2, 2, 1] term [2020-12-09 14:18:10,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:18:10,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 2, 1] term [2020-12-09 14:18:10,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 14:18:10,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 2, 1] term [2020-12-09 14:18:10,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:18:10,183 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 5, 3, 3, 3, 3, 2, 2, 1] term [2020-12-09 14:18:10,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 14:18:10,191 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 14:18:10,391 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2020-12-09 14:18:10,392 INFO L625 ElimStorePlain]: treesize reduction 311, result has 33.1 percent of original size [2020-12-09 14:18:10,393 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 14:18:10,394 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 14:18:10,395 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 14:18:10,396 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 12 disjuncts [2020-12-09 14:18:10,400 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 14:18:10,401 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:122, output treesize:156 [2020-12-09 14:18:10,402 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 14:18:10,403 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 14:18:10,404 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 14:18:10,404 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 12 disjuncts [2020-12-09 14:18:10,501 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 14:18:10,502 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 14:18:10,503 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 14:18:10,503 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 12 disjuncts [2020-12-09 14:18:14,870 WARN L197 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2020-12-09 14:18:15,877 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-09 14:18:15,900 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 9, 1] term [2020-12-09 14:18:15,900 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 14:18:15,913 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 14:18:15,938 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 40 [2020-12-09 14:18:15,939 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 14:18:16,112 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-12-09 14:18:16,112 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:18:16,121 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 40 [2020-12-09 14:18:16,123 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 14:18:16,289 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-12-09 14:18:16,289 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:18:16,299 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 40 [2020-12-09 14:18:16,301 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 14:18:16,449 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-09 14:18:16,449 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 14:18:16,456 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2020-12-09 14:18:16,456 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:340, output treesize:219 [2020-12-09 14:18:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:18:16,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 14:18:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 14:18:16,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803200897] [2020-12-09 14:18:16,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8703cea7-aa9b-4409-a950-1a765ef3873f/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 14:18:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 14:18:16,829 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 14:18:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 14:18:16,868 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 14:18:17,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 mathsat -unsat_core_generation=3,12 cvc4 --incremental --print-success --lang smt [2020-12-09 14:18:17,519 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [1212387895] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [803200897] failed with TRACE_FEASIBLE at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:326) 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 14:18:17,528 INFO L168 Benchmark]: Toolchain (without parser) took 34343.39 ms. Allocated memory was 60.8 MB in the beginning and 98.6 MB in the end (delta: 37.7 MB). Free memory was 40.6 MB in the beginning and 31.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 48.1 MB. Max. memory is 16.1 GB. [2020-12-09 14:18:17,528 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 60.8 MB. Free memory was 43.4 MB in the beginning and 43.3 MB in the end (delta: 83.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 14:18:17,528 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.90 ms. Allocated memory was 60.8 MB in the beginning and 77.6 MB in the end (delta: 16.8 MB). Free memory was 40.4 MB in the beginning and 58.7 MB in the end (delta: -18.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 16.1 GB. [2020-12-09 14:18:17,529 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.53 ms. Allocated memory is still 77.6 MB. Free memory was 58.7 MB in the beginning and 56.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 14:18:17,529 INFO L168 Benchmark]: Boogie Preprocessor took 30.15 ms. Allocated memory is still 77.6 MB. Free memory was 56.1 MB in the beginning and 53.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 14:18:17,529 INFO L168 Benchmark]: RCFGBuilder took 629.05 ms. Allocated memory is still 77.6 MB. Free memory was 53.7 MB in the beginning and 53.6 MB in the end (delta: 106.8 kB). Peak memory consumption was 22.2 MB. Max. memory is 16.1 GB. [2020-12-09 14:18:17,530 INFO L168 Benchmark]: TraceAbstraction took 33243.15 ms. Allocated memory was 77.6 MB in the beginning and 98.6 MB in the end (delta: 21.0 MB). Free memory was 53.1 MB in the beginning and 31.2 MB in the end (delta: 21.9 MB). Peak memory consumption was 43.6 MB. Max. memory is 16.1 GB. [2020-12-09 14:18:17,531 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 60.8 MB. Free memory was 43.4 MB in the beginning and 43.3 MB in the end (delta: 83.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 393.90 ms. Allocated memory was 60.8 MB in the beginning and 77.6 MB in the end (delta: 16.8 MB). Free memory was 40.4 MB in the beginning and 58.7 MB in the end (delta: -18.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 42.53 ms. Allocated memory is still 77.6 MB. Free memory was 58.7 MB in the beginning and 56.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.15 ms. Allocated memory is still 77.6 MB. Free memory was 56.1 MB in the beginning and 53.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 629.05 ms. Allocated memory is still 77.6 MB. Free memory was 53.7 MB in the beginning and 53.6 MB in the end (delta: 106.8 kB). Peak memory consumption was 22.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 33243.15 ms. Allocated memory was 77.6 MB in the beginning and 98.6 MB in the end (delta: 21.0 MB). Free memory was 53.1 MB in the beginning and 31.2 MB in the end (delta: 21.9 MB). Peak memory consumption was 43.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [1212387895] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [803200897] failed with TRACE_FEASIBLE de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [1212387895] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [803200897] failed with TRACE_FEASIBLE: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:326) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...