./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/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 041177a9b9f9d56d6ca6291d997bf38d41f568ad ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/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 041177a9b9f9d56d6ca6291d997bf38d41f568ad ...................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort FloatRoundingMode not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:21:33,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:33,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:33,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:33,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:33,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:33,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:33,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:33,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:33,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:33,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:33,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:33,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:33,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:33,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:33,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:33,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:33,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:33,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:33,313 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:33,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:33,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:33,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:33,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:33,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:33,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:33,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:33,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:33,320 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:33,321 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:33,321 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:33,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:33,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:33,323 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:33,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:33,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:33,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:33,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:33,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:33,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:33,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:33,327 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-10-22 11:21:33,338 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:33,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:33,339 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:33,339 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:33,339 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:33,340 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:33,340 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:21:33,341 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:33,341 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:33,341 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:21:33,341 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:21:33,341 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:33,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:21:33,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:21:33,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:33,343 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:33,343 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:21:33,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:33,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:33,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:33,343 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:21:33,344 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:21:33,344 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:21:33,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:33,344 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:33,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:33,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:33,345 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:33,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:33,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:33,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:33,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:33,346 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:21:33,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:21:33,346 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:33,346 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/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/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 -> 041177a9b9f9d56d6ca6291d997bf38d41f568ad [2019-10-22 11:21:33,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:33,401 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:33,407 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:33,408 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:33,408 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:33,409 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2019-10-22 11:21:33,460 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/data/86530e193/998d9c25f46d40359ec4e2a11ffa7c68/FLAG61cfd17a7 [2019-10-22 11:21:33,925 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:33,926 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2019-10-22 11:21:33,947 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/data/86530e193/998d9c25f46d40359ec4e2a11ffa7c68/FLAG61cfd17a7 [2019-10-22 11:21:34,437 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/data/86530e193/998d9c25f46d40359ec4e2a11ffa7c68 [2019-10-22 11:21:34,439 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:34,440 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:34,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:34,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:34,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:34,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:34" (1/1) ... [2019-10-22 11:21:34,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@334c694f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:34, skipping insertion in model container [2019-10-22 11:21:34,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:34" (1/1) ... [2019-10-22 11:21:34,454 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:34,508 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:34,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:35,013 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:35,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:35,159 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:35,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:35 WrapperNode [2019-10-22 11:21:35,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:35,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:35,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:35,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:35,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:35" (1/1) ... [2019-10-22 11:21:35,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:35" (1/1) ... [2019-10-22 11:21:35,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:35,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:35,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:35,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:35,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:35" (1/1) ... [2019-10-22 11:21:35,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:35" (1/1) ... [2019-10-22 11:21:35,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:35" (1/1) ... [2019-10-22 11:21:35,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:35" (1/1) ... [2019-10-22 11:21:35,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:35" (1/1) ... [2019-10-22 11:21:35,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:35" (1/1) ... [2019-10-22 11:21:35,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:35" (1/1) ... [2019-10-22 11:21:35,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:35,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:35,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:35,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:35,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/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-10-22 11:21:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:21:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:21:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:21:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:21:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:21:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:21:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:35,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:35,767 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:35,767 INFO L284 CfgBuilder]: Removed 16 assume(true) statements. [2019-10-22 11:21:35,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:35 BoogieIcfgContainer [2019-10-22 11:21:35,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:35,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:35,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:35,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:35,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:34" (1/3) ... [2019-10-22 11:21:35,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f87c08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:35, skipping insertion in model container [2019-10-22 11:21:35,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:35" (2/3) ... [2019-10-22 11:21:35,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f87c08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:35, skipping insertion in model container [2019-10-22 11:21:35,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:35" (3/3) ... [2019-10-22 11:21:35,776 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test10-1.i [2019-10-22 11:21:35,783 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:35,789 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 34 error locations. [2019-10-22 11:21:35,799 INFO L249 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2019-10-22 11:21:35,818 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:35,818 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:21:35,818 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:35,818 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:35,818 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:35,818 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:35,819 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:35,819 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-10-22 11:21:35,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:21:35,837 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:35,838 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:21:35,839 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:35,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:35,845 INFO L82 PathProgramCache]: Analyzing trace with hash 889508809, now seen corresponding path program 1 times [2019-10-22 11:21:35,854 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:35,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559458676] [2019-10-22 11:21:35,854 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:35,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:35,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:35,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559458676] [2019-10-22 11:21:35,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:35,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:35,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753614065] [2019-10-22 11:21:35,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:35,990 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:36,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:36,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:36,003 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-10-22 11:21:36,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:36,254 INFO L93 Difference]: Finished difference Result 283 states and 297 transitions. [2019-10-22 11:21:36,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:36,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-10-22 11:21:36,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:36,272 INFO L225 Difference]: With dead ends: 283 [2019-10-22 11:21:36,272 INFO L226 Difference]: Without dead ends: 275 [2019-10-22 11:21:36,275 INFO L600 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-10-22 11:21:36,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-10-22 11:21:36,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 76. [2019-10-22 11:21:36,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-22 11:21:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2019-10-22 11:21:36,313 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 6 [2019-10-22 11:21:36,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:36,313 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2019-10-22 11:21:36,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2019-10-22 11:21:36,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:21:36,314 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:36,314 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:21:36,315 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:36,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:36,315 INFO L82 PathProgramCache]: Analyzing trace with hash 889568391, now seen corresponding path program 1 times [2019-10-22 11:21:36,315 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:36,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949475945] [2019-10-22 11:21:36,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:36,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:36,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:36,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949475945] [2019-10-22 11:21:36,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:36,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:36,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612989077] [2019-10-22 11:21:36,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:36,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:36,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:36,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:36,358 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 3 states. [2019-10-22 11:21:36,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:36,477 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2019-10-22 11:21:36,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:36,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-10-22 11:21:36,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:36,479 INFO L225 Difference]: With dead ends: 144 [2019-10-22 11:21:36,479 INFO L226 Difference]: Without dead ends: 143 [2019-10-22 11:21:36,480 INFO L600 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-10-22 11:21:36,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-22 11:21:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 74. [2019-10-22 11:21:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-22 11:21:36,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2019-10-22 11:21:36,486 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 6 [2019-10-22 11:21:36,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:36,486 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2019-10-22 11:21:36,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:36,487 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2019-10-22 11:21:36,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:21:36,487 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:36,487 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:36,488 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:36,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:36,488 INFO L82 PathProgramCache]: Analyzing trace with hash 119444428, now seen corresponding path program 1 times [2019-10-22 11:21:36,488 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:36,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186224899] [2019-10-22 11:21:36,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:36,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:36,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:36,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186224899] [2019-10-22 11:21:36,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:36,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:36,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49552923] [2019-10-22 11:21:36,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:36,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:36,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:36,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:36,565 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 4 states. [2019-10-22 11:21:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:36,786 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2019-10-22 11:21:36,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:36,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:21:36,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:36,788 INFO L225 Difference]: With dead ends: 144 [2019-10-22 11:21:36,788 INFO L226 Difference]: Without dead ends: 144 [2019-10-22 11:21:36,788 INFO L600 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-10-22 11:21:36,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-22 11:21:36,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 79. [2019-10-22 11:21:36,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-22 11:21:36,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-10-22 11:21:36,794 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 8 [2019-10-22 11:21:36,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:36,795 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-10-22 11:21:36,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:36,795 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-10-22 11:21:36,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:21:36,795 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:36,795 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:36,796 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:36,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:36,796 INFO L82 PathProgramCache]: Analyzing trace with hash 119444429, now seen corresponding path program 1 times [2019-10-22 11:21:36,796 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:36,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953908586] [2019-10-22 11:21:36,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:36,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:36,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:36,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953908586] [2019-10-22 11:21:36,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:36,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:36,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066097589] [2019-10-22 11:21:36,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:36,899 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:36,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:36,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:36,900 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 6 states. [2019-10-22 11:21:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:37,295 INFO L93 Difference]: Finished difference Result 246 states and 262 transitions. [2019-10-22 11:21:37,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:21:37,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-10-22 11:21:37,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:37,298 INFO L225 Difference]: With dead ends: 246 [2019-10-22 11:21:37,298 INFO L226 Difference]: Without dead ends: 246 [2019-10-22 11:21:37,298 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-22 11:21:37,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 110. [2019-10-22 11:21:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-22 11:21:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2019-10-22 11:21:37,315 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 8 [2019-10-22 11:21:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:37,316 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2019-10-22 11:21:37,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2019-10-22 11:21:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:21:37,316 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:37,316 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:37,317 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:37,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:37,317 INFO L82 PathProgramCache]: Analyzing trace with hash 176702730, now seen corresponding path program 1 times [2019-10-22 11:21:37,317 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:37,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626034925] [2019-10-22 11:21:37,318 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:37,318 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:37,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:37,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626034925] [2019-10-22 11:21:37,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:37,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:37,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547362398] [2019-10-22 11:21:37,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:37,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:37,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:37,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:37,371 INFO L87 Difference]: Start difference. First operand 110 states and 142 transitions. Second operand 4 states. [2019-10-22 11:21:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:37,446 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2019-10-22 11:21:37,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:37,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:21:37,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:37,447 INFO L225 Difference]: With dead ends: 126 [2019-10-22 11:21:37,448 INFO L226 Difference]: Without dead ends: 124 [2019-10-22 11:21:37,448 INFO L600 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-10-22 11:21:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-22 11:21:37,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 66. [2019-10-22 11:21:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 11:21:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2019-10-22 11:21:37,452 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 8 [2019-10-22 11:21:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:37,452 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2019-10-22 11:21:37,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2019-10-22 11:21:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:21:37,453 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:37,459 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:37,459 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:37,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:37,460 INFO L82 PathProgramCache]: Analyzing trace with hash -270945900, now seen corresponding path program 1 times [2019-10-22 11:21:37,460 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:37,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909438744] [2019-10-22 11:21:37,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:37,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:37,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:37,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:37,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909438744] [2019-10-22 11:21:37,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:37,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:21:37,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189466460] [2019-10-22 11:21:37,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:37,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:37,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:37,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:37,551 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 6 states. [2019-10-22 11:21:37,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:37,684 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2019-10-22 11:21:37,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:21:37,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-22 11:21:37,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:37,685 INFO L225 Difference]: With dead ends: 130 [2019-10-22 11:21:37,686 INFO L226 Difference]: Without dead ends: 130 [2019-10-22 11:21:37,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:37,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-22 11:21:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 71. [2019-10-22 11:21:37,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-22 11:21:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2019-10-22 11:21:37,696 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 13 [2019-10-22 11:21:37,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:37,696 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2019-10-22 11:21:37,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2019-10-22 11:21:37,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:21:37,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:37,697 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:37,697 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:37,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:37,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1080292526, now seen corresponding path program 1 times [2019-10-22 11:21:37,698 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:37,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093218304] [2019-10-22 11:21:37,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:37,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:37,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:37,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093218304] [2019-10-22 11:21:37,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:37,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:37,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358605842] [2019-10-22 11:21:37,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:37,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:37,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:37,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:37,773 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 4 states. [2019-10-22 11:21:37,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:37,841 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2019-10-22 11:21:37,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:37,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-22 11:21:37,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:37,842 INFO L225 Difference]: With dead ends: 119 [2019-10-22 11:21:37,842 INFO L226 Difference]: Without dead ends: 119 [2019-10-22 11:21:37,842 INFO L600 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-10-22 11:21:37,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-22 11:21:37,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 70. [2019-10-22 11:21:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-22 11:21:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-10-22 11:21:37,846 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2019-10-22 11:21:37,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:37,846 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-10-22 11:21:37,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-10-22 11:21:37,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:21:37,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:37,847 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:37,848 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:37,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:37,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1220972534, now seen corresponding path program 1 times [2019-10-22 11:21:37,848 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:37,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175624702] [2019-10-22 11:21:37,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:37,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:37,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:37,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:37,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175624702] [2019-10-22 11:21:37,892 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:37,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:37,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546455157] [2019-10-22 11:21:37,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:37,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:37,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:37,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:37,894 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2019-10-22 11:21:38,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:38,079 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2019-10-22 11:21:38,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:21:38,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-22 11:21:38,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:38,080 INFO L225 Difference]: With dead ends: 114 [2019-10-22 11:21:38,080 INFO L226 Difference]: Without dead ends: 110 [2019-10-22 11:21:38,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:38,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-22 11:21:38,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 62. [2019-10-22 11:21:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-22 11:21:38,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-10-22 11:21:38,083 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 15 [2019-10-22 11:21:38,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:38,084 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-10-22 11:21:38,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:38,084 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-10-22 11:21:38,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:21:38,084 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:38,084 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:38,085 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:38,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:38,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1514178510, now seen corresponding path program 1 times [2019-10-22 11:21:38,085 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:38,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579254345] [2019-10-22 11:21:38,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:38,086 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:38,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:38,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:38,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579254345] [2019-10-22 11:21:38,146 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:38,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:38,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254224000] [2019-10-22 11:21:38,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:38,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:38,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:38,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:38,148 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 6 states. [2019-10-22 11:21:38,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:38,347 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2019-10-22 11:21:38,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:21:38,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-22 11:21:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:38,349 INFO L225 Difference]: With dead ends: 115 [2019-10-22 11:21:38,349 INFO L226 Difference]: Without dead ends: 115 [2019-10-22 11:21:38,349 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:21:38,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-22 11:21:38,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2019-10-22 11:21:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 11:21:38,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2019-10-22 11:21:38,353 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 16 [2019-10-22 11:21:38,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:38,353 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2019-10-22 11:21:38,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:38,354 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2019-10-22 11:21:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:21:38,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:38,354 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:38,355 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:38,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:38,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1514178509, now seen corresponding path program 1 times [2019-10-22 11:21:38,355 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:38,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697737872] [2019-10-22 11:21:38,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:38,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:38,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:38,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697737872] [2019-10-22 11:21:38,460 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:38,460 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:21:38,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737089593] [2019-10-22 11:21:38,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:21:38,461 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:38,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:21:38,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:38,462 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 8 states. [2019-10-22 11:21:38,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:38,906 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2019-10-22 11:21:38,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:21:38,907 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-10-22 11:21:38,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:38,908 INFO L225 Difference]: With dead ends: 115 [2019-10-22 11:21:38,908 INFO L226 Difference]: Without dead ends: 115 [2019-10-22 11:21:38,908 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:21:38,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-22 11:21:38,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2019-10-22 11:21:38,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 11:21:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-10-22 11:21:38,912 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 16 [2019-10-22 11:21:38,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:38,912 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-10-22 11:21:38,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:21:38,912 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-10-22 11:21:38,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:21:38,912 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:38,913 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:38,913 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:38,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:38,916 INFO L82 PathProgramCache]: Analyzing trace with hash -813113932, now seen corresponding path program 1 times [2019-10-22 11:21:38,916 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:38,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650859220] [2019-10-22 11:21:38,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:38,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:38,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:38,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:38,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650859220] [2019-10-22 11:21:38,992 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:38,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:21:38,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265616880] [2019-10-22 11:21:38,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:38,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:38,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:38,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:38,993 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 6 states. [2019-10-22 11:21:39,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:39,148 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2019-10-22 11:21:39,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:21:39,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-22 11:21:39,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:39,150 INFO L225 Difference]: With dead ends: 110 [2019-10-22 11:21:39,151 INFO L226 Difference]: Without dead ends: 105 [2019-10-22 11:21:39,151 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:39,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-22 11:21:39,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 60. [2019-10-22 11:21:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-22 11:21:39,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-10-22 11:21:39,160 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 16 [2019-10-22 11:21:39,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:39,160 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-10-22 11:21:39,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-10-22 11:21:39,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:21:39,161 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:39,161 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:39,161 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:39,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:39,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1149536387, now seen corresponding path program 1 times [2019-10-22 11:21:39,162 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:39,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41691574] [2019-10-22 11:21:39,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:39,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:39,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:39,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41691574] [2019-10-22 11:21:39,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:39,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:21:39,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607882825] [2019-10-22 11:21:39,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:21:39,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:39,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:21:39,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:39,294 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 10 states. [2019-10-22 11:21:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:39,753 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-10-22 11:21:39,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-22 11:21:39,753 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-10-22 11:21:39,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:39,754 INFO L225 Difference]: With dead ends: 127 [2019-10-22 11:21:39,754 INFO L226 Difference]: Without dead ends: 127 [2019-10-22 11:21:39,755 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2019-10-22 11:21:39,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-22 11:21:39,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 59. [2019-10-22 11:21:39,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-22 11:21:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-10-22 11:21:39,758 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 19 [2019-10-22 11:21:39,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:39,758 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-10-22 11:21:39,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:21:39,758 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-10-22 11:21:39,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:21:39,759 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:39,759 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:39,759 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:39,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:39,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1149536388, now seen corresponding path program 1 times [2019-10-22 11:21:39,760 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:39,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703843667] [2019-10-22 11:21:39,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:39,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:39,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:39,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703843667] [2019-10-22 11:21:39,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:39,930 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:21:39,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758215538] [2019-10-22 11:21:39,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:21:39,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:39,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:21:39,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:39,932 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 10 states. [2019-10-22 11:21:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:40,497 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-10-22 11:21:40,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-22 11:21:40,498 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-10-22 11:21:40,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:40,498 INFO L225 Difference]: With dead ends: 125 [2019-10-22 11:21:40,499 INFO L226 Difference]: Without dead ends: 125 [2019-10-22 11:21:40,499 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2019-10-22 11:21:40,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-22 11:21:40,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 58. [2019-10-22 11:21:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-22 11:21:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-10-22 11:21:40,502 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 19 [2019-10-22 11:21:40,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:40,503 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-10-22 11:21:40,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:21:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-10-22 11:21:40,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:21:40,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:40,504 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:40,504 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:40,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:40,505 INFO L82 PathProgramCache]: Analyzing trace with hash 897873764, now seen corresponding path program 1 times [2019-10-22 11:21:40,505 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:40,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769624719] [2019-10-22 11:21:40,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:40,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:40,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:40,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769624719] [2019-10-22 11:21:40,554 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:40,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:40,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422874560] [2019-10-22 11:21:40,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:40,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:40,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:40,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:40,556 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 4 states. [2019-10-22 11:21:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:40,637 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-10-22 11:21:40,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:40,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-22 11:21:40,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:40,638 INFO L225 Difference]: With dead ends: 57 [2019-10-22 11:21:40,638 INFO L226 Difference]: Without dead ends: 57 [2019-10-22 11:21:40,639 INFO L600 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-10-22 11:21:40,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-22 11:21:40,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-10-22 11:21:40,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-22 11:21:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-10-22 11:21:40,643 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 21 [2019-10-22 11:21:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:40,643 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-10-22 11:21:40,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-10-22 11:21:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:21:40,644 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:40,644 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:40,644 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:40,645 INFO L82 PathProgramCache]: Analyzing trace with hash 897873765, now seen corresponding path program 1 times [2019-10-22 11:21:40,645 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:40,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809879583] [2019-10-22 11:21:40,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:40,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:40,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:40,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:40,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809879583] [2019-10-22 11:21:40,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:40,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:40,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306324540] [2019-10-22 11:21:40,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:40,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:40,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:40,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:40,744 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 6 states. [2019-10-22 11:21:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:40,881 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-10-22 11:21:40,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:21:40,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-10-22 11:21:40,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:40,882 INFO L225 Difference]: With dead ends: 89 [2019-10-22 11:21:40,882 INFO L226 Difference]: Without dead ends: 89 [2019-10-22 11:21:40,883 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:40,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-22 11:21:40,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 56. [2019-10-22 11:21:40,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-22 11:21:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-10-22 11:21:40,885 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 21 [2019-10-22 11:21:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:40,891 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-10-22 11:21:40,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:40,891 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-10-22 11:21:40,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:21:40,891 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:40,891 INFO L380 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-10-22 11:21:40,892 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:40,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:40,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2064282042, now seen corresponding path program 1 times [2019-10-22 11:21:40,892 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:40,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842413436] [2019-10-22 11:21:40,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:40,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:40,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:41,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:41,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842413436] [2019-10-22 11:21:41,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:41,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:21:41,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538834941] [2019-10-22 11:21:41,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:21:41,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:41,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:21:41,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:41,004 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 10 states. [2019-10-22 11:21:41,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:41,492 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-10-22 11:21:41,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-22 11:21:41,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-10-22 11:21:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:41,493 INFO L225 Difference]: With dead ends: 119 [2019-10-22 11:21:41,493 INFO L226 Difference]: Without dead ends: 119 [2019-10-22 11:21:41,494 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2019-10-22 11:21:41,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-22 11:21:41,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 57. [2019-10-22 11:21:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-22 11:21:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-10-22 11:21:41,496 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 22 [2019-10-22 11:21:41,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:41,496 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-10-22 11:21:41,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:21:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-10-22 11:21:41,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:21:41,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:41,499 INFO L380 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-10-22 11:21:41,500 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:41,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:41,500 INFO L82 PathProgramCache]: Analyzing trace with hash 2064282941, now seen corresponding path program 1 times [2019-10-22 11:21:41,500 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:41,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756540285] [2019-10-22 11:21:41,500 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:41,501 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:41,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:41,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756540285] [2019-10-22 11:21:41,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:41,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:41,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262805579] [2019-10-22 11:21:41,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:41,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:41,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:41,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:41,562 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 6 states. [2019-10-22 11:21:41,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:41,688 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-10-22 11:21:41,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:21:41,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-10-22 11:21:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:41,689 INFO L225 Difference]: With dead ends: 60 [2019-10-22 11:21:41,689 INFO L226 Difference]: Without dead ends: 60 [2019-10-22 11:21:41,690 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:41,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-22 11:21:41,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2019-10-22 11:21:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-22 11:21:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-10-22 11:21:41,692 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 22 [2019-10-22 11:21:41,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:41,692 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-10-22 11:21:41,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:41,692 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-10-22 11:21:41,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:21:41,692 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:41,693 INFO L380 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-10-22 11:21:41,693 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:41,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:41,694 INFO L82 PathProgramCache]: Analyzing trace with hash 2064282942, now seen corresponding path program 1 times [2019-10-22 11:21:41,695 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:41,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184130013] [2019-10-22 11:21:41,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:41,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:41,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:41,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:41,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184130013] [2019-10-22 11:21:41,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:41,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:41,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811242280] [2019-10-22 11:21:41,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:41,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:41,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:41,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:41,775 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 6 states. [2019-10-22 11:21:41,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:41,918 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-10-22 11:21:41,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:21:41,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-10-22 11:21:41,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:41,920 INFO L225 Difference]: With dead ends: 70 [2019-10-22 11:21:41,920 INFO L226 Difference]: Without dead ends: 70 [2019-10-22 11:21:41,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-22 11:21:41,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55. [2019-10-22 11:21:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-22 11:21:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-10-22 11:21:41,922 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 22 [2019-10-22 11:21:41,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:41,922 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-10-22 11:21:41,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:41,922 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-10-22 11:21:41,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:21:41,923 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:41,923 INFO L380 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-10-22 11:21:41,923 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:41,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:41,924 INFO L82 PathProgramCache]: Analyzing trace with hash -431766010, now seen corresponding path program 1 times [2019-10-22 11:21:41,924 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:41,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099844074] [2019-10-22 11:21:41,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:41,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:41,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:42,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:42,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099844074] [2019-10-22 11:21:42,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:42,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-22 11:21:42,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129161461] [2019-10-22 11:21:42,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 11:21:42,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:42,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 11:21:42,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:21:42,116 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 15 states. [2019-10-22 11:21:42,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:42,808 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2019-10-22 11:21:42,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-22 11:21:42,809 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-10-22 11:21:42,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:42,809 INFO L225 Difference]: With dead ends: 112 [2019-10-22 11:21:42,809 INFO L226 Difference]: Without dead ends: 112 [2019-10-22 11:21:42,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2019-10-22 11:21:42,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-22 11:21:42,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 61. [2019-10-22 11:21:42,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 11:21:42,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-10-22 11:21:42,812 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 23 [2019-10-22 11:21:42,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:42,812 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-10-22 11:21:42,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 11:21:42,813 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-10-22 11:21:42,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:21:42,814 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:42,814 INFO L380 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-10-22 11:21:42,814 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:42,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:42,814 INFO L82 PathProgramCache]: Analyzing trace with hash -824793020, now seen corresponding path program 1 times [2019-10-22 11:21:42,815 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:42,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982379821] [2019-10-22 11:21:42,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:42,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:42,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:42,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:42,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982379821] [2019-10-22 11:21:42,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:42,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:21:42,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349897006] [2019-10-22 11:21:42,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:21:42,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:42,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:21:42,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:42,923 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 10 states. [2019-10-22 11:21:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:43,337 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-10-22 11:21:43,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 11:21:43,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-10-22 11:21:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:43,341 INFO L225 Difference]: With dead ends: 102 [2019-10-22 11:21:43,341 INFO L226 Difference]: Without dead ends: 102 [2019-10-22 11:21:43,341 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2019-10-22 11:21:43,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-22 11:21:43,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 62. [2019-10-22 11:21:43,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-22 11:21:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-10-22 11:21:43,344 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 23 [2019-10-22 11:21:43,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:43,344 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-10-22 11:21:43,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:21:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-10-22 11:21:43,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:21:43,346 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:43,346 INFO L380 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-10-22 11:21:43,346 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:43,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:43,347 INFO L82 PathProgramCache]: Analyzing trace with hash 201220286, now seen corresponding path program 1 times [2019-10-22 11:21:43,347 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:43,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599306840] [2019-10-22 11:21:43,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:43,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:43,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:43,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:43,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599306840] [2019-10-22 11:21:43,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:43,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:43,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891111934] [2019-10-22 11:21:43,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:43,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:43,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:43,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:43,403 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 5 states. [2019-10-22 11:21:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:43,507 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-10-22 11:21:43,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:43,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-10-22 11:21:43,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:43,508 INFO L225 Difference]: With dead ends: 63 [2019-10-22 11:21:43,508 INFO L226 Difference]: Without dead ends: 63 [2019-10-22 11:21:43,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:43,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-22 11:21:43,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-10-22 11:21:43,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-22 11:21:43,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-10-22 11:21:43,510 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 24 [2019-10-22 11:21:43,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:43,510 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-10-22 11:21:43,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-10-22 11:21:43,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:21:43,511 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:43,511 INFO L380 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-10-22 11:21:43,512 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:43,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:43,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1513391073, now seen corresponding path program 1 times [2019-10-22 11:21:43,512 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:43,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506152251] [2019-10-22 11:21:43,512 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:43,512 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:43,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:43,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506152251] [2019-10-22 11:21:43,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:43,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-22 11:21:43,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232655075] [2019-10-22 11:21:43,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 11:21:43,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:43,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 11:21:43,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:21:43,663 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 14 states. [2019-10-22 11:21:44,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:44,244 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2019-10-22 11:21:44,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-22 11:21:44,246 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-10-22 11:21:44,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:44,246 INFO L225 Difference]: With dead ends: 108 [2019-10-22 11:21:44,246 INFO L226 Difference]: Without dead ends: 108 [2019-10-22 11:21:44,247 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2019-10-22 11:21:44,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-22 11:21:44,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 69. [2019-10-22 11:21:44,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-22 11:21:44,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-22 11:21:44,249 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 26 [2019-10-22 11:21:44,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:44,249 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-22 11:21:44,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 11:21:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-22 11:21:44,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:21:44,250 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:44,250 INFO L380 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-10-22 11:21:44,250 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:44,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:44,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1513391074, now seen corresponding path program 1 times [2019-10-22 11:21:44,250 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:44,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097862642] [2019-10-22 11:21:44,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:44,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:44,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:44,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097862642] [2019-10-22 11:21:44,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:44,497 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-22 11:21:44,497 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605112585] [2019-10-22 11:21:44,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-22 11:21:44,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:44,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 11:21:44,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:21:44,498 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 16 states. [2019-10-22 11:21:45,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:45,168 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2019-10-22 11:21:45,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-22 11:21:45,168 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-10-22 11:21:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:45,169 INFO L225 Difference]: With dead ends: 108 [2019-10-22 11:21:45,169 INFO L226 Difference]: Without dead ends: 108 [2019-10-22 11:21:45,169 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=254, Invalid=936, Unknown=0, NotChecked=0, Total=1190 [2019-10-22 11:21:45,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-22 11:21:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 69. [2019-10-22 11:21:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-22 11:21:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-10-22 11:21:45,172 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 26 [2019-10-22 11:21:45,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:45,172 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-10-22 11:21:45,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-22 11:21:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-10-22 11:21:45,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:21:45,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:45,173 INFO L380 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-10-22 11:21:45,173 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:45,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:45,174 INFO L82 PathProgramCache]: Analyzing trace with hash 926585059, now seen corresponding path program 1 times [2019-10-22 11:21:45,174 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:45,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533197523] [2019-10-22 11:21:45,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:45,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:45,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:45,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:45,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533197523] [2019-10-22 11:21:45,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:45,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-22 11:21:45,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486701698] [2019-10-22 11:21:45,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-22 11:21:45,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:45,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 11:21:45,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:21:45,357 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 13 states. [2019-10-22 11:21:45,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:45,816 INFO L93 Difference]: Finished difference Result 94 states and 93 transitions. [2019-10-22 11:21:45,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-22 11:21:45,819 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-10-22 11:21:45,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:45,820 INFO L225 Difference]: With dead ends: 94 [2019-10-22 11:21:45,820 INFO L226 Difference]: Without dead ends: 94 [2019-10-22 11:21:45,821 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-10-22 11:21:45,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-22 11:21:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2019-10-22 11:21:45,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 11:21:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-10-22 11:21:45,823 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 26 [2019-10-22 11:21:45,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:45,823 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-10-22 11:21:45,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-22 11:21:45,823 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-10-22 11:21:45,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:21:45,824 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:45,824 INFO L380 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-10-22 11:21:45,824 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:45,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:45,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1220672855, now seen corresponding path program 1 times [2019-10-22 11:21:45,825 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:45,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361923036] [2019-10-22 11:21:45,825 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:45,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:45,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:46,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:46,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361923036] [2019-10-22 11:21:46,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:46,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-22 11:21:46,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044497265] [2019-10-22 11:21:46,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 11:21:46,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:46,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 11:21:46,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:21:46,004 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 12 states. [2019-10-22 11:21:46,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:46,295 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2019-10-22 11:21:46,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 11:21:46,295 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-10-22 11:21:46,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:46,296 INFO L225 Difference]: With dead ends: 64 [2019-10-22 11:21:46,296 INFO L226 Difference]: Without dead ends: 64 [2019-10-22 11:21:46,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2019-10-22 11:21:46,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-22 11:21:46,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-10-22 11:21:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-22 11:21:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-10-22 11:21:46,298 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 27 [2019-10-22 11:21:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:46,298 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-10-22 11:21:46,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 11:21:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-10-22 11:21:46,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 11:21:46,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:46,299 INFO L380 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-10-22 11:21:46,299 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:46,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:46,300 INFO L82 PathProgramCache]: Analyzing trace with hash 813847300, now seen corresponding path program 1 times [2019-10-22 11:21:46,300 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:46,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184586012] [2019-10-22 11:21:46,300 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:46,300 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:46,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:46,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184586012] [2019-10-22 11:21:46,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:46,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-22 11:21:46,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84105075] [2019-10-22 11:21:46,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 11:21:46,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:46,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 11:21:46,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:21:46,520 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 12 states. [2019-10-22 11:21:46,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:46,822 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-10-22 11:21:46,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 11:21:46,823 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-10-22 11:21:46,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:46,823 INFO L225 Difference]: With dead ends: 65 [2019-10-22 11:21:46,823 INFO L226 Difference]: Without dead ends: 51 [2019-10-22 11:21:46,823 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-10-22 11:21:46,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-22 11:21:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-10-22 11:21:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-22 11:21:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-10-22 11:21:46,825 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 28 [2019-10-22 11:21:46,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:46,825 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-10-22 11:21:46,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 11:21:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-10-22 11:21:46,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 11:21:46,826 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:46,826 INFO L380 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-10-22 11:21:46,826 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:46,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:46,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1161796369, now seen corresponding path program 1 times [2019-10-22 11:21:46,827 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:46,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796340665] [2019-10-22 11:21:46,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:46,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:46,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:47,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796340665] [2019-10-22 11:21:47,110 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:47,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-22 11:21:47,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762895508] [2019-10-22 11:21:47,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-22 11:21:47,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:47,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 11:21:47,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:21:47,111 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 16 states. [2019-10-22 11:21:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:47,612 INFO L93 Difference]: Finished difference Result 76 states and 75 transitions. [2019-10-22 11:21:47,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-22 11:21:47,612 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-10-22 11:21:47,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:47,612 INFO L225 Difference]: With dead ends: 76 [2019-10-22 11:21:47,612 INFO L226 Difference]: Without dead ends: 76 [2019-10-22 11:21:47,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=272, Invalid=988, Unknown=0, NotChecked=0, Total=1260 [2019-10-22 11:21:47,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-22 11:21:47,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 50. [2019-10-22 11:21:47,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-22 11:21:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-10-22 11:21:47,614 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 29 [2019-10-22 11:21:47,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:47,614 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-10-22 11:21:47,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-22 11:21:47,614 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-10-22 11:21:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 11:21:47,615 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:47,615 INFO L380 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-10-22 11:21:47,615 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:47,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:47,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1161796370, now seen corresponding path program 1 times [2019-10-22 11:21:47,615 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:47,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417619926] [2019-10-22 11:21:47,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:47,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:47,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:48,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417619926] [2019-10-22 11:21:48,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:48,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-22 11:21:48,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80879071] [2019-10-22 11:21:48,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-22 11:21:48,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:48,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-22 11:21:48,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-10-22 11:21:48,069 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 19 states. [2019-10-22 11:21:48,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:48,953 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-10-22 11:21:48,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-22 11:21:48,953 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2019-10-22 11:21:48,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:48,954 INFO L225 Difference]: With dead ends: 60 [2019-10-22 11:21:48,954 INFO L226 Difference]: Without dead ends: 60 [2019-10-22 11:21:48,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=329, Invalid=1231, Unknown=0, NotChecked=0, Total=1560 [2019-10-22 11:21:48,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-22 11:21:48,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2019-10-22 11:21:48,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-22 11:21:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-10-22 11:21:48,956 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 29 [2019-10-22 11:21:48,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:48,956 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-10-22 11:21:48,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-22 11:21:48,956 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-10-22 11:21:48,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:21:48,956 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:48,957 INFO L380 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-10-22 11:21:48,957 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:48,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:48,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1655949125, now seen corresponding path program 1 times [2019-10-22 11:21:48,958 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:48,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831818205] [2019-10-22 11:21:48,958 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:48,958 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:48,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:49,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:49,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831818205] [2019-10-22 11:21:49,334 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:49,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-22 11:21:49,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813178393] [2019-10-22 11:21:49,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-22 11:21:49,335 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:49,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-22 11:21:49,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-10-22 11:21:49,336 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 19 states. [2019-10-22 11:21:50,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:50,244 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-10-22 11:21:50,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-22 11:21:50,244 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-10-22 11:21:50,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:50,244 INFO L225 Difference]: With dead ends: 58 [2019-10-22 11:21:50,244 INFO L226 Difference]: Without dead ends: 58 [2019-10-22 11:21:50,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=335, Invalid=1387, Unknown=0, NotChecked=0, Total=1722 [2019-10-22 11:21:50,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-22 11:21:50,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2019-10-22 11:21:50,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-22 11:21:50,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-10-22 11:21:50,246 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 30 [2019-10-22 11:21:50,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:50,247 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-10-22 11:21:50,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-22 11:21:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-10-22 11:21:50,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:21:50,247 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:50,247 INFO L380 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-10-22 11:21:50,248 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:50,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:50,248 INFO L82 PathProgramCache]: Analyzing trace with hash -205184559, now seen corresponding path program 1 times [2019-10-22 11:21:50,248 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:50,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793865124] [2019-10-22 11:21:50,248 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:50,249 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:50,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:50,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793865124] [2019-10-22 11:21:50,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:50,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-22 11:21:50,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955582072] [2019-10-22 11:21:50,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-22 11:21:50,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:50,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-22 11:21:50,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-22 11:21:50,602 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 18 states. [2019-10-22 11:21:51,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:51,367 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-10-22 11:21:51,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-22 11:21:51,367 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-10-22 11:21:51,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:51,367 INFO L225 Difference]: With dead ends: 56 [2019-10-22 11:21:51,367 INFO L226 Difference]: Without dead ends: 56 [2019-10-22 11:21:51,368 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=318, Invalid=1242, Unknown=0, NotChecked=0, Total=1560 [2019-10-22 11:21:51,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-22 11:21:51,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2019-10-22 11:21:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 11:21:51,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-10-22 11:21:51,369 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 31 [2019-10-22 11:21:51,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:51,369 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-10-22 11:21:51,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-22 11:21:51,369 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-10-22 11:21:51,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:21:51,369 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:51,369 INFO L380 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] [2019-10-22 11:21:51,370 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:51,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:51,370 INFO L82 PathProgramCache]: Analyzing trace with hash -2065753913, now seen corresponding path program 1 times [2019-10-22 11:21:51,370 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:51,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447189790] [2019-10-22 11:21:51,370 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:51,370 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:51,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:51,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-10-22 11:21:51,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447189790] [2019-10-22 11:21:51,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:51,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-22 11:21:51,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473760833] [2019-10-22 11:21:51,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-22 11:21:51,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:51,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-22 11:21:51,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-22 11:21:51,645 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 18 states. [2019-10-22 11:21:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:52,414 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-10-22 11:21:52,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-22 11:21:52,414 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-10-22 11:21:52,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:52,414 INFO L225 Difference]: With dead ends: 54 [2019-10-22 11:21:52,415 INFO L226 Difference]: Without dead ends: 54 [2019-10-22 11:21:52,415 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=321, Invalid=1319, Unknown=0, NotChecked=0, Total=1640 [2019-10-22 11:21:52,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-22 11:21:52,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2019-10-22 11:21:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-22 11:21:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-10-22 11:21:52,417 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 32 [2019-10-22 11:21:52,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:52,417 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-10-22 11:21:52,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-22 11:21:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-10-22 11:21:52,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 11:21:52,418 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:52,418 INFO L380 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-10-22 11:21:52,418 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:52,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:52,419 INFO L82 PathProgramCache]: Analyzing trace with hash 386138261, now seen corresponding path program 1 times [2019-10-22 11:21:52,419 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:52,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683153919] [2019-10-22 11:21:52,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:52,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:52,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:52,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683153919] [2019-10-22 11:21:52,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:52,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-22 11:21:52,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029533759] [2019-10-22 11:21:52,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-22 11:21:52,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:52,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-22 11:21:52,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-10-22 11:21:52,774 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 18 states. [2019-10-22 11:21:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:53,561 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-10-22 11:21:53,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-22 11:21:53,562 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-10-22 11:21:53,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:53,562 INFO L225 Difference]: With dead ends: 53 [2019-10-22 11:21:53,562 INFO L226 Difference]: Without dead ends: 53 [2019-10-22 11:21:53,563 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=320, Invalid=1240, Unknown=0, NotChecked=0, Total=1560 [2019-10-22 11:21:53,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-22 11:21:53,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2019-10-22 11:21:53,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 11:21:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-10-22 11:21:53,565 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 33 [2019-10-22 11:21:53,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:53,565 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-10-22 11:21:53,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-22 11:21:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-10-22 11:21:53,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 11:21:53,565 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:53,566 INFO L380 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-10-22 11:21:53,566 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:53,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:53,566 INFO L82 PathProgramCache]: Analyzing trace with hash -914615733, now seen corresponding path program 1 times [2019-10-22 11:21:53,566 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:53,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402922029] [2019-10-22 11:21:53,567 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:53,567 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:53,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:53,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402922029] [2019-10-22 11:21:53,824 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:53,824 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-22 11:21:53,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895290795] [2019-10-22 11:21:53,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-22 11:21:53,825 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:53,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 11:21:53,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:21:53,826 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 16 states. [2019-10-22 11:21:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:54,362 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2019-10-22 11:21:54,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-22 11:21:54,362 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-10-22 11:21:54,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:54,362 INFO L225 Difference]: With dead ends: 64 [2019-10-22 11:21:54,362 INFO L226 Difference]: Without dead ends: 64 [2019-10-22 11:21:54,363 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=885, Unknown=0, NotChecked=0, Total=1122 [2019-10-22 11:21:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-22 11:21:54,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 44. [2019-10-22 11:21:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-22 11:21:54,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-10-22 11:21:54,365 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 34 [2019-10-22 11:21:54,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:54,365 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-10-22 11:21:54,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-22 11:21:54,365 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-10-22 11:21:54,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:21:54,366 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:54,366 INFO L380 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] [2019-10-22 11:21:54,366 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:54,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:54,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1711683477, now seen corresponding path program 1 times [2019-10-22 11:21:54,367 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:54,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908132077] [2019-10-22 11:21:54,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:54,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:54,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:54,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908132077] [2019-10-22 11:21:54,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:54,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-22 11:21:54,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758817643] [2019-10-22 11:21:54,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-22 11:21:54,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:54,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 11:21:54,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:21:54,629 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 16 states. [2019-10-22 11:21:55,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:55,210 INFO L93 Difference]: Finished difference Result 62 states and 61 transitions. [2019-10-22 11:21:55,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-22 11:21:55,210 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2019-10-22 11:21:55,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:55,211 INFO L225 Difference]: With dead ends: 62 [2019-10-22 11:21:55,211 INFO L226 Difference]: Without dead ends: 62 [2019-10-22 11:21:55,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=885, Unknown=0, NotChecked=0, Total=1122 [2019-10-22 11:21:55,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-22 11:21:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2019-10-22 11:21:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-22 11:21:55,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-10-22 11:21:55,212 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 35 [2019-10-22 11:21:55,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:55,213 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-10-22 11:21:55,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-22 11:21:55,213 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-10-22 11:21:55,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:21:55,213 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:55,213 INFO L380 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-10-22 11:21:55,214 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:55,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:55,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1522580365, now seen corresponding path program 1 times [2019-10-22 11:21:55,214 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:55,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630182433] [2019-10-22 11:21:55,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:55,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-10-22 11:21:55,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630182433] [2019-10-22 11:21:55,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:55,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-10-22 11:21:55,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550234759] [2019-10-22 11:21:55,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-22 11:21:55,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:55,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-22 11:21:55,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-10-22 11:21:55,694 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2019-10-22 11:21:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:57,053 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-10-22 11:21:57,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-22 11:21:57,054 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2019-10-22 11:21:57,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:57,054 INFO L225 Difference]: With dead ends: 50 [2019-10-22 11:21:57,054 INFO L226 Difference]: Without dead ends: 50 [2019-10-22 11:21:57,055 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=374, Invalid=1696, Unknown=0, NotChecked=0, Total=2070 [2019-10-22 11:21:57,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-22 11:21:57,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2019-10-22 11:21:57,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 11:21:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-10-22 11:21:57,056 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2019-10-22 11:21:57,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:57,056 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-10-22 11:21:57,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-22 11:21:57,056 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-10-22 11:21:57,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 11:21:57,057 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:57,057 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:57,057 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:57,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:57,058 INFO L82 PathProgramCache]: Analyzing trace with hash 42172794, now seen corresponding path program 1 times [2019-10-22 11:21:57,058 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:57,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757037520] [2019-10-22 11:21:57,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:57,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757037520] [2019-10-22 11:21:57,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:57,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:21:57,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405453257] [2019-10-22 11:21:57,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:21:57,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:57,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:21:57,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:57,213 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 10 states. [2019-10-22 11:21:57,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:57,509 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-10-22 11:21:57,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 11:21:57,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-10-22 11:21:57,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:57,510 INFO L225 Difference]: With dead ends: 41 [2019-10-22 11:21:57,511 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 11:21:57,511 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-10-22 11:21:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 11:21:57,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-22 11:21:57,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-22 11:21:57,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-10-22 11:21:57,512 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-10-22 11:21:57,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:57,512 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-10-22 11:21:57,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:21:57,512 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-10-22 11:21:57,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-22 11:21:57,512 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:57,512 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:57,513 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:57,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:57,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1307356755, now seen corresponding path program 1 times [2019-10-22 11:21:57,513 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:57,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268892381] [2019-10-22 11:21:57,513 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,513 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:57,625 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:21:57,625 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:21:57,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:21:57 BoogieIcfgContainer [2019-10-22 11:21:57,671 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:21:57,671 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:21:57,671 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:21:57,671 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:21:57,672 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:35" (3/4) ... [2019-10-22 11:21:57,676 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 11:21:57,676 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:21:57,682 INFO L168 Benchmark]: Toolchain (without parser) took 23236.95 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 500.2 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -283.5 MB). Peak memory consumption was 216.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:57,682 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:57,683 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -211.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:57,683 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:57,683 INFO L168 Benchmark]: Boogie Preprocessor took 26.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:57,684 INFO L168 Benchmark]: RCFGBuilder took 528.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:57,684 INFO L168 Benchmark]: TraceAbstraction took 21901.56 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 308.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.6 MB). Peak memory consumption was 196.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:57,684 INFO L168 Benchmark]: Witness Printer took 5.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:57,686 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 718.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -211.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 528.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21901.56 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 308.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.6 MB). Peak memory consumption was 196.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 787]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 787. Possible FailurePath: [L570] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [ldv_global_msg_list={-3:0}] [L527] COND TRUE __VERIFIER_nondet_int() [L528] return malloc(size); VAL [ldv_global_msg_list={-3:0}] [L774] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L775] COND FALSE !(!a10) [L527] COND TRUE __VERIFIER_nondet_int() [L528] return malloc(size); VAL [ldv_global_msg_list={-3:0}] [L776] a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) VAL [ldv_global_msg_list={-3:0}] [L777] EXPR a10->b VAL [ldv_global_msg_list={-3:0}] [L777] COND FALSE !(!a10->b) [L778] EXPR a10->b VAL [ldv_global_msg_list={-3:0}] [L527] COND TRUE __VERIFIER_nondet_int() [L528] return malloc(size); VAL [ldv_global_msg_list={-3:0}] [L778] a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) VAL [ldv_global_msg_list={-3:0}] [L779] EXPR a10->b VAL [ldv_global_msg_list={-3:0}] [L779] EXPR a10->b->c VAL [ldv_global_msg_list={-3:0}] [L779] COND FALSE !(!a10->b->c) [L768] EXPR a->b VAL [ldv_global_msg_list={-3:0}] [L768] EXPR a->b->c VAL [ldv_global_msg_list={-3:0}] [L527] COND TRUE __VERIFIER_nondet_int() [L528] return malloc(size); VAL [ldv_global_msg_list={-3:0}] [L768] a->b->c->p = (int *)ldv_malloc(sizeof(int)) VAL [ldv_global_msg_list={-3:0}] [L781] EXPR a10->b VAL [ldv_global_msg_list={-3:0}] [L781] EXPR a10->b->c VAL [ldv_global_msg_list={-3:0}] [L781] free(a10->b->c) VAL [ldv_global_msg_list={-3:0}] [L781] free(a10->b->c) VAL [ldv_global_msg_list={-3:0}] [L781] free(a10->b->c) [L783] EXPR a10->b VAL [ldv_global_msg_list={-3:0}] [L783] free(a10->b) VAL [ldv_global_msg_list={-3:0}] [L783] free(a10->b) VAL [ldv_global_msg_list={-3:0}] [L783] free(a10->b) [L785] free(a10) VAL [ldv_global_msg_list={-3:0}] [L785] free(a10) VAL [ldv_global_msg_list={-3:0}] [L785] free(a10) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 34 error locations. Result: UNSAFE, OverallTime: 21.8s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1353 SDtfs, 5413 SDslu, 3922 SDs, 0 SdLazy, 8370 SolverSat, 904 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 758 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 697 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3441 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=4, 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, 36 MinimizatonAttempts, 1384 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 842 NumberOfCodeBlocks, 842 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 766 ConstructedInterpolants, 0 QuantifiedInterpolants, 269140 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 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... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 11:21:59,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:59,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:59,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:59,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:59,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:59,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:59,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:59,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:59,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:59,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:59,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:59,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:59,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:59,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:59,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:59,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:59,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:59,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:59,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:59,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:59,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:59,933 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:59,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:59,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:59,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:59,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:59,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:59,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:59,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:59,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:59,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:59,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:59,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:59,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:59,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:59,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:59,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:59,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:59,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:59,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:59,947 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-10-22 11:21:59,960 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:59,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:59,961 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:59,962 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:59,962 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:59,962 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:59,962 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:59,962 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:59,962 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:59,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:21:59,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:21:59,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:59,964 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:59,964 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:21:59,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:59,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:59,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:59,964 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:21:59,965 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:21:59,965 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:21:59,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:59,965 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:21:59,966 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:21:59,966 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:59,966 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:21:59,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:59,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:59,967 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:59,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:59,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:59,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:59,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:59,968 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:21:59,968 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:21:59,968 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:59,968 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/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/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 -> 041177a9b9f9d56d6ca6291d997bf38d41f568ad [2019-10-22 11:21:59,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:00,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:00,013 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:00,015 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:00,015 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:00,016 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2019-10-22 11:22:00,068 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/data/3dcae0729/45f04274815248ef9c9a14c479eb307a/FLAG8a60ac262 [2019-10-22 11:22:00,592 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:00,594 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2019-10-22 11:22:00,612 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/data/3dcae0729/45f04274815248ef9c9a14c479eb307a/FLAG8a60ac262 [2019-10-22 11:22:01,085 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/data/3dcae0729/45f04274815248ef9c9a14c479eb307a [2019-10-22 11:22:01,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:01,090 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:01,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:01,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:01,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:01,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1cf3d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01, skipping insertion in model container [2019-10-22 11:22:01,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,105 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:01,145 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:01,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:01,610 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:01,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:01,791 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:01,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01 WrapperNode [2019-10-22 11:22:01,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:01,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:01,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:01,793 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:01,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,829 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:01,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:01,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:01,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:01,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:01,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:01,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:01,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:01,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/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-10-22 11:22:01,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:22:01,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:22:01,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:22:01,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:22:01,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:22:01,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:22:01,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:01,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:02,525 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:02,526 INFO L284 CfgBuilder]: Removed 16 assume(true) statements. [2019-10-22 11:22:02,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:02 BoogieIcfgContainer [2019-10-22 11:22:02,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:02,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:02,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:02,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:02,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:01" (1/3) ... [2019-10-22 11:22:02,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544047ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:02, skipping insertion in model container [2019-10-22 11:22:02,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (2/3) ... [2019-10-22 11:22:02,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544047ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:02, skipping insertion in model container [2019-10-22 11:22:02,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:02" (3/3) ... [2019-10-22 11:22:02,537 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test10-1.i [2019-10-22 11:22:02,550 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:02,559 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 34 error locations. [2019-10-22 11:22:02,572 INFO L249 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2019-10-22 11:22:02,596 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:02,596 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:22:02,596 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:02,597 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:02,597 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:02,597 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:02,597 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:02,598 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-10-22 11:22:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:22:02,630 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:02,631 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:22:02,633 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2019-10-22 11:22:02,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:02,642 INFO L82 PathProgramCache]: Analyzing trace with hash 889508809, now seen corresponding path program 1 times [2019-10-22 11:22:02,654 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:02,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1256103987] [2019-10-22 11:22:02,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c59de3ff-c0cd-409a-b261-b2b4f15b9f8d/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:02,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:02,920 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort FloatRoundingMode not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.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.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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-10-22 11:22:02,925 INFO L168 Benchmark]: Toolchain (without parser) took 1834.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -124.8 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:02,928 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:02,929 INFO L168 Benchmark]: CACSL2BoogieTranslator took 701.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:02,929 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.07 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-10-22 11:22:02,932 INFO L168 Benchmark]: Boogie Preprocessor took 32.52 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-10-22 11:22:02,932 INFO L168 Benchmark]: RCFGBuilder took 626.16 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: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:02,933 INFO L168 Benchmark]: TraceAbstraction took 394.84 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: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:02,935 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 701.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.07 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. * Boogie Preprocessor took 32.52 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 626.16 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: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 394.84 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: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort FloatRoundingMode not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort FloatRoundingMode not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...