./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20b427b12ecab1a55ea16dbf631b005753a22a0b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20b427b12ecab1a55ea16dbf631b005753a22a0b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:43:26,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:43:26,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:43:26,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:43:26,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:43:26,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:43:26,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:43:26,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:43:26,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:43:26,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:43:26,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:43:26,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:43:26,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:43:26,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:43:26,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:43:26,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:43:26,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:43:26,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:43:26,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:43:26,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:43:26,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:43:26,165 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:43:26,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:43:26,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:43:26,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:43:26,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:43:26,168 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:43:26,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:43:26,169 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:43:26,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:43:26,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:43:26,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:43:26,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:43:26,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:43:26,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:43:26,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:43:26,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:43:26,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:43:26,172 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:43:26,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:43:26,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:43:26,173 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 11:43:26,183 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:43:26,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:43:26,184 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:43:26,184 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:43:26,184 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:43:26,185 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:43:26,185 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:43:26,185 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:43:26,185 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:43:26,185 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:43:26,185 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:43:26,185 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:43:26,185 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:43:26,186 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:43:26,186 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:43:26,186 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:43:26,186 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:43:26,186 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:43:26,186 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:43:26,187 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 11:43:26,187 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:43:26,187 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:43:26,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:43:26,187 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 11:43:26,187 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 11:43:26,187 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 11:43:26,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:43:26,187 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:43:26,187 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:43:26,188 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:43:26,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:43:26,188 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:43:26,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:43:26,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:43:26,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:43:26,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:43:26,188 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:43:26,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:43:26,189 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:43:26,189 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:43:26,189 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20b427b12ecab1a55ea16dbf631b005753a22a0b [2019-12-07 11:43:26,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:43:26,295 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:43:26,298 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:43:26,298 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:43:26,299 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:43:26,299 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-01-1.i [2019-12-07 11:43:26,337 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/data/8eb354e66/c5b80e7b752547a7bb6f0bc21bb3d502/FLAGd25632d02 [2019-12-07 11:43:26,805 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:43:26,806 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/sv-benchmarks/c/forester-heap/sll-01-1.i [2019-12-07 11:43:26,815 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/data/8eb354e66/c5b80e7b752547a7bb6f0bc21bb3d502/FLAGd25632d02 [2019-12-07 11:43:27,322 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/data/8eb354e66/c5b80e7b752547a7bb6f0bc21bb3d502 [2019-12-07 11:43:27,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:43:27,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:43:27,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:43:27,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:43:27,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:43:27,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:43:27" (1/1) ... [2019-12-07 11:43:27,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c7b5f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:43:27, skipping insertion in model container [2019-12-07 11:43:27,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:43:27" (1/1) ... [2019-12-07 11:43:27,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:43:27,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:43:27,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:43:27,606 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:43:27,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:43:27,668 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:43:27,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:43:27 WrapperNode [2019-12-07 11:43:27,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:43:27,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:43:27,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:43:27,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:43:27,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:43:27" (1/1) ... [2019-12-07 11:43:27,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:43:27" (1/1) ... [2019-12-07 11:43:27,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:43:27,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:43:27,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:43:27,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:43:27,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:43:27" (1/1) ... [2019-12-07 11:43:27,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:43:27" (1/1) ... [2019-12-07 11:43:27,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:43:27" (1/1) ... [2019-12-07 11:43:27,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:43:27" (1/1) ... [2019-12-07 11:43:27,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:43:27" (1/1) ... [2019-12-07 11:43:27,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:43:27" (1/1) ... [2019-12-07 11:43:27,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:43:27" (1/1) ... [2019-12-07 11:43:27,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:43:27,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:43:27,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:43:27,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:43:27,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:43:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/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 [2019-12-07 11:43:27,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:43:27,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 11:43:27,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 11:43:27,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:43:27,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:43:27,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:43:28,192 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:43:28,193 INFO L287 CfgBuilder]: Removed 34 assume(true) statements. [2019-12-07 11:43:28,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:43:28 BoogieIcfgContainer [2019-12-07 11:43:28,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:43:28,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:43:28,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:43:28,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:43:28,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:43:27" (1/3) ... [2019-12-07 11:43:28,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77711121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:43:28, skipping insertion in model container [2019-12-07 11:43:28,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:43:27" (2/3) ... [2019-12-07 11:43:28,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77711121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:43:28, skipping insertion in model container [2019-12-07 11:43:28,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:43:28" (3/3) ... [2019-12-07 11:43:28,199 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2019-12-07 11:43:28,205 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:43:28,210 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 78 error locations. [2019-12-07 11:43:28,217 INFO L249 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2019-12-07 11:43:28,229 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:43:28,229 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 11:43:28,229 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:43:28,229 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:43:28,229 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:43:28,229 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:43:28,229 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:43:28,229 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:43:28,244 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2019-12-07 11:43:28,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 11:43:28,248 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:28,249 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 11:43:28,249 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:28,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:28,253 INFO L82 PathProgramCache]: Analyzing trace with hash 14698, now seen corresponding path program 1 times [2019-12-07 11:43:28,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:28,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363086001] [2019-12-07 11:43:28,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:28,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:28,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363086001] [2019-12-07 11:43:28,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:28,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:43:28,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171645362] [2019-12-07 11:43:28,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:43:28,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:28,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:43:28,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:43:28,366 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 3 states. [2019-12-07 11:43:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:28,492 INFO L93 Difference]: Finished difference Result 169 states and 177 transitions. [2019-12-07 11:43:28,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:43:28,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 11:43:28,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:28,501 INFO L225 Difference]: With dead ends: 169 [2019-12-07 11:43:28,501 INFO L226 Difference]: Without dead ends: 167 [2019-12-07 11:43:28,502 INFO L630 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 [2019-12-07 11:43:28,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-12-07 11:43:28,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2019-12-07 11:43:28,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 11:43:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 174 transitions. [2019-12-07 11:43:28,533 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 174 transitions. Word has length 2 [2019-12-07 11:43:28,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:28,533 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 174 transitions. [2019-12-07 11:43:28,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:43:28,533 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 174 transitions. [2019-12-07 11:43:28,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 11:43:28,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:28,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 11:43:28,534 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:28,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:28,534 INFO L82 PathProgramCache]: Analyzing trace with hash 14699, now seen corresponding path program 1 times [2019-12-07 11:43:28,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:28,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500063217] [2019-12-07 11:43:28,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:28,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500063217] [2019-12-07 11:43:28,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:28,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:43:28,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642772142] [2019-12-07 11:43:28,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:43:28,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:28,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:43:28,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:43:28,559 INFO L87 Difference]: Start difference. First operand 163 states and 174 transitions. Second operand 3 states. [2019-12-07 11:43:28,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:28,661 INFO L93 Difference]: Finished difference Result 190 states and 200 transitions. [2019-12-07 11:43:28,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:43:28,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 11:43:28,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:28,663 INFO L225 Difference]: With dead ends: 190 [2019-12-07 11:43:28,663 INFO L226 Difference]: Without dead ends: 190 [2019-12-07 11:43:28,664 INFO L630 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 [2019-12-07 11:43:28,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-12-07 11:43:28,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 171. [2019-12-07 11:43:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 11:43:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 193 transitions. [2019-12-07 11:43:28,677 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 193 transitions. Word has length 2 [2019-12-07 11:43:28,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:28,677 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 193 transitions. [2019-12-07 11:43:28,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:43:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 193 transitions. [2019-12-07 11:43:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 11:43:28,678 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:28,678 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 11:43:28,679 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:28,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:28,679 INFO L82 PathProgramCache]: Analyzing trace with hash 14124170, now seen corresponding path program 1 times [2019-12-07 11:43:28,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:28,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776957708] [2019-12-07 11:43:28,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:28,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776957708] [2019-12-07 11:43:28,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:28,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:43:28,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082831714] [2019-12-07 11:43:28,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:43:28,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:28,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:43:28,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:43:28,701 INFO L87 Difference]: Start difference. First operand 171 states and 193 transitions. Second operand 3 states. [2019-12-07 11:43:28,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:28,727 INFO L93 Difference]: Finished difference Result 186 states and 196 transitions. [2019-12-07 11:43:28,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:43:28,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 11:43:28,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:28,729 INFO L225 Difference]: With dead ends: 186 [2019-12-07 11:43:28,729 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 11:43:28,729 INFO L630 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 [2019-12-07 11:43:28,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 11:43:28,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2019-12-07 11:43:28,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-07 11:43:28,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 190 transitions. [2019-12-07 11:43:28,738 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 190 transitions. Word has length 4 [2019-12-07 11:43:28,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:28,738 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 190 transitions. [2019-12-07 11:43:28,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:43:28,738 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2019-12-07 11:43:28,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:43:28,739 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:28,739 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:43:28,739 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:28,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:28,739 INFO L82 PathProgramCache]: Analyzing trace with hash -106701968, now seen corresponding path program 1 times [2019-12-07 11:43:28,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:28,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965709928] [2019-12-07 11:43:28,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:28,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965709928] [2019-12-07 11:43:28,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:28,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:43:28,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577960942] [2019-12-07 11:43:28,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:43:28,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:28,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:43:28,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:43:28,780 INFO L87 Difference]: Start difference. First operand 169 states and 190 transitions. Second operand 5 states. [2019-12-07 11:43:29,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:29,012 INFO L93 Difference]: Finished difference Result 296 states and 324 transitions. [2019-12-07 11:43:29,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:43:29,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 11:43:29,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:29,014 INFO L225 Difference]: With dead ends: 296 [2019-12-07 11:43:29,014 INFO L226 Difference]: Without dead ends: 296 [2019-12-07 11:43:29,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:43:29,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-07 11:43:29,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 168. [2019-12-07 11:43:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 11:43:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 189 transitions. [2019-12-07 11:43:29,025 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 189 transitions. Word has length 9 [2019-12-07 11:43:29,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:29,025 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 189 transitions. [2019-12-07 11:43:29,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:43:29,026 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 189 transitions. [2019-12-07 11:43:29,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:43:29,026 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:29,026 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:43:29,027 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:29,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:29,027 INFO L82 PathProgramCache]: Analyzing trace with hash -106701967, now seen corresponding path program 1 times [2019-12-07 11:43:29,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:29,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350303768] [2019-12-07 11:43:29,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:29,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350303768] [2019-12-07 11:43:29,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:29,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:43:29,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844375239] [2019-12-07 11:43:29,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:43:29,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:29,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:43:29,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:43:29,078 INFO L87 Difference]: Start difference. First operand 168 states and 189 transitions. Second operand 5 states. [2019-12-07 11:43:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:29,324 INFO L93 Difference]: Finished difference Result 320 states and 361 transitions. [2019-12-07 11:43:29,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:43:29,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 11:43:29,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:29,325 INFO L225 Difference]: With dead ends: 320 [2019-12-07 11:43:29,326 INFO L226 Difference]: Without dead ends: 320 [2019-12-07 11:43:29,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:43:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-07 11:43:29,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 167. [2019-12-07 11:43:29,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-12-07 11:43:29,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 188 transitions. [2019-12-07 11:43:29,331 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 188 transitions. Word has length 9 [2019-12-07 11:43:29,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:29,331 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 188 transitions. [2019-12-07 11:43:29,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:43:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 188 transitions. [2019-12-07 11:43:29,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:43:29,332 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:29,332 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:43:29,332 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:29,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:29,332 INFO L82 PathProgramCache]: Analyzing trace with hash 539009637, now seen corresponding path program 1 times [2019-12-07 11:43:29,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:29,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116120210] [2019-12-07 11:43:29,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:29,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116120210] [2019-12-07 11:43:29,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:29,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:43:29,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788564150] [2019-12-07 11:43:29,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:43:29,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:29,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:43:29,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:43:29,418 INFO L87 Difference]: Start difference. First operand 167 states and 188 transitions. Second operand 8 states. [2019-12-07 11:43:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:29,974 INFO L93 Difference]: Finished difference Result 297 states and 324 transitions. [2019-12-07 11:43:29,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:43:29,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-07 11:43:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:29,976 INFO L225 Difference]: With dead ends: 297 [2019-12-07 11:43:29,976 INFO L226 Difference]: Without dead ends: 297 [2019-12-07 11:43:29,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:43:29,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-12-07 11:43:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 166. [2019-12-07 11:43:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-12-07 11:43:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 187 transitions. [2019-12-07 11:43:29,981 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 187 transitions. Word has length 11 [2019-12-07 11:43:29,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:29,981 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 187 transitions. [2019-12-07 11:43:29,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:43:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 187 transitions. [2019-12-07 11:43:29,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:43:29,982 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:29,982 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:43:29,983 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:29,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:29,983 INFO L82 PathProgramCache]: Analyzing trace with hash 539009636, now seen corresponding path program 1 times [2019-12-07 11:43:29,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:29,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266336859] [2019-12-07 11:43:29,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:30,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266336859] [2019-12-07 11:43:30,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:30,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:43:30,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180443747] [2019-12-07 11:43:30,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:43:30,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:30,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:43:30,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:43:30,050 INFO L87 Difference]: Start difference. First operand 166 states and 187 transitions. Second operand 8 states. [2019-12-07 11:43:30,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:30,497 INFO L93 Difference]: Finished difference Result 294 states and 321 transitions. [2019-12-07 11:43:30,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:43:30,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-07 11:43:30,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:30,498 INFO L225 Difference]: With dead ends: 294 [2019-12-07 11:43:30,499 INFO L226 Difference]: Without dead ends: 294 [2019-12-07 11:43:30,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:43:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-07 11:43:30,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 165. [2019-12-07 11:43:30,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 11:43:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 186 transitions. [2019-12-07 11:43:30,503 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 186 transitions. Word has length 11 [2019-12-07 11:43:30,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:30,503 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 186 transitions. [2019-12-07 11:43:30,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:43:30,503 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2019-12-07 11:43:30,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:43:30,504 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:30,504 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:43:30,504 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:30,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:30,505 INFO L82 PathProgramCache]: Analyzing trace with hash 403125065, now seen corresponding path program 1 times [2019-12-07 11:43:30,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:30,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537201666] [2019-12-07 11:43:30,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:30,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537201666] [2019-12-07 11:43:30,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:30,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:43:30,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198658345] [2019-12-07 11:43:30,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:43:30,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:30,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:43:30,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:43:30,525 INFO L87 Difference]: Start difference. First operand 165 states and 186 transitions. Second operand 3 states. [2019-12-07 11:43:30,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:30,532 INFO L93 Difference]: Finished difference Result 166 states and 187 transitions. [2019-12-07 11:43:30,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:43:30,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 11:43:30,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:30,533 INFO L225 Difference]: With dead ends: 166 [2019-12-07 11:43:30,533 INFO L226 Difference]: Without dead ends: 166 [2019-12-07 11:43:30,534 INFO L630 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 [2019-12-07 11:43:30,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-07 11:43:30,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-12-07 11:43:30,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-12-07 11:43:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 187 transitions. [2019-12-07 11:43:30,536 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 187 transitions. Word has length 11 [2019-12-07 11:43:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:30,536 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 187 transitions. [2019-12-07 11:43:30,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:43:30,537 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 187 transitions. [2019-12-07 11:43:30,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 11:43:30,537 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:30,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:43:30,537 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:30,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:30,538 INFO L82 PathProgramCache]: Analyzing trace with hash -387613526, now seen corresponding path program 1 times [2019-12-07 11:43:30,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:30,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214911590] [2019-12-07 11:43:30,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:30,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214911590] [2019-12-07 11:43:30,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:30,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:43:30,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708398773] [2019-12-07 11:43:30,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:43:30,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:30,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:43:30,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:43:30,567 INFO L87 Difference]: Start difference. First operand 166 states and 187 transitions. Second operand 5 states. [2019-12-07 11:43:30,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:30,653 INFO L93 Difference]: Finished difference Result 246 states and 272 transitions. [2019-12-07 11:43:30,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:43:30,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 11:43:30,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:30,654 INFO L225 Difference]: With dead ends: 246 [2019-12-07 11:43:30,654 INFO L226 Difference]: Without dead ends: 246 [2019-12-07 11:43:30,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:43:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-12-07 11:43:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 163. [2019-12-07 11:43:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 11:43:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2019-12-07 11:43:30,659 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 184 transitions. Word has length 12 [2019-12-07 11:43:30,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:30,659 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 184 transitions. [2019-12-07 11:43:30,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:43:30,659 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 184 transitions. [2019-12-07 11:43:30,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 11:43:30,660 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:30,660 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:43:30,660 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:30,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:30,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1768487341, now seen corresponding path program 1 times [2019-12-07 11:43:30,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:30,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456272502] [2019-12-07 11:43:30,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:30,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:30,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456272502] [2019-12-07 11:43:30,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:30,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:43:30,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119254086] [2019-12-07 11:43:30,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:43:30,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:30,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:43:30,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:43:30,685 INFO L87 Difference]: Start difference. First operand 163 states and 184 transitions. Second operand 4 states. [2019-12-07 11:43:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:30,761 INFO L93 Difference]: Finished difference Result 246 states and 271 transitions. [2019-12-07 11:43:30,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:43:30,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 11:43:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:30,763 INFO L225 Difference]: With dead ends: 246 [2019-12-07 11:43:30,763 INFO L226 Difference]: Without dead ends: 246 [2019-12-07 11:43:30,763 INFO L630 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 [2019-12-07 11:43:30,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-12-07 11:43:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 165. [2019-12-07 11:43:30,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 11:43:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 186 transitions. [2019-12-07 11:43:30,766 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 186 transitions. Word has length 15 [2019-12-07 11:43:30,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:30,766 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 186 transitions. [2019-12-07 11:43:30,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:43:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2019-12-07 11:43:30,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:43:30,766 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:30,767 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:43:30,767 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:30,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:30,767 INFO L82 PathProgramCache]: Analyzing trace with hash -763381964, now seen corresponding path program 1 times [2019-12-07 11:43:30,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:30,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021448755] [2019-12-07 11:43:30,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:30,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:30,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021448755] [2019-12-07 11:43:30,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:30,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:43:30,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316138525] [2019-12-07 11:43:30,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:43:30,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:30,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:43:30,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:43:30,794 INFO L87 Difference]: Start difference. First operand 165 states and 186 transitions. Second operand 4 states. [2019-12-07 11:43:30,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:30,887 INFO L93 Difference]: Finished difference Result 160 states and 179 transitions. [2019-12-07 11:43:30,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:43:30,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 11:43:30,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:30,888 INFO L225 Difference]: With dead ends: 160 [2019-12-07 11:43:30,888 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 11:43:30,889 INFO L630 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 [2019-12-07 11:43:30,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 11:43:30,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2019-12-07 11:43:30,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-12-07 11:43:30,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 177 transitions. [2019-12-07 11:43:30,892 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 177 transitions. Word has length 16 [2019-12-07 11:43:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:30,892 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 177 transitions. [2019-12-07 11:43:30,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:43:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 177 transitions. [2019-12-07 11:43:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:43:30,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:30,892 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:43:30,893 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:30,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:30,893 INFO L82 PathProgramCache]: Analyzing trace with hash -763381963, now seen corresponding path program 1 times [2019-12-07 11:43:30,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:30,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674247649] [2019-12-07 11:43:30,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:30,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674247649] [2019-12-07 11:43:30,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:30,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:43:30,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607352526] [2019-12-07 11:43:30,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:43:30,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:30,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:43:30,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:43:30,939 INFO L87 Difference]: Start difference. First operand 156 states and 177 transitions. Second operand 5 states. [2019-12-07 11:43:31,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:31,117 INFO L93 Difference]: Finished difference Result 205 states and 219 transitions. [2019-12-07 11:43:31,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:43:31,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 11:43:31,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:31,118 INFO L225 Difference]: With dead ends: 205 [2019-12-07 11:43:31,118 INFO L226 Difference]: Without dead ends: 205 [2019-12-07 11:43:31,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:43:31,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-12-07 11:43:31,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 173. [2019-12-07 11:43:31,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-12-07 11:43:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 205 transitions. [2019-12-07 11:43:31,122 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 205 transitions. Word has length 16 [2019-12-07 11:43:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:31,122 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 205 transitions. [2019-12-07 11:43:31,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:43:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 205 transitions. [2019-12-07 11:43:31,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:43:31,122 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:31,123 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:43:31,123 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:31,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:31,123 INFO L82 PathProgramCache]: Analyzing trace with hash 829388096, now seen corresponding path program 1 times [2019-12-07 11:43:31,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:31,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413467774] [2019-12-07 11:43:31,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:31,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413467774] [2019-12-07 11:43:31,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:31,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:43:31,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705141468] [2019-12-07 11:43:31,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:43:31,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:31,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:43:31,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:43:31,141 INFO L87 Difference]: Start difference. First operand 173 states and 205 transitions. Second operand 4 states. [2019-12-07 11:43:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:31,208 INFO L93 Difference]: Finished difference Result 201 states and 213 transitions. [2019-12-07 11:43:31,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:43:31,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 11:43:31,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:31,210 INFO L225 Difference]: With dead ends: 201 [2019-12-07 11:43:31,210 INFO L226 Difference]: Without dead ends: 201 [2019-12-07 11:43:31,210 INFO L630 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 [2019-12-07 11:43:31,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-07 11:43:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 171. [2019-12-07 11:43:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 11:43:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 202 transitions. [2019-12-07 11:43:31,213 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 202 transitions. Word has length 18 [2019-12-07 11:43:31,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:31,213 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 202 transitions. [2019-12-07 11:43:31,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:43:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 202 transitions. [2019-12-07 11:43:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:43:31,213 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:31,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:43:31,214 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:31,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:31,214 INFO L82 PathProgramCache]: Analyzing trace with hash 829353023, now seen corresponding path program 1 times [2019-12-07 11:43:31,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:31,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115391841] [2019-12-07 11:43:31,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:31,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115391841] [2019-12-07 11:43:31,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:31,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:43:31,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112842050] [2019-12-07 11:43:31,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:43:31,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:31,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:43:31,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:43:31,236 INFO L87 Difference]: Start difference. First operand 171 states and 202 transitions. Second operand 5 states. [2019-12-07 11:43:31,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:31,384 INFO L93 Difference]: Finished difference Result 250 states and 295 transitions. [2019-12-07 11:43:31,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:43:31,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-07 11:43:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:31,385 INFO L225 Difference]: With dead ends: 250 [2019-12-07 11:43:31,385 INFO L226 Difference]: Without dead ends: 250 [2019-12-07 11:43:31,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:43:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-12-07 11:43:31,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 170. [2019-12-07 11:43:31,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-07 11:43:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 201 transitions. [2019-12-07 11:43:31,390 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 201 transitions. Word has length 18 [2019-12-07 11:43:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:31,390 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 201 transitions. [2019-12-07 11:43:31,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:43:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 201 transitions. [2019-12-07 11:43:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:43:31,390 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:31,391 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:43:31,391 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:31,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:31,391 INFO L82 PathProgramCache]: Analyzing trace with hash 829353024, now seen corresponding path program 1 times [2019-12-07 11:43:31,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:31,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84671528] [2019-12-07 11:43:31,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:31,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:31,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84671528] [2019-12-07 11:43:31,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:31,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:43:31,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343630465] [2019-12-07 11:43:31,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:43:31,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:31,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:43:31,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:43:31,425 INFO L87 Difference]: Start difference. First operand 170 states and 201 transitions. Second operand 5 states. [2019-12-07 11:43:31,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:31,603 INFO L93 Difference]: Finished difference Result 266 states and 322 transitions. [2019-12-07 11:43:31,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:43:31,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-07 11:43:31,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:31,605 INFO L225 Difference]: With dead ends: 266 [2019-12-07 11:43:31,605 INFO L226 Difference]: Without dead ends: 266 [2019-12-07 11:43:31,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:43:31,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-12-07 11:43:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 157. [2019-12-07 11:43:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 11:43:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 187 transitions. [2019-12-07 11:43:31,608 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 187 transitions. Word has length 18 [2019-12-07 11:43:31,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:31,608 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 187 transitions. [2019-12-07 11:43:31,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:43:31,608 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 187 transitions. [2019-12-07 11:43:31,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 11:43:31,609 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:31,609 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:43:31,609 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:31,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:31,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1855659457, now seen corresponding path program 1 times [2019-12-07 11:43:31,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:31,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677033633] [2019-12-07 11:43:31,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:31,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677033633] [2019-12-07 11:43:31,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:31,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:43:31,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092578916] [2019-12-07 11:43:31,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:43:31,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:31,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:43:31,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:43:31,631 INFO L87 Difference]: Start difference. First operand 157 states and 187 transitions. Second operand 5 states. [2019-12-07 11:43:31,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:31,733 INFO L93 Difference]: Finished difference Result 262 states and 318 transitions. [2019-12-07 11:43:31,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:43:31,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-07 11:43:31,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:31,735 INFO L225 Difference]: With dead ends: 262 [2019-12-07 11:43:31,735 INFO L226 Difference]: Without dead ends: 262 [2019-12-07 11:43:31,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:43:31,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-12-07 11:43:31,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 153. [2019-12-07 11:43:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-07 11:43:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 183 transitions. [2019-12-07 11:43:31,738 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 183 transitions. Word has length 20 [2019-12-07 11:43:31,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:31,738 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 183 transitions. [2019-12-07 11:43:31,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:43:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 183 transitions. [2019-12-07 11:43:31,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 11:43:31,738 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:31,739 INFO L410 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] [2019-12-07 11:43:31,739 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:31,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:31,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1558332140, now seen corresponding path program 1 times [2019-12-07 11:43:31,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:31,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411958592] [2019-12-07 11:43:31,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:31,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:31,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411958592] [2019-12-07 11:43:31,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:31,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:43:31,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4445209] [2019-12-07 11:43:31,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:43:31,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:31,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:43:31,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:43:31,753 INFO L87 Difference]: Start difference. First operand 153 states and 183 transitions. Second operand 3 states. [2019-12-07 11:43:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:31,759 INFO L93 Difference]: Finished difference Result 218 states and 263 transitions. [2019-12-07 11:43:31,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:43:31,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 11:43:31,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:31,760 INFO L225 Difference]: With dead ends: 218 [2019-12-07 11:43:31,760 INFO L226 Difference]: Without dead ends: 218 [2019-12-07 11:43:31,760 INFO L630 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 [2019-12-07 11:43:31,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-12-07 11:43:31,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 157. [2019-12-07 11:43:31,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 11:43:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 189 transitions. [2019-12-07 11:43:31,764 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 189 transitions. Word has length 23 [2019-12-07 11:43:31,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:31,764 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 189 transitions. [2019-12-07 11:43:31,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:43:31,764 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 189 transitions. [2019-12-07 11:43:31,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 11:43:31,764 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:31,765 INFO L410 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] [2019-12-07 11:43:31,765 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:31,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:31,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1558332014, now seen corresponding path program 1 times [2019-12-07 11:43:31,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:31,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935663148] [2019-12-07 11:43:31,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:31,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:31,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935663148] [2019-12-07 11:43:31,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:31,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:43:31,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290531630] [2019-12-07 11:43:31,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:43:31,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:31,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:43:31,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:43:31,782 INFO L87 Difference]: Start difference. First operand 157 states and 189 transitions. Second operand 3 states. [2019-12-07 11:43:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:31,794 INFO L93 Difference]: Finished difference Result 155 states and 186 transitions. [2019-12-07 11:43:31,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:43:31,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 11:43:31,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:31,795 INFO L225 Difference]: With dead ends: 155 [2019-12-07 11:43:31,796 INFO L226 Difference]: Without dead ends: 155 [2019-12-07 11:43:31,796 INFO L630 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 [2019-12-07 11:43:31,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-07 11:43:31,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-12-07 11:43:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 11:43:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 186 transitions. [2019-12-07 11:43:31,798 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 186 transitions. Word has length 23 [2019-12-07 11:43:31,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:31,799 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 186 transitions. [2019-12-07 11:43:31,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:43:31,799 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 186 transitions. [2019-12-07 11:43:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 11:43:31,799 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:31,799 INFO L410 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] [2019-12-07 11:43:31,800 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:31,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:31,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1063656504, now seen corresponding path program 1 times [2019-12-07 11:43:31,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:31,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689409829] [2019-12-07 11:43:31,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:31,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:31,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689409829] [2019-12-07 11:43:31,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:31,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:43:31,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239813096] [2019-12-07 11:43:31,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:43:31,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:31,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:43:31,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:43:31,885 INFO L87 Difference]: Start difference. First operand 155 states and 186 transitions. Second operand 7 states. [2019-12-07 11:43:32,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:32,128 INFO L93 Difference]: Finished difference Result 267 states and 297 transitions. [2019-12-07 11:43:32,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:43:32,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-12-07 11:43:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:32,129 INFO L225 Difference]: With dead ends: 267 [2019-12-07 11:43:32,129 INFO L226 Difference]: Without dead ends: 267 [2019-12-07 11:43:32,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:43:32,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-12-07 11:43:32,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 183. [2019-12-07 11:43:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-12-07 11:43:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 219 transitions. [2019-12-07 11:43:32,132 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 219 transitions. Word has length 24 [2019-12-07 11:43:32,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:32,133 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 219 transitions. [2019-12-07 11:43:32,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:43:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 219 transitions. [2019-12-07 11:43:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:43:32,133 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:32,133 INFO L410 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] [2019-12-07 11:43:32,133 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:32,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:32,134 INFO L82 PathProgramCache]: Analyzing trace with hash -24381295, now seen corresponding path program 1 times [2019-12-07 11:43:32,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:32,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240103584] [2019-12-07 11:43:32,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:32,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240103584] [2019-12-07 11:43:32,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375529084] [2019-12-07 11:43:32,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/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 [2019-12-07 11:43:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:32,208 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 11:43:32,212 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:43:32,258 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:43:32,259 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:43:32,265 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:43:32,267 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:43:32,267 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:43:32,273 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:43:32,273 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:43:32,273 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2019-12-07 11:43:32,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:43:32,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 11:43:32,293 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:43:32,301 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:43:32,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:43:32,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 11:43:32,305 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:43:32,314 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:43:32,314 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:43:32,314 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-12-07 11:43:32,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:43:32,357 INFO L377 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 24 treesize of output 10 [2019-12-07 11:43:32,358 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:43:32,366 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:43:32,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:43:32,370 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:43:32,370 INFO L377 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 24 treesize of output 10 [2019-12-07 11:43:32,370 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:43:32,375 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:43:32,376 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:43:32,376 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2019-12-07 11:43:32,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:32,380 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:43:32,392 INFO L377 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 13 [2019-12-07 11:43:32,394 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:43:32,395 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:43:32,396 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:43:32,397 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:43:32,397 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:43:32,398 INFO L614 ElimStorePlain]: treesize reduction 19, result has 5.0 percent of original size [2019-12-07 11:43:32,398 INFO L502 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-12-07 11:43:32,398 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:43:32,398 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:1 [2019-12-07 11:43:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:32,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1065725363] [2019-12-07 11:43:32,423 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2019-12-07 11:43:32,423 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:43:32,429 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:43:32,435 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:43:32,436 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:43:32,537 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:43:32,634 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:43:34,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:43:34,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 6, 5] total 20 [2019-12-07 11:43:34,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205115946] [2019-12-07 11:43:34,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 11:43:34,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:34,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:43:34,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:43:34,098 INFO L87 Difference]: Start difference. First operand 183 states and 219 transitions. Second operand 13 states. [2019-12-07 11:43:34,428 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-12-07 11:43:34,729 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-12-07 11:43:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:34,987 INFO L93 Difference]: Finished difference Result 184 states and 200 transitions. [2019-12-07 11:43:34,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 11:43:34,988 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-12-07 11:43:34,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:34,989 INFO L225 Difference]: With dead ends: 184 [2019-12-07 11:43:34,989 INFO L226 Difference]: Without dead ends: 184 [2019-12-07 11:43:34,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 51 SyntacticMatches, 13 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:43:34,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-12-07 11:43:34,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 115. [2019-12-07 11:43:34,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 11:43:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 133 transitions. [2019-12-07 11:43:34,994 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 133 transitions. Word has length 26 [2019-12-07 11:43:34,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:34,994 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 133 transitions. [2019-12-07 11:43:34,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 11:43:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 133 transitions. [2019-12-07 11:43:34,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:43:34,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:34,995 INFO L410 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] [2019-12-07 11:43:35,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:43:35,196 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:35,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:35,197 INFO L82 PathProgramCache]: Analyzing trace with hash -349009495, now seen corresponding path program 1 times [2019-12-07 11:43:35,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:35,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053768778] [2019-12-07 11:43:35,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:35,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053768778] [2019-12-07 11:43:35,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:35,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:43:35,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049751772] [2019-12-07 11:43:35,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:43:35,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:35,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:43:35,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:43:35,228 INFO L87 Difference]: Start difference. First operand 115 states and 133 transitions. Second operand 5 states. [2019-12-07 11:43:35,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:35,380 INFO L93 Difference]: Finished difference Result 172 states and 195 transitions. [2019-12-07 11:43:35,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:43:35,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 11:43:35,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:35,381 INFO L225 Difference]: With dead ends: 172 [2019-12-07 11:43:35,381 INFO L226 Difference]: Without dead ends: 172 [2019-12-07 11:43:35,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:43:35,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-07 11:43:35,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 114. [2019-12-07 11:43:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 11:43:35,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2019-12-07 11:43:35,383 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 27 [2019-12-07 11:43:35,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:35,383 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2019-12-07 11:43:35,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:43:35,383 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2019-12-07 11:43:35,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:43:35,384 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:35,384 INFO L410 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] [2019-12-07 11:43:35,384 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:35,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:35,384 INFO L82 PathProgramCache]: Analyzing trace with hash -349009494, now seen corresponding path program 1 times [2019-12-07 11:43:35,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:35,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041605030] [2019-12-07 11:43:35,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:35,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:35,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041605030] [2019-12-07 11:43:35,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:35,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:43:35,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005785022] [2019-12-07 11:43:35,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:43:35,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:35,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:43:35,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:43:35,419 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand 5 states. [2019-12-07 11:43:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:35,567 INFO L93 Difference]: Finished difference Result 199 states and 233 transitions. [2019-12-07 11:43:35,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:43:35,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 11:43:35,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:35,568 INFO L225 Difference]: With dead ends: 199 [2019-12-07 11:43:35,569 INFO L226 Difference]: Without dead ends: 199 [2019-12-07 11:43:35,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:43:35,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-12-07 11:43:35,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 113. [2019-12-07 11:43:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 11:43:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2019-12-07 11:43:35,571 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 27 [2019-12-07 11:43:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:35,571 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2019-12-07 11:43:35,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:43:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2019-12-07 11:43:35,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:43:35,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:35,572 INFO L410 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] [2019-12-07 11:43:35,572 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:35,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:35,572 INFO L82 PathProgramCache]: Analyzing trace with hash -390397655, now seen corresponding path program 1 times [2019-12-07 11:43:35,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:35,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904240781] [2019-12-07 11:43:35,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:35,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904240781] [2019-12-07 11:43:35,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:35,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:43:35,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836510352] [2019-12-07 11:43:35,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:43:35,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:35,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:43:35,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:43:35,647 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 10 states. [2019-12-07 11:43:35,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:35,997 INFO L93 Difference]: Finished difference Result 166 states and 189 transitions. [2019-12-07 11:43:35,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:43:35,997 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-12-07 11:43:35,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:35,998 INFO L225 Difference]: With dead ends: 166 [2019-12-07 11:43:35,998 INFO L226 Difference]: Without dead ends: 166 [2019-12-07 11:43:35,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:43:35,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-07 11:43:35,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 112. [2019-12-07 11:43:36,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 11:43:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2019-12-07 11:43:36,000 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 29 [2019-12-07 11:43:36,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:36,000 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2019-12-07 11:43:36,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:43:36,000 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2019-12-07 11:43:36,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:43:36,000 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:36,001 INFO L410 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] [2019-12-07 11:43:36,001 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:36,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:36,001 INFO L82 PathProgramCache]: Analyzing trace with hash -390397654, now seen corresponding path program 1 times [2019-12-07 11:43:36,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:36,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695124990] [2019-12-07 11:43:36,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:36,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695124990] [2019-12-07 11:43:36,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:36,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:43:36,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991691787] [2019-12-07 11:43:36,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:43:36,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:36,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:43:36,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:43:36,081 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 10 states. [2019-12-07 11:43:36,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:36,801 INFO L93 Difference]: Finished difference Result 165 states and 188 transitions. [2019-12-07 11:43:36,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:43:36,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-12-07 11:43:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:36,802 INFO L225 Difference]: With dead ends: 165 [2019-12-07 11:43:36,802 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 11:43:36,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:43:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 11:43:36,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 111. [2019-12-07 11:43:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 11:43:36,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2019-12-07 11:43:36,804 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 29 [2019-12-07 11:43:36,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:36,804 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2019-12-07 11:43:36,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:43:36,804 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2019-12-07 11:43:36,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:43:36,805 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:36,805 INFO L410 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] [2019-12-07 11:43:36,805 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:36,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:36,805 INFO L82 PathProgramCache]: Analyzing trace with hash -529626506, now seen corresponding path program 1 times [2019-12-07 11:43:36,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:36,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959755906] [2019-12-07 11:43:36,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:36,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:36,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959755906] [2019-12-07 11:43:36,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:36,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:43:36,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481547826] [2019-12-07 11:43:36,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:43:36,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:36,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:43:36,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:43:36,821 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand 3 states. [2019-12-07 11:43:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:36,828 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2019-12-07 11:43:36,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:43:36,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 11:43:36,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:36,828 INFO L225 Difference]: With dead ends: 112 [2019-12-07 11:43:36,828 INFO L226 Difference]: Without dead ends: 112 [2019-12-07 11:43:36,829 INFO L630 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 [2019-12-07 11:43:36,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-07 11:43:36,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-12-07 11:43:36,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 11:43:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2019-12-07 11:43:36,830 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 29 [2019-12-07 11:43:36,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:36,830 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2019-12-07 11:43:36,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:43:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2019-12-07 11:43:36,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 11:43:36,831 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:36,831 INFO L410 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] [2019-12-07 11:43:36,831 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:36,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:36,831 INFO L82 PathProgramCache]: Analyzing trace with hash -97743196, now seen corresponding path program 1 times [2019-12-07 11:43:36,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:36,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789672339] [2019-12-07 11:43:36,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:43:36,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789672339] [2019-12-07 11:43:36,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:36,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:43:36,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083309285] [2019-12-07 11:43:36,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:43:36,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:36,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:43:36,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:43:36,861 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 5 states. [2019-12-07 11:43:36,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:36,943 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2019-12-07 11:43:36,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:43:36,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 11:43:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:36,944 INFO L225 Difference]: With dead ends: 135 [2019-12-07 11:43:36,944 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 11:43:36,944 INFO L630 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 [2019-12-07 11:43:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 11:43:36,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 130. [2019-12-07 11:43:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 11:43:36,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2019-12-07 11:43:36,946 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 30 [2019-12-07 11:43:36,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:36,946 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2019-12-07 11:43:36,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:43:36,946 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2019-12-07 11:43:36,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 11:43:36,946 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:36,946 INFO L410 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] [2019-12-07 11:43:36,946 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:36,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:36,947 INFO L82 PathProgramCache]: Analyzing trace with hash 761747483, now seen corresponding path program 1 times [2019-12-07 11:43:36,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:36,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689125083] [2019-12-07 11:43:36,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:36,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689125083] [2019-12-07 11:43:36,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:36,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:43:36,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649708369] [2019-12-07 11:43:36,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:43:36,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:36,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:43:36,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:43:36,974 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand 5 states. [2019-12-07 11:43:37,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:37,040 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2019-12-07 11:43:37,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:43:37,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 11:43:37,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:37,041 INFO L225 Difference]: With dead ends: 137 [2019-12-07 11:43:37,041 INFO L226 Difference]: Without dead ends: 137 [2019-12-07 11:43:37,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:43:37,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-07 11:43:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2019-12-07 11:43:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 11:43:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 147 transitions. [2019-12-07 11:43:37,044 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 147 transitions. Word has length 30 [2019-12-07 11:43:37,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:37,044 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 147 transitions. [2019-12-07 11:43:37,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:43:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 147 transitions. [2019-12-07 11:43:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:43:37,044 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:37,044 INFO L410 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] [2019-12-07 11:43:37,045 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:37,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:37,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1318730648, now seen corresponding path program 1 times [2019-12-07 11:43:37,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:37,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208934723] [2019-12-07 11:43:37,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:43:37,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208934723] [2019-12-07 11:43:37,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:37,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:43:37,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009781545] [2019-12-07 11:43:37,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:43:37,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:37,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:43:37,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:43:37,065 INFO L87 Difference]: Start difference. First operand 127 states and 147 transitions. Second operand 3 states. [2019-12-07 11:43:37,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:37,103 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2019-12-07 11:43:37,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:43:37,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 11:43:37,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:37,104 INFO L225 Difference]: With dead ends: 130 [2019-12-07 11:43:37,104 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 11:43:37,105 INFO L630 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 [2019-12-07 11:43:37,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 11:43:37,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2019-12-07 11:43:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-12-07 11:43:37,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2019-12-07 11:43:37,107 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 33 [2019-12-07 11:43:37,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:37,107 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2019-12-07 11:43:37,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:43:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2019-12-07 11:43:37,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:43:37,108 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:37,108 INFO L410 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] [2019-12-07 11:43:37,108 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:37,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:37,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2069027302, now seen corresponding path program 1 times [2019-12-07 11:43:37,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:37,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327056014] [2019-12-07 11:43:37,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:37,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:43:37,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327056014] [2019-12-07 11:43:37,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:37,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:43:37,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18155281] [2019-12-07 11:43:37,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:43:37,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:37,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:43:37,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:43:37,179 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand 9 states. [2019-12-07 11:43:37,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:37,524 INFO L93 Difference]: Finished difference Result 248 states and 276 transitions. [2019-12-07 11:43:37,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:43:37,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-07 11:43:37,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:37,525 INFO L225 Difference]: With dead ends: 248 [2019-12-07 11:43:37,525 INFO L226 Difference]: Without dead ends: 248 [2019-12-07 11:43:37,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:43:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-07 11:43:37,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 143. [2019-12-07 11:43:37,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 11:43:37,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 166 transitions. [2019-12-07 11:43:37,528 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 166 transitions. Word has length 34 [2019-12-07 11:43:37,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:37,528 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 166 transitions. [2019-12-07 11:43:37,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:43:37,528 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 166 transitions. [2019-12-07 11:43:37,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:43:37,528 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:37,529 INFO L410 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] [2019-12-07 11:43:37,529 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:37,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:37,529 INFO L82 PathProgramCache]: Analyzing trace with hash 2069027303, now seen corresponding path program 1 times [2019-12-07 11:43:37,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:37,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70381018] [2019-12-07 11:43:37,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:43:37,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70381018] [2019-12-07 11:43:37,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:37,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:43:37,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416729635] [2019-12-07 11:43:37,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:43:37,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:37,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:43:37,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:43:37,624 INFO L87 Difference]: Start difference. First operand 143 states and 166 transitions. Second operand 9 states. [2019-12-07 11:43:38,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:38,017 INFO L93 Difference]: Finished difference Result 250 states and 278 transitions. [2019-12-07 11:43:38,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:43:38,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-07 11:43:38,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:38,019 INFO L225 Difference]: With dead ends: 250 [2019-12-07 11:43:38,020 INFO L226 Difference]: Without dead ends: 250 [2019-12-07 11:43:38,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:43:38,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-12-07 11:43:38,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 149. [2019-12-07 11:43:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 11:43:38,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2019-12-07 11:43:38,025 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 34 [2019-12-07 11:43:38,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:38,025 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2019-12-07 11:43:38,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:43:38,025 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2019-12-07 11:43:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:43:38,026 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:38,026 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:43:38,026 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:38,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:38,026 INFO L82 PathProgramCache]: Analyzing trace with hash 358038936, now seen corresponding path program 1 times [2019-12-07 11:43:38,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:38,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859081232] [2019-12-07 11:43:38,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:38,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:38,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859081232] [2019-12-07 11:43:38,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498832969] [2019-12-07 11:43:38,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/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 [2019-12-07 11:43:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:38,138 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 11:43:38,140 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:43:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:38,269 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:43:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:38,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [644345743] [2019-12-07 11:43:38,367 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2019-12-07 11:43:38,367 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:43:38,368 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:43:38,368 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:43:38,368 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:43:38,418 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:43:38,578 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:43:39,554 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-12-07 11:43:40,446 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:43:40,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:43:40,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 16 [2019-12-07 11:43:40,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310038493] [2019-12-07 11:43:40,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 11:43:40,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:40,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 11:43:40,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2019-12-07 11:43:40,447 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 16 states. [2019-12-07 11:43:41,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:41,209 INFO L93 Difference]: Finished difference Result 209 states and 224 transitions. [2019-12-07 11:43:41,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 11:43:41,209 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-12-07 11:43:41,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:41,210 INFO L225 Difference]: With dead ends: 209 [2019-12-07 11:43:41,210 INFO L226 Difference]: Without dead ends: 209 [2019-12-07 11:43:41,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 69 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=356, Invalid=1624, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 11:43:41,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-07 11:43:41,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 177. [2019-12-07 11:43:41,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-12-07 11:43:41,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 210 transitions. [2019-12-07 11:43:41,213 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 210 transitions. Word has length 34 [2019-12-07 11:43:41,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:41,213 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 210 transitions. [2019-12-07 11:43:41,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 11:43:41,213 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 210 transitions. [2019-12-07 11:43:41,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:43:41,213 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:41,213 INFO L410 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] [2019-12-07 11:43:41,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:43:41,414 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:41,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:41,415 INFO L82 PathProgramCache]: Analyzing trace with hash 358042558, now seen corresponding path program 1 times [2019-12-07 11:43:41,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:41,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801677886] [2019-12-07 11:43:41,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:43:41,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801677886] [2019-12-07 11:43:41,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225837741] [2019-12-07 11:43:41,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/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 [2019-12-07 11:43:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:41,503 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 11:43:41,504 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:43:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:43:41,594 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:43:41,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:43:41,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [679316120] [2019-12-07 11:43:41,652 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2019-12-07 11:43:41,653 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:43:41,653 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:43:41,653 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:43:41,653 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:43:41,702 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:43:41,844 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:43:43,440 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:43:43,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:43:43,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 5] total 8 [2019-12-07 11:43:43,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448826577] [2019-12-07 11:43:43,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:43:43,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:43,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:43:43,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2019-12-07 11:43:43,442 INFO L87 Difference]: Start difference. First operand 177 states and 210 transitions. Second operand 10 states. [2019-12-07 11:43:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:43,840 INFO L93 Difference]: Finished difference Result 249 states and 277 transitions. [2019-12-07 11:43:43,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:43:43,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-07 11:43:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:43,842 INFO L225 Difference]: With dead ends: 249 [2019-12-07 11:43:43,842 INFO L226 Difference]: Without dead ends: 211 [2019-12-07 11:43:43,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 63 SyntacticMatches, 13 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 11:43:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-12-07 11:43:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 180. [2019-12-07 11:43:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-07 11:43:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 225 transitions. [2019-12-07 11:43:43,849 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 225 transitions. Word has length 34 [2019-12-07 11:43:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:43,849 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 225 transitions. [2019-12-07 11:43:43,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:43:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 225 transitions. [2019-12-07 11:43:43,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 11:43:43,850 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:43,850 INFO L410 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] [2019-12-07 11:43:44,050 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:43:44,051 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:44,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:44,051 INFO L82 PathProgramCache]: Analyzing trace with hash -234609850, now seen corresponding path program 1 times [2019-12-07 11:43:44,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:44,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559170971] [2019-12-07 11:43:44,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:44,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:44,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559170971] [2019-12-07 11:43:44,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:44,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 11:43:44,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515029640] [2019-12-07 11:43:44,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:43:44,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:44,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:43:44,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:43:44,170 INFO L87 Difference]: Start difference. First operand 180 states and 225 transitions. Second operand 12 states. [2019-12-07 11:43:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:45,192 INFO L93 Difference]: Finished difference Result 348 states and 419 transitions. [2019-12-07 11:43:45,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 11:43:45,193 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-12-07 11:43:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:45,195 INFO L225 Difference]: With dead ends: 348 [2019-12-07 11:43:45,196 INFO L226 Difference]: Without dead ends: 342 [2019-12-07 11:43:45,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2019-12-07 11:43:45,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-12-07 11:43:45,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 153. [2019-12-07 11:43:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-07 11:43:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 195 transitions. [2019-12-07 11:43:45,202 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 195 transitions. Word has length 36 [2019-12-07 11:43:45,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:45,202 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 195 transitions. [2019-12-07 11:43:45,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:43:45,203 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 195 transitions. [2019-12-07 11:43:45,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 11:43:45,203 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:45,203 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:43:45,204 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:45,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:45,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1760488354, now seen corresponding path program 1 times [2019-12-07 11:43:45,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:45,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256375957] [2019-12-07 11:43:45,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:43:45,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256375957] [2019-12-07 11:43:45,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:43:45,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:43:45,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956504658] [2019-12-07 11:43:45,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:43:45,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:45,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:43:45,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:43:45,235 INFO L87 Difference]: Start difference. First operand 153 states and 195 transitions. Second operand 4 states. [2019-12-07 11:43:45,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:45,290 INFO L93 Difference]: Finished difference Result 163 states and 206 transitions. [2019-12-07 11:43:45,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:43:45,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-07 11:43:45,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:45,291 INFO L225 Difference]: With dead ends: 163 [2019-12-07 11:43:45,291 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 11:43:45,291 INFO L630 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 [2019-12-07 11:43:45,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 11:43:45,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2019-12-07 11:43:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 11:43:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 197 transitions. [2019-12-07 11:43:45,293 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 197 transitions. Word has length 47 [2019-12-07 11:43:45,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:45,294 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 197 transitions. [2019-12-07 11:43:45,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:43:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 197 transitions. [2019-12-07 11:43:45,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 11:43:45,294 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:45,294 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:43:45,294 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:45,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:45,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1792957757, now seen corresponding path program 1 times [2019-12-07 11:43:45,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:45,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738691740] [2019-12-07 11:43:45,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:45,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738691740] [2019-12-07 11:43:45,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922888120] [2019-12-07 11:43:45,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/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 [2019-12-07 11:43:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:45,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 11:43:45,438 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:43:45,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 11:43:45,591 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:43:45,667 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-12-07 11:43:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 11:43:45,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [437701548] [2019-12-07 11:43:45,721 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2019-12-07 11:43:45,721 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:43:45,721 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:43:45,721 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:43:45,721 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:43:45,777 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:43:45,892 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:43:45,898 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:43:45,905 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:43:45,930 WARN L213 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:43:45,933 WARN L213 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:43:46,584 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:43:47,237 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-12-07 11:43:47,666 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-12-07 11:43:49,689 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-12-07 11:43:50,296 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:43:50,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:43:50,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 23 [2019-12-07 11:43:50,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869957549] [2019-12-07 11:43:50,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 11:43:50,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:43:50,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 11:43:50,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2236, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 11:43:50,298 INFO L87 Difference]: Start difference. First operand 155 states and 197 transitions. Second operand 24 states. [2019-12-07 11:43:52,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:43:52,282 INFO L93 Difference]: Finished difference Result 244 states and 262 transitions. [2019-12-07 11:43:52,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 11:43:52,283 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2019-12-07 11:43:52,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:43:52,283 INFO L225 Difference]: With dead ends: 244 [2019-12-07 11:43:52,284 INFO L226 Difference]: Without dead ends: 241 [2019-12-07 11:43:52,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 89 SyntacticMatches, 17 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=775, Invalid=5705, Unknown=0, NotChecked=0, Total=6480 [2019-12-07 11:43:52,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-12-07 11:43:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 102. [2019-12-07 11:43:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 11:43:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2019-12-07 11:43:52,287 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 48 [2019-12-07 11:43:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:43:52,288 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2019-12-07 11:43:52,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 11:43:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2019-12-07 11:43:52,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 11:43:52,288 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:43:52,288 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:43:52,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:43:52,489 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:43:52,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:43:52,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1332196213, now seen corresponding path program 1 times [2019-12-07 11:43:52,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:43:52,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030166823] [2019-12-07 11:43:52,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:43:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:52,692 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:52,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030166823] [2019-12-07 11:43:52,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62490800] [2019-12-07 11:43:52,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/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 [2019-12-07 11:43:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:43:52,734 INFO L264 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-07 11:43:52,737 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:43:53,791 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2019-12-07 11:43:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:54,091 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:43:54,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:43:54,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1996174938] [2019-12-07 11:43:54,889 INFO L159 IcfgInterpreter]: Started Sifa with 47 locations of interest [2019-12-07 11:43:54,889 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:43:54,889 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:43:54,890 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:43:54,890 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:43:54,961 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:43:55,082 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:43:55,087 WARN L213 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:43:55,094 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:43:55,148 WARN L213 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:43:55,168 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:43:55,780 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:43:56,902 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-12-07 11:44:00,763 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:44:00,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:44:00,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 14] total 42 [2019-12-07 11:44:00,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518201749] [2019-12-07 11:44:00,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-07 11:44:00,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:44:00,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-07 11:44:00,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=4841, Unknown=0, NotChecked=0, Total=5256 [2019-12-07 11:44:00,765 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 43 states. [2019-12-07 11:44:04,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:04,743 INFO L93 Difference]: Finished difference Result 309 states and 332 transitions. [2019-12-07 11:44:04,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 11:44:04,744 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 57 [2019-12-07 11:44:04,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:04,747 INFO L225 Difference]: With dead ends: 309 [2019-12-07 11:44:04,747 INFO L226 Difference]: Without dead ends: 309 [2019-12-07 11:44:04,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 93 SyntacticMatches, 20 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=1323, Invalid=10233, Unknown=0, NotChecked=0, Total=11556 [2019-12-07 11:44:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-12-07 11:44:04,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 189. [2019-12-07 11:44:04,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-12-07 11:44:04,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 206 transitions. [2019-12-07 11:44:04,758 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 206 transitions. Word has length 57 [2019-12-07 11:44:04,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:04,758 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 206 transitions. [2019-12-07 11:44:04,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-07 11:44:04,759 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 206 transitions. [2019-12-07 11:44:04,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 11:44:04,759 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:04,760 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:44:04,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:44:04,961 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:04,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:04,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1332196212, now seen corresponding path program 1 times [2019-12-07 11:44:04,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:44:04,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595233862] [2019-12-07 11:44:04,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:44:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:04,984 ERROR L253 erpolLogProxyWrapper]: Interpolant 16 not inductive [2019-12-07 11:44:04,993 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:222) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:867) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:269) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:205) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 11:44:04,996 INFO L168 Benchmark]: Toolchain (without parser) took 37669.56 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 386.4 MB). Free memory was 935.1 MB in the beginning and 1.3 GB in the end (delta: -398.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:44:04,996 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:44:04,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -142.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:44:04,996 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:44:04,997 INFO L168 Benchmark]: Boogie Preprocessor took 24.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:44:04,997 INFO L168 Benchmark]: RCFGBuilder took 466.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:44:04,997 INFO L168 Benchmark]: TraceAbstraction took 36800.89 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 291.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -326.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:44:04,998 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -142.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 466.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36800.89 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 291.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -326.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:222) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 11:44:06,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:44:06,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:44:06,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:44:06,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:44:06,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:44:06,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:44:06,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:44:06,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:44:06,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:44:06,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:44:06,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:44:06,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:44:06,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:44:06,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:44:06,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:44:06,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:44:06,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:44:06,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:44:06,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:44:06,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:44:06,325 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:44:06,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:44:06,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:44:06,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:44:06,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:44:06,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:44:06,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:44:06,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:44:06,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:44:06,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:44:06,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:44:06,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:44:06,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:44:06,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:44:06,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:44:06,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:44:06,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:44:06,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:44:06,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:44:06,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:44:06,335 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 11:44:06,345 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:44:06,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:44:06,346 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:44:06,346 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:44:06,346 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:44:06,346 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:44:06,346 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:44:06,346 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:44:06,347 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:44:06,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:44:06,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:44:06,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:44:06,347 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:44:06,348 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 11:44:06,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:44:06,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:44:06,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:44:06,348 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 11:44:06,348 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 11:44:06,348 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 11:44:06,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:44:06,349 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:44:06,349 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 11:44:06,349 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 11:44:06,349 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:44:06,349 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:44:06,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:44:06,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:44:06,349 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:44:06,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:44:06,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:44:06,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:44:06,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:44:06,350 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 11:44:06,350 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 11:44:06,350 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:44:06,350 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:44:06,351 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20b427b12ecab1a55ea16dbf631b005753a22a0b [2019-12-07 11:44:06,512 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:44:06,521 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:44:06,523 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:44:06,524 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:44:06,524 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:44:06,525 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-01-1.i [2019-12-07 11:44:06,562 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/data/72d93b9ce/be4bf5d520914bc6b02f6ac05be9c702/FLAGc8088d2e0 [2019-12-07 11:44:07,002 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:44:07,002 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/sv-benchmarks/c/forester-heap/sll-01-1.i [2019-12-07 11:44:07,011 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/data/72d93b9ce/be4bf5d520914bc6b02f6ac05be9c702/FLAGc8088d2e0 [2019-12-07 11:44:07,343 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/data/72d93b9ce/be4bf5d520914bc6b02f6ac05be9c702 [2019-12-07 11:44:07,345 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:44:07,346 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:44:07,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:44:07,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:44:07,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:44:07,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:44:07" (1/1) ... [2019-12-07 11:44:07,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4006140a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:44:07, skipping insertion in model container [2019-12-07 11:44:07,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:44:07" (1/1) ... [2019-12-07 11:44:07,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:44:07,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:44:07,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:44:07,598 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:44:07,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:44:07,663 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:44:07,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:44:07 WrapperNode [2019-12-07 11:44:07,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:44:07,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:44:07,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:44:07,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:44:07,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:44:07" (1/1) ... [2019-12-07 11:44:07,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:44:07" (1/1) ... [2019-12-07 11:44:07,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:44:07,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:44:07,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:44:07,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:44:07,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:44:07" (1/1) ... [2019-12-07 11:44:07,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:44:07" (1/1) ... [2019-12-07 11:44:07,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:44:07" (1/1) ... [2019-12-07 11:44:07,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:44:07" (1/1) ... [2019-12-07 11:44:07,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:44:07" (1/1) ... [2019-12-07 11:44:07,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:44:07" (1/1) ... [2019-12-07 11:44:07,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:44:07" (1/1) ... [2019-12-07 11:44:07,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:44:07,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:44:07,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:44:07,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:44:07,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:44:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/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 [2019-12-07 11:44:07,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:44:07,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 11:44:07,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 11:44:07,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:44:07,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:44:07,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:44:08,282 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:44:08,282 INFO L287 CfgBuilder]: Removed 34 assume(true) statements. [2019-12-07 11:44:08,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:44:08 BoogieIcfgContainer [2019-12-07 11:44:08,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:44:08,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:44:08,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:44:08,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:44:08,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:44:07" (1/3) ... [2019-12-07 11:44:08,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47846e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:44:08, skipping insertion in model container [2019-12-07 11:44:08,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:44:07" (2/3) ... [2019-12-07 11:44:08,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47846e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:44:08, skipping insertion in model container [2019-12-07 11:44:08,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:44:08" (3/3) ... [2019-12-07 11:44:08,289 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2019-12-07 11:44:08,295 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:44:08,301 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 78 error locations. [2019-12-07 11:44:08,308 INFO L249 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2019-12-07 11:44:08,321 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:44:08,321 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 11:44:08,322 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:44:08,322 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:44:08,322 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:44:08,322 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:44:08,322 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:44:08,322 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:44:08,339 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states. [2019-12-07 11:44:08,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:44:08,344 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:08,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:44:08,345 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:08,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:08,349 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-12-07 11:44:08,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:08,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828691138] [2019-12-07 11:44:08,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/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 [2019-12-07 11:44:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:08,400 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:44:08,404 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:08,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:44:08,446 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:08,451 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:08,452 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:08,452 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 11:44:08,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:08,459 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:08,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:08,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828691138] [2019-12-07 11:44:08,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:08,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 11:44:08,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034584263] [2019-12-07 11:44:08,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:44:08,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:08,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:44:08,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:44:08,479 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 3 states. [2019-12-07 11:44:08,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:08,727 INFO L93 Difference]: Finished difference Result 186 states and 195 transitions. [2019-12-07 11:44:08,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:44:08,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 11:44:08,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:08,737 INFO L225 Difference]: With dead ends: 186 [2019-12-07 11:44:08,737 INFO L226 Difference]: Without dead ends: 182 [2019-12-07 11:44:08,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:44:08,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-12-07 11:44:08,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 177. [2019-12-07 11:44:08,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-12-07 11:44:08,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2019-12-07 11:44:08,771 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 3 [2019-12-07 11:44:08,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:08,772 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2019-12-07 11:44:08,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:44:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2019-12-07 11:44:08,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:44:08,772 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:08,772 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:44:08,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 11:44:08,974 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:08,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:08,975 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-12-07 11:44:08,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:08,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390702107] [2019-12-07 11:44:08,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/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 [2019-12-07 11:44:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:09,033 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 11:44:09,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:09,042 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:44:09,042 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:09,048 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:09,048 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:09,049 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 11:44:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:09,055 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:09,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:09,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390702107] [2019-12-07 11:44:09,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:09,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 11:44:09,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069490051] [2019-12-07 11:44:09,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:44:09,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:09,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:44:09,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:44:09,096 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand 4 states. [2019-12-07 11:44:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:09,364 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2019-12-07 11:44:09,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:44:09,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 11:44:09,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:09,366 INFO L225 Difference]: With dead ends: 207 [2019-12-07 11:44:09,367 INFO L226 Difference]: Without dead ends: 207 [2019-12-07 11:44:09,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:44:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-12-07 11:44:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 187. [2019-12-07 11:44:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-12-07 11:44:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 210 transitions. [2019-12-07 11:44:09,378 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 210 transitions. Word has length 3 [2019-12-07 11:44:09,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:09,378 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 210 transitions. [2019-12-07 11:44:09,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:44:09,378 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 210 transitions. [2019-12-07 11:44:09,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 11:44:09,378 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:09,378 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 11:44:09,579 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 11:44:09,580 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:09,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:09,581 INFO L82 PathProgramCache]: Analyzing trace with hash 28691969, now seen corresponding path program 1 times [2019-12-07 11:44:09,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:09,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019425990] [2019-12-07 11:44:09,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/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 [2019-12-07 11:44:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:09,638 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:44:09,638 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:09,643 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:09,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019425990] [2019-12-07 11:44:09,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:09,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 11:44:09,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578757727] [2019-12-07 11:44:09,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:44:09,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:09,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:44:09,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:44:09,646 INFO L87 Difference]: Start difference. First operand 187 states and 210 transitions. Second operand 3 states. [2019-12-07 11:44:09,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:09,700 INFO L93 Difference]: Finished difference Result 202 states and 213 transitions. [2019-12-07 11:44:09,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:44:09,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 11:44:09,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:09,702 INFO L225 Difference]: With dead ends: 202 [2019-12-07 11:44:09,702 INFO L226 Difference]: Without dead ends: 202 [2019-12-07 11:44:09,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:44:09,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-12-07 11:44:09,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 185. [2019-12-07 11:44:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-12-07 11:44:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2019-12-07 11:44:09,711 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 5 [2019-12-07 11:44:09,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:09,711 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2019-12-07 11:44:09,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:44:09,711 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2019-12-07 11:44:09,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:44:09,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:09,711 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:44:09,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 11:44:09,913 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:09,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:09,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2104590473, now seen corresponding path program 1 times [2019-12-07 11:44:09,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:09,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095170065] [2019-12-07 11:44:09,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/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 [2019-12-07 11:44:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:09,986 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:44:09,987 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:09,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:44:09,996 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:09,999 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:10,000 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:10,000 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 11:44:10,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:10,013 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:10,023 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:10,024 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:10,024 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-12-07 11:44:10,040 INFO L377 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 23 treesize of output 11 [2019-12-07 11:44:10,041 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:10,043 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:10,044 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:10,044 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:5 [2019-12-07 11:44:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:10,051 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:10,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095170065] [2019-12-07 11:44:10,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:10,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 11:44:10,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751100646] [2019-12-07 11:44:10,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:44:10,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:10,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:44:10,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:44:10,061 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand 5 states. [2019-12-07 11:44:10,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:10,598 INFO L93 Difference]: Finished difference Result 323 states and 353 transitions. [2019-12-07 11:44:10,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:44:10,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 11:44:10,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:10,600 INFO L225 Difference]: With dead ends: 323 [2019-12-07 11:44:10,600 INFO L226 Difference]: Without dead ends: 323 [2019-12-07 11:44:10,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:44:10,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-12-07 11:44:10,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 184. [2019-12-07 11:44:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-12-07 11:44:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2019-12-07 11:44:10,606 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 9 [2019-12-07 11:44:10,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:10,607 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2019-12-07 11:44:10,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:44:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2019-12-07 11:44:10,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:44:10,607 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:10,607 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:44:10,808 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 11:44:10,809 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:10,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:10,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2104590474, now seen corresponding path program 1 times [2019-12-07 11:44:10,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:10,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318012555] [2019-12-07 11:44:10,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/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 [2019-12-07 11:44:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:10,870 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 11:44:10,872 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:10,877 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:44:10,878 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:10,883 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:10,883 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:10,883 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 11:44:10,899 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:10,899 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:10,914 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:10,919 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:10,919 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:10,932 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:10,933 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:10,933 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2019-12-07 11:44:10,958 INFO L377 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 21 treesize of output 9 [2019-12-07 11:44:10,958 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:10,967 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:10,970 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 11:44:10,970 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:10,975 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:10,976 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:10,976 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:11 [2019-12-07 11:44:10,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:10,989 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:11,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318012555] [2019-12-07 11:44:11,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:11,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 11:44:11,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511705868] [2019-12-07 11:44:11,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:44:11,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:11,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:44:11,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:44:11,119 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand 8 states. [2019-12-07 11:44:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:12,572 INFO L93 Difference]: Finished difference Result 350 states and 393 transitions. [2019-12-07 11:44:12,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:44:12,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-12-07 11:44:12,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:12,575 INFO L225 Difference]: With dead ends: 350 [2019-12-07 11:44:12,575 INFO L226 Difference]: Without dead ends: 350 [2019-12-07 11:44:12,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:44:12,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-12-07 11:44:12,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 183. [2019-12-07 11:44:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-12-07 11:44:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 205 transitions. [2019-12-07 11:44:12,582 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 205 transitions. Word has length 9 [2019-12-07 11:44:12,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:12,582 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 205 transitions. [2019-12-07 11:44:12,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:44:12,582 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 205 transitions. [2019-12-07 11:44:12,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 11:44:12,583 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:12,583 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:44:12,783 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 11:44:12,784 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:12,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:12,784 INFO L82 PathProgramCache]: Analyzing trace with hash -347268301, now seen corresponding path program 1 times [2019-12-07 11:44:12,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:12,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590188128] [2019-12-07 11:44:12,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/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 [2019-12-07 11:44:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:12,841 INFO L264 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:44:12,843 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:12,853 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:12,853 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:12,863 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:12,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:12,867 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:12,873 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:12,873 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:12,873 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-12-07 11:44:12,887 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 11:44:12,888 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:12,894 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:12,896 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 11:44:12,896 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:12,899 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:12,900 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:12,900 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2019-12-07 11:44:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:12,915 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:12,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:12,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590188128] [2019-12-07 11:44:12,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:12,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 11:44:12,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532631019] [2019-12-07 11:44:12,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:44:12,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:12,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:44:12,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:44:12,921 INFO L87 Difference]: Start difference. First operand 183 states and 205 transitions. Second operand 5 states. [2019-12-07 11:44:13,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:13,178 INFO L93 Difference]: Finished difference Result 275 states and 302 transitions. [2019-12-07 11:44:13,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:44:13,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 11:44:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:13,180 INFO L225 Difference]: With dead ends: 275 [2019-12-07 11:44:13,180 INFO L226 Difference]: Without dead ends: 275 [2019-12-07 11:44:13,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:44:13,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-12-07 11:44:13,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 186. [2019-12-07 11:44:13,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-12-07 11:44:13,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2019-12-07 11:44:13,183 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 12 [2019-12-07 11:44:13,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:13,183 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2019-12-07 11:44:13,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:44:13,183 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2019-12-07 11:44:13,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 11:44:13,184 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:13,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:44:13,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 11:44:13,385 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:13,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:13,385 INFO L82 PathProgramCache]: Analyzing trace with hash -77794907, now seen corresponding path program 1 times [2019-12-07 11:44:13,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:13,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873149293] [2019-12-07 11:44:13,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/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 [2019-12-07 11:44:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:13,447 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 11:44:13,448 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:13,451 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:44:13,451 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:13,453 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:13,453 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:13,454 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 11:44:13,475 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:13,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-12-07 11:44:13,477 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:13,494 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 11:44:13,494 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:13,494 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 11:44:13,507 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:13,508 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:13,518 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:13,519 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:13,519 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2019-12-07 11:44:13,581 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:13,581 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 61 [2019-12-07 11:44:13,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:13,583 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:13,606 INFO L614 ElimStorePlain]: treesize reduction 26, result has 62.9 percent of original size [2019-12-07 11:44:13,607 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:44:13,607 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:44 [2019-12-07 11:44:13,653 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:13,654 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 35 [2019-12-07 11:44:13,655 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:13,668 INFO L614 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-12-07 11:44:13,669 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:44:13,669 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:53, output treesize:17 [2019-12-07 11:44:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:13,687 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:13,793 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:13,813 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:13,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:13,814 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 11:44:13,814 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:20 [2019-12-07 11:44:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:13,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873149293] [2019-12-07 11:44:13,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:13,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-12-07 11:44:13,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491333811] [2019-12-07 11:44:13,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 11:44:13,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:13,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 11:44:13,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:44:13,861 INFO L87 Difference]: Start difference. First operand 186 states and 208 transitions. Second operand 14 states. [2019-12-07 11:44:15,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:15,529 INFO L93 Difference]: Finished difference Result 322 states and 350 transitions. [2019-12-07 11:44:15,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:44:15,530 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 12 [2019-12-07 11:44:15,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:15,531 INFO L225 Difference]: With dead ends: 322 [2019-12-07 11:44:15,531 INFO L226 Difference]: Without dead ends: 322 [2019-12-07 11:44:15,532 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:44:15,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-12-07 11:44:15,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 185. [2019-12-07 11:44:15,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-12-07 11:44:15,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2019-12-07 11:44:15,535 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 12 [2019-12-07 11:44:15,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:15,535 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2019-12-07 11:44:15,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 11:44:15,535 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2019-12-07 11:44:15,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 11:44:15,536 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:15,536 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:44:15,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 11:44:15,737 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:15,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:15,737 INFO L82 PathProgramCache]: Analyzing trace with hash -77794906, now seen corresponding path program 1 times [2019-12-07 11:44:15,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:15,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773535713] [2019-12-07 11:44:15,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 11:44:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:15,811 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 11:44:15,812 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:15,815 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:44:15,815 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:15,816 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:15,816 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:15,817 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 11:44:15,821 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_76|], 1=[|v_#valid_89|]} [2019-12-07 11:44:15,824 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:44:15,824 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:15,832 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:15,839 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:15,839 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 11:44:15,839 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:15,846 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:15,846 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:15,846 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-12-07 11:44:15,864 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:15,864 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:15,877 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:15,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:15,881 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:15,891 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:15,892 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:15,892 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-12-07 11:44:15,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-12-07 11:44:15,932 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:15,948 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:15,972 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:15,972 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 66 [2019-12-07 11:44:15,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:15,974 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:16,003 INFO L614 ElimStorePlain]: treesize reduction 26, result has 69.4 percent of original size [2019-12-07 11:44:16,004 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:44:16,004 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:59 [2019-12-07 11:44:16,054 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:16,055 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 40 [2019-12-07 11:44:16,055 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:16,085 INFO L614 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-12-07 11:44:16,087 INFO L377 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 26 treesize of output 10 [2019-12-07 11:44:16,088 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:16,093 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:16,094 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:16,094 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:75, output treesize:9 [2019-12-07 11:44:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:16,111 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:16,884 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:17,005 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-12-07 11:44:17,006 INFO L614 ElimStorePlain]: treesize reduction 12, result has 88.6 percent of original size [2019-12-07 11:44:17,011 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:17,094 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:17,099 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:17,264 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-12-07 11:44:17,264 INFO L614 ElimStorePlain]: treesize reduction 56, result has 48.1 percent of original size [2019-12-07 11:44:17,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:17,265 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 11:44:17,266 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:151, output treesize:29 [2019-12-07 11:44:17,378 INFO L377 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 14 treesize of output 12 [2019-12-07 11:44:17,379 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:17,382 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:17,382 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:17,382 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-12-07 11:44:17,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:17,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773535713] [2019-12-07 11:44:17,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:17,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-12-07 11:44:17,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993423439] [2019-12-07 11:44:17,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 11:44:17,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:17,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 11:44:17,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:44:17,407 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand 14 states. [2019-12-07 11:44:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:20,087 INFO L93 Difference]: Finished difference Result 323 states and 351 transitions. [2019-12-07 11:44:20,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:44:20,088 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 12 [2019-12-07 11:44:20,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:20,089 INFO L225 Difference]: With dead ends: 323 [2019-12-07 11:44:20,089 INFO L226 Difference]: Without dead ends: 323 [2019-12-07 11:44:20,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-12-07 11:44:20,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-12-07 11:44:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 184. [2019-12-07 11:44:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-12-07 11:44:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2019-12-07 11:44:20,093 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 12 [2019-12-07 11:44:20,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:20,093 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2019-12-07 11:44:20,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 11:44:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2019-12-07 11:44:20,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:44:20,094 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:20,094 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:44:20,294 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 11:44:20,295 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:20,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:20,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1284247704, now seen corresponding path program 1 times [2019-12-07 11:44:20,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:20,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207465823] [2019-12-07 11:44:20,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 11:44:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:20,328 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:44:20,329 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:20,334 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:20,334 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:20,343 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:20,346 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:20,347 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:20,354 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:20,354 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:20,354 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-12-07 11:44:20,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 11:44:20,368 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:20,377 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:20,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 11:44:20,379 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:20,382 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:20,382 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:20,382 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2019-12-07 11:44:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:20,394 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:20,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:20,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207465823] [2019-12-07 11:44:20,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:20,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 11:44:20,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198587543] [2019-12-07 11:44:20,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:44:20,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:20,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:44:20,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:44:20,399 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand 5 states. [2019-12-07 11:44:20,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:20,677 INFO L93 Difference]: Finished difference Result 272 states and 299 transitions. [2019-12-07 11:44:20,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:44:20,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 11:44:20,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:20,679 INFO L225 Difference]: With dead ends: 272 [2019-12-07 11:44:20,679 INFO L226 Difference]: Without dead ends: 272 [2019-12-07 11:44:20,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:44:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-07 11:44:20,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 187. [2019-12-07 11:44:20,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-12-07 11:44:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 209 transitions. [2019-12-07 11:44:20,682 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 209 transitions. Word has length 14 [2019-12-07 11:44:20,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:20,683 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 209 transitions. [2019-12-07 11:44:20,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:44:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 209 transitions. [2019-12-07 11:44:20,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 11:44:20,683 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:20,683 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:44:20,884 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 11:44:20,884 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:20,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:20,885 INFO L82 PathProgramCache]: Analyzing trace with hash -541339560, now seen corresponding path program 1 times [2019-12-07 11:44:20,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:20,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522452478] [2019-12-07 11:44:20,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/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 [2019-12-07 11:44:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:20,941 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 11:44:20,941 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:20,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:44:20,944 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:20,945 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:20,945 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:20,945 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 11:44:20,963 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:20,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-12-07 11:44:20,963 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:20,974 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 11:44:20,974 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:44:20,974 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-07 11:44:20,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:20,979 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:20,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522452478] [2019-12-07 11:44:20,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:20,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 11:44:20,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172251720] [2019-12-07 11:44:20,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:44:20,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:20,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:44:20,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:44:20,989 INFO L87 Difference]: Start difference. First operand 187 states and 209 transitions. Second operand 4 states. [2019-12-07 11:44:21,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:21,216 INFO L93 Difference]: Finished difference Result 183 states and 203 transitions. [2019-12-07 11:44:21,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:44:21,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 11:44:21,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:21,217 INFO L225 Difference]: With dead ends: 183 [2019-12-07 11:44:21,217 INFO L226 Difference]: Without dead ends: 183 [2019-12-07 11:44:21,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:44:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-12-07 11:44:21,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2019-12-07 11:44:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-12-07 11:44:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 200 transitions. [2019-12-07 11:44:21,220 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 200 transitions. Word has length 17 [2019-12-07 11:44:21,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:21,220 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 200 transitions. [2019-12-07 11:44:21,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:44:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 200 transitions. [2019-12-07 11:44:21,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 11:44:21,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:21,221 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:44:21,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 11:44:21,422 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:21,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:21,422 INFO L82 PathProgramCache]: Analyzing trace with hash -541339559, now seen corresponding path program 1 times [2019-12-07 11:44:21,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:21,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055115547] [2019-12-07 11:44:21,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 11:44:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:21,490 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 11:44:21,491 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:21,498 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:44:21,498 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:21,505 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:21,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:44:21,508 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:21,514 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:21,514 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:21,514 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 11:44:21,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:44:21,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 11:44:21,541 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:21,551 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:21,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:21,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 11:44:21,559 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:21,567 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:21,568 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:44:21,568 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-12-07 11:44:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:21,586 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:21,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:21,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055115547] [2019-12-07 11:44:21,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:21,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 11:44:21,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918308765] [2019-12-07 11:44:21,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:44:21,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:21,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:44:21,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:44:21,802 INFO L87 Difference]: Start difference. First operand 178 states and 200 transitions. Second operand 8 states. [2019-12-07 11:44:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:23,227 INFO L93 Difference]: Finished difference Result 232 states and 247 transitions. [2019-12-07 11:44:23,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:44:23,228 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-07 11:44:23,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:23,229 INFO L225 Difference]: With dead ends: 232 [2019-12-07 11:44:23,229 INFO L226 Difference]: Without dead ends: 232 [2019-12-07 11:44:23,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:44:23,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-12-07 11:44:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 192. [2019-12-07 11:44:23,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-12-07 11:44:23,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 225 transitions. [2019-12-07 11:44:23,232 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 225 transitions. Word has length 17 [2019-12-07 11:44:23,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:23,232 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 225 transitions. [2019-12-07 11:44:23,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:44:23,232 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 225 transitions. [2019-12-07 11:44:23,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:44:23,233 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:23,233 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:44:23,433 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 11:44:23,434 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:23,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:23,434 INFO L82 PathProgramCache]: Analyzing trace with hash -536227517, now seen corresponding path program 1 times [2019-12-07 11:44:23,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:23,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838795346] [2019-12-07 11:44:23,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 11:44:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:23,470 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:44:23,471 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:23,477 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:23,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838795346] [2019-12-07 11:44:23,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:23,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 11:44:23,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388438525] [2019-12-07 11:44:23,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:44:23,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:23,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:44:23,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:44:23,480 INFO L87 Difference]: Start difference. First operand 192 states and 225 transitions. Second operand 4 states. [2019-12-07 11:44:23,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:23,649 INFO L93 Difference]: Finished difference Result 225 states and 239 transitions. [2019-12-07 11:44:23,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:44:23,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 11:44:23,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:23,650 INFO L225 Difference]: With dead ends: 225 [2019-12-07 11:44:23,650 INFO L226 Difference]: Without dead ends: 225 [2019-12-07 11:44:23,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:44:23,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-12-07 11:44:23,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 190. [2019-12-07 11:44:23,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-12-07 11:44:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 222 transitions. [2019-12-07 11:44:23,653 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 222 transitions. Word has length 19 [2019-12-07 11:44:23,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:23,653 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 222 transitions. [2019-12-07 11:44:23,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:44:23,654 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 222 transitions. [2019-12-07 11:44:23,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 11:44:23,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:23,654 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:44:23,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 11:44:23,855 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:23,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:23,855 INFO L82 PathProgramCache]: Analyzing trace with hash 555428169, now seen corresponding path program 1 times [2019-12-07 11:44:23,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:23,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240249621] [2019-12-07 11:44:23,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 11:44:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:23,892 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 11:44:23,893 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:23,898 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:44:23,898 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:23,900 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:23,901 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:23,901 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 11:44:23,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:44:23,908 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:23,913 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:23,913 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:23,913 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 [2019-12-07 11:44:23,920 INFO L377 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 17 treesize of output 9 [2019-12-07 11:44:23,920 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:23,922 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:23,922 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:23,922 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-12-07 11:44:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:23,935 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:23,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240249621] [2019-12-07 11:44:23,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:23,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 11:44:23,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526582574] [2019-12-07 11:44:23,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:44:23,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:23,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:44:23,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:44:23,942 INFO L87 Difference]: Start difference. First operand 190 states and 222 transitions. Second operand 6 states. [2019-12-07 11:44:24,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:24,430 INFO L93 Difference]: Finished difference Result 280 states and 329 transitions. [2019-12-07 11:44:24,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:44:24,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-07 11:44:24,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:24,432 INFO L225 Difference]: With dead ends: 280 [2019-12-07 11:44:24,432 INFO L226 Difference]: Without dead ends: 280 [2019-12-07 11:44:24,432 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:44:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-12-07 11:44:24,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 189. [2019-12-07 11:44:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-12-07 11:44:24,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 221 transitions. [2019-12-07 11:44:24,437 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 221 transitions. Word has length 20 [2019-12-07 11:44:24,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:24,437 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 221 transitions. [2019-12-07 11:44:24,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:44:24,438 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 221 transitions. [2019-12-07 11:44:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 11:44:24,438 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:24,438 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:44:24,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 11:44:24,639 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:24,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:24,639 INFO L82 PathProgramCache]: Analyzing trace with hash 555428170, now seen corresponding path program 1 times [2019-12-07 11:44:24,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:24,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411545454] [2019-12-07 11:44:24,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 11:44:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:24,684 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 11:44:24,685 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:24,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:44:24,688 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:24,693 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:24,693 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:24,693 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 11:44:24,703 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:44:24,703 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:24,713 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:24,716 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:44:24,716 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:24,723 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:24,723 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:24,724 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2019-12-07 11:44:24,736 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-12-07 11:44:24,736 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:24,743 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:24,745 INFO L377 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 [2019-12-07 11:44:24,745 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:24,749 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:24,749 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:24,749 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2019-12-07 11:44:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:24,766 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:24,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411545454] [2019-12-07 11:44:24,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:24,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 11:44:24,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880979988] [2019-12-07 11:44:24,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:44:24,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:24,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:44:24,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:44:24,937 INFO L87 Difference]: Start difference. First operand 189 states and 221 transitions. Second operand 10 states. [2019-12-07 11:44:26,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:26,508 INFO L93 Difference]: Finished difference Result 303 states and 363 transitions. [2019-12-07 11:44:26,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:44:26,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-07 11:44:26,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:26,510 INFO L225 Difference]: With dead ends: 303 [2019-12-07 11:44:26,510 INFO L226 Difference]: Without dead ends: 303 [2019-12-07 11:44:26,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:44:26,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-12-07 11:44:26,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 182. [2019-12-07 11:44:26,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-12-07 11:44:26,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 214 transitions. [2019-12-07 11:44:26,515 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 214 transitions. Word has length 20 [2019-12-07 11:44:26,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:26,515 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 214 transitions. [2019-12-07 11:44:26,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:44:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 214 transitions. [2019-12-07 11:44:26,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 11:44:26,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:26,516 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:44:26,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 11:44:26,717 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:26,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:26,717 INFO L82 PathProgramCache]: Analyzing trace with hash -504086415, now seen corresponding path program 1 times [2019-12-07 11:44:26,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:26,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235636992] [2019-12-07 11:44:26,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 11:44:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:26,786 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 11:44:26,788 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:26,921 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 11:44:26,922 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:26,939 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:26,942 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 11:44:26,942 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:26,949 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:26,949 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:26,949 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2019-12-07 11:44:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:26,981 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:26,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:27,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:27,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235636992] [2019-12-07 11:44:27,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:27,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-12-07 11:44:27,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107921405] [2019-12-07 11:44:27,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:44:27,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:27,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:44:27,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:44:27,031 INFO L87 Difference]: Start difference. First operand 182 states and 214 transitions. Second operand 9 states. [2019-12-07 11:44:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:27,632 INFO L93 Difference]: Finished difference Result 276 states and 325 transitions. [2019-12-07 11:44:27,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:44:27,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-12-07 11:44:27,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:27,633 INFO L225 Difference]: With dead ends: 276 [2019-12-07 11:44:27,633 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 11:44:27,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:44:27,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 11:44:27,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 177. [2019-12-07 11:44:27,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-12-07 11:44:27,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 209 transitions. [2019-12-07 11:44:27,636 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 209 transitions. Word has length 20 [2019-12-07 11:44:27,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:27,637 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 209 transitions. [2019-12-07 11:44:27,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:44:27,637 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 209 transitions. [2019-12-07 11:44:27,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:44:27,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:27,637 INFO L410 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] [2019-12-07 11:44:27,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 11:44:27,838 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:27,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:27,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1190528137, now seen corresponding path program 1 times [2019-12-07 11:44:27,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:27,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430155192] [2019-12-07 11:44:27,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 11:44:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:27,910 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 11:44:27,911 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:27,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:44:27,918 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:27,924 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:27,924 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:27,925 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-12-07 11:44:27,932 INFO L377 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 16 treesize of output 8 [2019-12-07 11:44:27,933 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:27,935 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:27,936 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:27,936 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-12-07 11:44:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:27,948 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:27,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:27,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430155192] [2019-12-07 11:44:27,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:27,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-12-07 11:44:27,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328996981] [2019-12-07 11:44:27,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:44:27,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:27,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:44:27,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:44:27,951 INFO L87 Difference]: Start difference. First operand 177 states and 209 transitions. Second operand 6 states. [2019-12-07 11:44:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:28,221 INFO L93 Difference]: Finished difference Result 294 states and 354 transitions. [2019-12-07 11:44:28,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:44:28,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 11:44:28,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:28,222 INFO L225 Difference]: With dead ends: 294 [2019-12-07 11:44:28,222 INFO L226 Difference]: Without dead ends: 294 [2019-12-07 11:44:28,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:44:28,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-07 11:44:28,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 173. [2019-12-07 11:44:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-12-07 11:44:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 205 transitions. [2019-12-07 11:44:28,225 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 205 transitions. Word has length 22 [2019-12-07 11:44:28,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:28,225 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 205 transitions. [2019-12-07 11:44:28,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:44:28,225 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 205 transitions. [2019-12-07 11:44:28,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:44:28,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:28,226 INFO L410 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] [2019-12-07 11:44:28,426 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 11:44:28,427 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:28,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:28,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1564444111, now seen corresponding path program 1 times [2019-12-07 11:44:28,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:28,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258616823] [2019-12-07 11:44:28,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 11:44:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:28,484 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:44:28,485 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:28,490 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:28,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:28,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258616823] [2019-12-07 11:44:28,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:28,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 11:44:28,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698884301] [2019-12-07 11:44:28,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:44:28,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:28,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:44:28,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:44:28,495 INFO L87 Difference]: Start difference. First operand 173 states and 205 transitions. Second operand 4 states. [2019-12-07 11:44:28,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:28,508 INFO L93 Difference]: Finished difference Result 284 states and 344 transitions. [2019-12-07 11:44:28,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:44:28,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 11:44:28,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:28,510 INFO L225 Difference]: With dead ends: 284 [2019-12-07 11:44:28,510 INFO L226 Difference]: Without dead ends: 284 [2019-12-07 11:44:28,510 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:44:28,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-12-07 11:44:28,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 201. [2019-12-07 11:44:28,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-12-07 11:44:28,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 255 transitions. [2019-12-07 11:44:28,513 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 255 transitions. Word has length 25 [2019-12-07 11:44:28,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:28,513 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 255 transitions. [2019-12-07 11:44:28,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:44:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 255 transitions. [2019-12-07 11:44:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:44:28,514 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:28,514 INFO L410 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] [2019-12-07 11:44:28,714 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 11:44:28,715 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:28,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:28,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1253115807, now seen corresponding path program 1 times [2019-12-07 11:44:28,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:28,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087558289] [2019-12-07 11:44:28,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 11:44:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:28,786 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 11:44:28,787 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:28,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:28,793 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:28,802 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:28,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:28,805 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:28,813 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:28,813 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:28,813 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-12-07 11:44:28,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 11:44:28,842 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:28,851 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:28,853 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 11:44:28,853 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:28,858 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:28,858 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:28,858 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2019-12-07 11:44:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:28,881 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:28,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087558289] [2019-12-07 11:44:28,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:28,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-12-07 11:44:28,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920312407] [2019-12-07 11:44:28,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:44:28,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:28,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:44:28,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:44:28,887 INFO L87 Difference]: Start difference. First operand 201 states and 255 transitions. Second operand 6 states. [2019-12-07 11:44:29,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:29,398 INFO L93 Difference]: Finished difference Result 317 states and 389 transitions. [2019-12-07 11:44:29,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:44:29,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 11:44:29,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:29,400 INFO L225 Difference]: With dead ends: 317 [2019-12-07 11:44:29,401 INFO L226 Difference]: Without dead ends: 317 [2019-12-07 11:44:29,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:44:29,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-12-07 11:44:29,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 214. [2019-12-07 11:44:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-12-07 11:44:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 269 transitions. [2019-12-07 11:44:29,406 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 269 transitions. Word has length 26 [2019-12-07 11:44:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:29,406 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 269 transitions. [2019-12-07 11:44:29,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:44:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 269 transitions. [2019-12-07 11:44:29,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:44:29,407 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:29,407 INFO L410 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] [2019-12-07 11:44:29,608 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 11:44:29,608 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:29,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:29,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1868973579, now seen corresponding path program 1 times [2019-12-07 11:44:29,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:29,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254235787] [2019-12-07 11:44:29,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 11:44:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:29,654 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:44:29,654 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:29,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:44:29,660 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:29,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:29,661 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:29,661 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 11:44:29,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:29,666 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:29,672 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:29,673 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:29,673 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2019-12-07 11:44:29,682 INFO L377 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 23 treesize of output 11 [2019-12-07 11:44:29,682 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:29,683 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:29,683 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:29,683 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:5 [2019-12-07 11:44:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:29,689 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:29,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254235787] [2019-12-07 11:44:29,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:29,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 11:44:29,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432071067] [2019-12-07 11:44:29,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:44:29,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:29,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:44:29,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:44:29,693 INFO L87 Difference]: Start difference. First operand 214 states and 269 transitions. Second operand 5 states. [2019-12-07 11:44:30,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:30,121 INFO L93 Difference]: Finished difference Result 350 states and 446 transitions. [2019-12-07 11:44:30,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:44:30,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 11:44:30,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:30,123 INFO L225 Difference]: With dead ends: 350 [2019-12-07 11:44:30,123 INFO L226 Difference]: Without dead ends: 350 [2019-12-07 11:44:30,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:44:30,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-12-07 11:44:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 213. [2019-12-07 11:44:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-12-07 11:44:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 268 transitions. [2019-12-07 11:44:30,127 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 268 transitions. Word has length 28 [2019-12-07 11:44:30,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:30,127 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 268 transitions. [2019-12-07 11:44:30,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:44:30,127 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 268 transitions. [2019-12-07 11:44:30,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:44:30,128 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:30,128 INFO L410 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] [2019-12-07 11:44:30,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 11:44:30,329 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:30,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:30,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1868973578, now seen corresponding path program 1 times [2019-12-07 11:44:30,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:30,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858205125] [2019-12-07 11:44:30,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 11:44:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:30,385 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 11:44:30,386 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:30,389 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:44:30,390 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:30,393 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:30,393 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:30,393 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 11:44:30,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:30,402 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:30,413 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:30,417 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:30,417 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:30,425 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:30,425 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:30,426 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-12-07 11:44:30,441 INFO L377 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 23 treesize of output 11 [2019-12-07 11:44:30,441 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:30,449 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:30,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 11:44:30,451 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:30,454 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:30,454 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:30,454 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-12-07 11:44:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:30,464 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:30,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858205125] [2019-12-07 11:44:30,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:30,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 11:44:30,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645705614] [2019-12-07 11:44:30,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:44:30,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:30,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:44:30,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:44:30,592 INFO L87 Difference]: Start difference. First operand 213 states and 268 transitions. Second operand 8 states. [2019-12-07 11:44:31,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:31,853 INFO L93 Difference]: Finished difference Result 377 states and 484 transitions. [2019-12-07 11:44:31,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:44:31,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-12-07 11:44:31,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:31,855 INFO L225 Difference]: With dead ends: 377 [2019-12-07 11:44:31,855 INFO L226 Difference]: Without dead ends: 377 [2019-12-07 11:44:31,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:44:31,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-12-07 11:44:31,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 212. [2019-12-07 11:44:31,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-12-07 11:44:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 267 transitions. [2019-12-07 11:44:31,859 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 267 transitions. Word has length 28 [2019-12-07 11:44:31,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:31,859 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 267 transitions. [2019-12-07 11:44:31,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:44:31,859 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 267 transitions. [2019-12-07 11:44:31,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:44:31,859 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:31,859 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:44:32,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 11:44:32,060 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:32,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:32,061 INFO L82 PathProgramCache]: Analyzing trace with hash 187155639, now seen corresponding path program 1 times [2019-12-07 11:44:32,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:32,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766354857] [2019-12-07 11:44:32,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 11:44:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:32,106 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 11:44:32,106 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:32,110 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:44:32,110 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,116 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:32,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:44:32,117 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,126 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:32,126 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,126 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-12-07 11:44:32,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:44:32,137 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 11:44:32,137 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,149 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:32,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:44:32,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 11:44:32,153 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,163 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:32,163 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,163 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2019-12-07 11:44:32,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:44:32,202 INFO L377 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 24 treesize of output 10 [2019-12-07 11:44:32,203 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,211 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:32,213 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 11:44:32,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-12-07 11:44:32,214 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,217 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:32,217 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,217 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-12-07 11:44:32,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:32,239 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:32,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:32,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766354857] [2019-12-07 11:44:32,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [788909904] [2019-12-07 11:44:32,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:44:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:32,341 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 11:44:32,342 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:32,356 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:44:32,357 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,364 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:32,366 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:44:32,366 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,371 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:32,371 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,371 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-12-07 11:44:32,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:44:32,395 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 11:44:32,395 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,407 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:32,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:44:32,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 11:44:32,410 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,419 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:32,419 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,419 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-12-07 11:44:32,482 INFO L377 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 22 treesize of output 10 [2019-12-07 11:44:32,483 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,491 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:32,493 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:32,493 INFO L377 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 22 treesize of output 10 [2019-12-07 11:44:32,494 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,497 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:32,497 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,497 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-12-07 11:44:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:32,503 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:32,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997457788] [2019-12-07 11:44:32,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:44:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:32,567 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 11:44:32,569 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:32,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:44:32,573 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,580 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:32,582 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:44:32,582 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,586 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:32,587 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,587 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-12-07 11:44:32,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:44:32,594 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 11:44:32,594 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,607 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:32,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:44:32,611 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 11:44:32,611 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,620 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:32,620 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,620 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2019-12-07 11:44:32,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:44:32,627 INFO L377 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 24 treesize of output 10 [2019-12-07 11:44:32,627 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,636 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:32,638 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 11:44:32,638 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-12-07 11:44:32,639 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,641 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:32,641 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:32,642 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-12-07 11:44:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:32,645 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:32,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:32,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 11:44:32,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8, 6, 7, 6] total 12 [2019-12-07 11:44:32,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217865774] [2019-12-07 11:44:32,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:44:32,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:32,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:44:32,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:44:32,653 INFO L87 Difference]: Start difference. First operand 212 states and 267 transitions. Second operand 12 states. [2019-12-07 11:44:33,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:33,634 INFO L93 Difference]: Finished difference Result 363 states and 427 transitions. [2019-12-07 11:44:33,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 11:44:33,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-12-07 11:44:33,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:33,636 INFO L225 Difference]: With dead ends: 363 [2019-12-07 11:44:33,636 INFO L226 Difference]: Without dead ends: 363 [2019-12-07 11:44:33,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 155 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2019-12-07 11:44:33,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-07 11:44:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 250. [2019-12-07 11:44:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 11:44:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 329 transitions. [2019-12-07 11:44:33,640 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 329 transitions. Word has length 29 [2019-12-07 11:44:33,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:33,640 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 329 transitions. [2019-12-07 11:44:33,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:44:33,640 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 329 transitions. [2019-12-07 11:44:33,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 11:44:33,641 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:33,641 INFO L410 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] [2019-12-07 11:44:34,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:44:34,242 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:34,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:34,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2107438675, now seen corresponding path program 1 times [2019-12-07 11:44:34,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:34,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889313727] [2019-12-07 11:44:34,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 11:44:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:34,313 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:44:34,314 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:34,319 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:34,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889313727] [2019-12-07 11:44:34,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:34,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 11:44:34,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543910201] [2019-12-07 11:44:34,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:44:34,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:34,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:44:34,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:44:34,321 INFO L87 Difference]: Start difference. First operand 250 states and 329 transitions. Second operand 3 states. [2019-12-07 11:44:34,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:34,347 INFO L93 Difference]: Finished difference Result 248 states and 322 transitions. [2019-12-07 11:44:34,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:44:34,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 11:44:34,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:34,348 INFO L225 Difference]: With dead ends: 248 [2019-12-07 11:44:34,348 INFO L226 Difference]: Without dead ends: 248 [2019-12-07 11:44:34,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:44:34,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-07 11:44:34,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-12-07 11:44:34,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-12-07 11:44:34,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 322 transitions. [2019-12-07 11:44:34,352 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 322 transitions. Word has length 30 [2019-12-07 11:44:34,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:34,353 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 322 transitions. [2019-12-07 11:44:34,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:44:34,353 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 322 transitions. [2019-12-07 11:44:34,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 11:44:34,353 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:34,353 INFO L410 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] [2019-12-07 11:44:34,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-12-07 11:44:34,554 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:34,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:34,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1094782135, now seen corresponding path program 1 times [2019-12-07 11:44:34,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:34,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104079287] [2019-12-07 11:44:34,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-12-07 11:44:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:34,613 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:44:34,614 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:34,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:34,620 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:34,627 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:34,630 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:34,630 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:34,635 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:34,635 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:34,636 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-12-07 11:44:34,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 11:44:34,647 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:34,653 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:34,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 11:44:34,655 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:34,658 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:34,658 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:34,658 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2019-12-07 11:44:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:34,668 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:34,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:34,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104079287] [2019-12-07 11:44:34,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:34,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 11:44:34,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135049434] [2019-12-07 11:44:34,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:44:34,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:34,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:44:34,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:44:34,671 INFO L87 Difference]: Start difference. First operand 248 states and 322 transitions. Second operand 5 states. [2019-12-07 11:44:34,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:34,890 INFO L93 Difference]: Finished difference Result 262 states and 337 transitions. [2019-12-07 11:44:34,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:44:34,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 11:44:34,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:34,892 INFO L225 Difference]: With dead ends: 262 [2019-12-07 11:44:34,892 INFO L226 Difference]: Without dead ends: 262 [2019-12-07 11:44:34,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:44:34,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-12-07 11:44:34,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 251. [2019-12-07 11:44:34,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-12-07 11:44:34,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 325 transitions. [2019-12-07 11:44:34,895 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 325 transitions. Word has length 31 [2019-12-07 11:44:34,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:34,896 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 325 transitions. [2019-12-07 11:44:34,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:44:34,896 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 325 transitions. [2019-12-07 11:44:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 11:44:34,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:34,896 INFO L410 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] [2019-12-07 11:44:35,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-12-07 11:44:35,097 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:35,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:35,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1364255529, now seen corresponding path program 1 times [2019-12-07 11:44:35,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:35,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885089733] [2019-12-07 11:44:35,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-12-07 11:44:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:35,199 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 11:44:35,199 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:35,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:44:35,202 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:35,204 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:35,204 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:35,204 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 11:44:35,208 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:44:35,209 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:35,213 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:35,213 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:35,213 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 [2019-12-07 11:44:35,219 INFO L377 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 17 treesize of output 9 [2019-12-07 11:44:35,219 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:35,220 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:35,220 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:35,220 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-12-07 11:44:35,243 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:35,243 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-12-07 11:44:35,244 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:35,257 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 11:44:35,257 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:35,257 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 11:44:35,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:35,271 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:35,282 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:35,283 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:35,283 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:31 [2019-12-07 11:44:35,359 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:35,359 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 61 [2019-12-07 11:44:35,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:35,360 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:35,384 INFO L614 ElimStorePlain]: treesize reduction 26, result has 62.9 percent of original size [2019-12-07 11:44:35,384 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:44:35,385 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:44 [2019-12-07 11:44:35,431 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:35,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 35 [2019-12-07 11:44:35,432 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:35,444 INFO L614 ElimStorePlain]: treesize reduction 14, result has 57.6 percent of original size [2019-12-07 11:44:35,444 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:44:35,444 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:53, output treesize:19 [2019-12-07 11:44:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:35,465 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:35,603 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:35,621 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:35,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:35,622 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 11:44:35,622 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:24 [2019-12-07 11:44:35,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:35,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885089733] [2019-12-07 11:44:35,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:35,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2019-12-07 11:44:35,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353947823] [2019-12-07 11:44:35,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 11:44:35,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:35,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 11:44:35,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:44:35,746 INFO L87 Difference]: Start difference. First operand 251 states and 325 transitions. Second operand 20 states. [2019-12-07 11:44:37,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:37,828 INFO L93 Difference]: Finished difference Result 306 states and 373 transitions. [2019-12-07 11:44:37,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 11:44:37,828 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-12-07 11:44:37,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:37,829 INFO L225 Difference]: With dead ends: 306 [2019-12-07 11:44:37,829 INFO L226 Difference]: Without dead ends: 306 [2019-12-07 11:44:37,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=266, Invalid=856, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 11:44:37,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-12-07 11:44:37,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 250. [2019-12-07 11:44:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 11:44:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 324 transitions. [2019-12-07 11:44:37,834 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 324 transitions. Word has length 31 [2019-12-07 11:44:37,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:37,835 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 324 transitions. [2019-12-07 11:44:37,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 11:44:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 324 transitions. [2019-12-07 11:44:37,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 11:44:37,835 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:37,835 INFO L410 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] [2019-12-07 11:44:38,036 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-12-07 11:44:38,036 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:38,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:38,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1364255530, now seen corresponding path program 1 times [2019-12-07 11:44:38,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:38,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399514661] [2019-12-07 11:44:38,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-12-07 11:44:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:38,103 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 11:44:38,104 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:38,106 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:44:38,107 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:38,108 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:38,108 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:38,108 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 11:44:38,113 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:44:38,113 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:38,117 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:38,117 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:38,117 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 [2019-12-07 11:44:38,123 INFO L377 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 17 treesize of output 9 [2019-12-07 11:44:38,123 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:38,124 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:38,125 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:38,125 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-12-07 11:44:38,135 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_95|], 1=[|v_#valid_113|]} [2019-12-07 11:44:38,138 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:44:38,138 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:38,144 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:38,149 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:38,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 11:44:38,149 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:38,155 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:38,155 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:38,156 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-12-07 11:44:38,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:38,173 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:38,185 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:38,188 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:38,188 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:38,199 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:38,199 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:38,199 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:33 [2019-12-07 11:44:38,279 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:38,279 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 72 [2019-12-07 11:44:38,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:38,280 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:38,314 INFO L614 ElimStorePlain]: treesize reduction 26, result has 72.6 percent of original size [2019-12-07 11:44:38,318 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-12-07 11:44:38,318 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:38,331 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:38,331 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:44:38,331 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:59 [2019-12-07 11:44:38,385 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:38,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 42 [2019-12-07 11:44:38,386 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:38,414 INFO L614 ElimStorePlain]: treesize reduction 14, result has 72.5 percent of original size [2019-12-07 11:44:38,417 INFO L377 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 26 treesize of output 10 [2019-12-07 11:44:38,417 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:38,423 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:38,423 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:38,423 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:77, output treesize:11 [2019-12-07 11:44:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:38,443 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:39,408 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:39,493 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:39,502 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:39,694 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-12-07 11:44:39,695 INFO L614 ElimStorePlain]: treesize reduction 56, result has 66.3 percent of original size [2019-12-07 11:44:39,699 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:39,837 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-12-07 11:44:39,838 INFO L614 ElimStorePlain]: treesize reduction 12, result has 81.3 percent of original size [2019-12-07 11:44:39,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:39,838 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 11:44:39,838 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:151, output treesize:29 [2019-12-07 11:44:39,978 INFO L377 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 14 treesize of output 12 [2019-12-07 11:44:39,979 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:39,982 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:39,983 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:39,983 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-12-07 11:44:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:40,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399514661] [2019-12-07 11:44:40,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:40,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2019-12-07 11:44:40,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613827380] [2019-12-07 11:44:40,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 11:44:40,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:40,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 11:44:40,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:44:40,100 INFO L87 Difference]: Start difference. First operand 250 states and 324 transitions. Second operand 20 states. [2019-12-07 11:44:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:44:42,734 INFO L93 Difference]: Finished difference Result 305 states and 372 transitions. [2019-12-07 11:44:42,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 11:44:42,735 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-12-07 11:44:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:44:42,736 INFO L225 Difference]: With dead ends: 305 [2019-12-07 11:44:42,736 INFO L226 Difference]: Without dead ends: 305 [2019-12-07 11:44:42,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 11:44:42,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-12-07 11:44:42,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 249. [2019-12-07 11:44:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-12-07 11:44:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 323 transitions. [2019-12-07 11:44:42,740 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 323 transitions. Word has length 31 [2019-12-07 11:44:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:44:42,740 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 323 transitions. [2019-12-07 11:44:42,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 11:44:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 323 transitions. [2019-12-07 11:44:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 11:44:42,741 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:44:42,741 INFO L410 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] [2019-12-07 11:44:42,941 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-12-07 11:44:42,942 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:44:42,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:44:42,942 INFO L82 PathProgramCache]: Analyzing trace with hash 906093808, now seen corresponding path program 1 times [2019-12-07 11:44:42,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:44:42,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487912814] [2019-12-07 11:44:42,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 11:44:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:44:43,029 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 11:44:43,030 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:44:43,033 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:44:43,033 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:43,034 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:43,035 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:43,035 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 11:44:43,050 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:43,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-12-07 11:44:43,051 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:43,063 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 11:44:43,063 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:43,063 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 11:44:43,073 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:44:43,073 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:43,083 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:43,083 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:44:43,083 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2019-12-07 11:44:43,134 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:43,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 61 [2019-12-07 11:44:43,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:43,135 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:43,158 INFO L614 ElimStorePlain]: treesize reduction 26, result has 62.9 percent of original size [2019-12-07 11:44:43,158 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:44:43,158 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:44 [2019-12-07 11:44:43,300 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:43,301 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 111 [2019-12-07 11:44:43,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:44:43,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:43,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:43,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:43,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:43,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:43,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:43,304 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-12-07 11:44:47,496 WARN L192 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2019-12-07 11:44:47,496 INFO L614 ElimStorePlain]: treesize reduction 922, result has 6.0 percent of original size [2019-12-07 11:44:47,497 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 11:44:47,497 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:69, output treesize:59 [2019-12-07 11:44:53,561 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-12-07 11:44:53,614 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:53,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 37 [2019-12-07 11:44:53,615 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:53,626 INFO L614 ElimStorePlain]: treesize reduction 16, result has 51.5 percent of original size [2019-12-07 11:44:53,626 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:44:53,626 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:17 [2019-12-07 11:44:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:53,685 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:44:54,072 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:44:54,089 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:44:54,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:44:54,089 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 11:44:54,089 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:20 [2019-12-07 11:44:54,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:44:54,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487912814] [2019-12-07 11:44:54,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:44:54,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 20 [2019-12-07 11:44:54,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417570714] [2019-12-07 11:44:54,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 11:44:54,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:44:54,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 11:44:54,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=340, Unknown=2, NotChecked=0, Total=420 [2019-12-07 11:44:54,160 INFO L87 Difference]: Start difference. First operand 249 states and 323 transitions. Second operand 21 states. [2019-12-07 11:45:10,747 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-12-07 11:45:18,157 WARN L192 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-12-07 11:45:20,724 WARN L192 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-12-07 11:45:22,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:45:22,217 INFO L93 Difference]: Finished difference Result 482 states and 572 transitions. [2019-12-07 11:45:22,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 11:45:22,218 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2019-12-07 11:45:22,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:45:22,220 INFO L225 Difference]: With dead ends: 482 [2019-12-07 11:45:22,220 INFO L226 Difference]: Without dead ends: 482 [2019-12-07 11:45:22,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=296, Invalid=955, Unknown=9, NotChecked=0, Total=1260 [2019-12-07 11:45:22,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-07 11:45:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 250. [2019-12-07 11:45:22,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 11:45:22,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 315 transitions. [2019-12-07 11:45:22,224 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 315 transitions. Word has length 31 [2019-12-07 11:45:22,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:45:22,224 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 315 transitions. [2019-12-07 11:45:22,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 11:45:22,224 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 315 transitions. [2019-12-07 11:45:22,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 11:45:22,224 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:45:22,224 INFO L410 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] [2019-12-07 11:45:22,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-12-07 11:45:22,425 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:45:22,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:45:22,426 INFO L82 PathProgramCache]: Analyzing trace with hash 906093809, now seen corresponding path program 1 times [2019-12-07 11:45:22,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:45:22,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048854282] [2019-12-07 11:45:22,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2019-12-07 11:45:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:45:22,488 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 11:45:22,489 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:45:22,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:45:22,492 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:45:22,493 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:45:22,493 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:45:22,493 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 11:45:22,497 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_100|], 1=[|v_#valid_121|]} [2019-12-07 11:45:22,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:45:22,499 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:45:22,506 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:45:22,511 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:45:22,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 11:45:22,511 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:45:22,516 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:45:22,516 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:45:22,516 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-12-07 11:45:22,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:45:22,529 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:45:22,546 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:45:22,549 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:45:22,549 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:45:22,560 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:45:22,560 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:45:22,560 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-12-07 11:45:22,626 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:45:22,626 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 70 [2019-12-07 11:45:22,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:45:22,627 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:45:22,661 INFO L614 ElimStorePlain]: treesize reduction 26, result has 72.0 percent of original size [2019-12-07 11:45:22,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-12-07 11:45:22,665 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:45:22,678 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:45:22,678 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:45:22,678 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:57 [2019-12-07 11:45:22,823 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:45:22,824 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 131 [2019-12-07 11:45:22,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:45:22,825 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:45:22,905 INFO L614 ElimStorePlain]: treesize reduction 80, result has 54.8 percent of original size [2019-12-07 11:45:22,935 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:45:22,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 48 treesize of output 70 [2019-12-07 11:45:22,936 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:45:22,992 INFO L614 ElimStorePlain]: treesize reduction 26, result has 77.0 percent of original size [2019-12-07 11:45:22,992 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 11:45:22,993 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:109, output treesize:87 [2019-12-07 11:45:29,067 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-12-07 11:45:29,132 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:45:29,132 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 46 [2019-12-07 11:45:29,132 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:45:29,169 INFO L614 ElimStorePlain]: treesize reduction 16, result has 70.9 percent of original size [2019-12-07 11:45:29,171 INFO L377 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 28 treesize of output 10 [2019-12-07 11:45:29,171 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:45:29,176 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:45:29,176 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:45:29,176 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:81, output treesize:11 [2019-12-07 11:45:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:45:29,226 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:45:31,713 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 11:45:34,246 WARN L192 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-12-07 11:46:31,330 WARN L192 SmtUtils]: Spent 613.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 11:47:28,193 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-12-07 11:47:28,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048854282] [2019-12-07 11:47:28,194 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2019-12-07 11:47:28,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1332255150] [2019-12-07 11:47:28,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:47:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:47:28,330 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 11:47:28,330 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:47:28,331 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@51d1c047 [2019-12-07 11:47:28,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676050820] [2019-12-07 11:47:28,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02912571-73a8-4fed-9c12-67aa1b7ab323/bin/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:47:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:47:28,373 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 11:47:28,374 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:47:28,374 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@51d1c047 [2019-12-07 11:47:28,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:47:28,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 11:47:28,375 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 11:47:28,375 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:47:28,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 mathsat -unsat_core_generation=3,31 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:47:29,002 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 11:47:29,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:47:29 BoogieIcfgContainer [2019-12-07 11:47:29,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:47:29,004 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:47:29,004 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:47:29,004 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:47:29,004 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:44:08" (3/4) ... [2019-12-07 11:47:29,009 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 11:47:29,009 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:47:29,010 INFO L168 Benchmark]: Toolchain (without parser) took 201664.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.3 MB). Free memory was 947.0 MB in the beginning and 810.2 MB in the end (delta: 136.8 MB). Peak memory consumption was 445.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:47:29,010 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:47:29,011 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -156.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:47:29,012 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:47:29,012 INFO L168 Benchmark]: Boogie Preprocessor took 26.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:47:29,012 INFO L168 Benchmark]: RCFGBuilder took 556.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.0 MB). Peak memory consumption was 65.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:47:29,013 INFO L168 Benchmark]: TraceAbstraction took 200718.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 1.0 GB in the beginning and 810.2 MB in the end (delta: 221.6 MB). Peak memory consumption was 407.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:47:29,013 INFO L168 Benchmark]: Witness Printer took 5.35 ms. Allocated memory is still 1.3 GB. Free memory is still 810.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:47:29,015 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 317.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -156.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 556.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.0 MB). Peak memory consumption was 65.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 200718.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 1.0 GB in the beginning and 810.2 MB in the end (delta: 221.6 MB). Peak memory consumption was 407.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.35 ms. Allocated memory is still 1.3 GB. Free memory is still 810.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1025]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); [L992] list->next = ((void*)0) [L993] COND FALSE !(!(list != ((void*)0))) [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) [L993] EXPR list->inner [L993] list->inner->next = ((void*)0) [L993] EXPR list->inner [L993] list->inner->inner = ((void*)0) [L993] EXPR list->inner [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list [L1012] COND FALSE !(!(((void*)0) != end)) [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; [L1017] EXPR end->inner [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner [L1020] COND TRUE len == 0 [L1021] len = 1 [L1024] COND FALSE !(!(((void*)0) != inner)) [L1025] inner->inner - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 184 locations, 78 error locations. Result: UNKNOWN, OverallTime: 200.6s, OverallIterations: 27, TraceHistogramMax: 2, AutomataDifference: 48.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4130 SDtfs, 6833 SDslu, 13309 SDs, 0 SdLazy, 9020 SolverSat, 398 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 22.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1181 GetRequests, 899 SyntacticMatches, 9 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 33.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=23, 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, 26 MinimizatonAttempts, 2266 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 18.1s InterpolantComputationTime, 562 NumberOfCodeBlocks, 562 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1068 ConstructedInterpolants, 60 QuantifiedInterpolants, 245848 SizeOfPredicates, 232 NumberOfNonLiveVariables, 1926 ConjunctsInSsa, 209 ConjunctsInUnsatCore, 56 InterpolantComputations, 50 PerfectInterpolantSequences, 6/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...